Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r070-tall-171620505700339.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is CircularTrains-PT-048, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505700339
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 14:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 229K Apr 12 14:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 37K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-00
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-01
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-02
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-03
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-04
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-05
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-06
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-07
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-08
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-09
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-10
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-11
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-12
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-13
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-14
FORMULA_NAME CircularTrains-PT-048-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716282440196

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-048
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 09:07:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 09:07:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:07:21] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2024-05-21 09:07:21] [INFO ] Transformed 96 places.
[2024-05-21 09:07:21] [INFO ] Transformed 48 transitions.
[2024-05-21 09:07:21] [INFO ] Parsed PT model containing 96 places and 48 transitions and 192 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CircularTrains-PT-048-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-048-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 48/48 transitions.
Applied a total of 0 rules in 12 ms. Remains 96 /96 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 96 cols
[2024-05-21 09:07:21] [INFO ] Computed 49 invariants in 13 ms
[2024-05-21 09:07:21] [INFO ] Implicit Places using invariants in 218 ms returned [1, 13, 64, 81, 83, 89, 90]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 251 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/96 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 283 ms. Remains : 89/96 places, 48/48 transitions.
Support contains 39 out of 89 places after structural reductions.
[2024-05-21 09:07:22] [INFO ] Flatten gal took : 21 ms
[2024-05-21 09:07:22] [INFO ] Flatten gal took : 9 ms
[2024-05-21 09:07:22] [INFO ] Input system was already deterministic with 48 transitions.
Support contains 35 out of 89 places (down from 39) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1591 ms. (25 steps per ms) remains 6/24 properties
BEST_FIRST walk for 40002 steps (8 resets) in 194 ms. (205 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 190 ms. (209 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 165 ms. (240 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
// Phase 1: matrix 48 rows 89 cols
[2024-05-21 09:07:22] [INFO ] Computed 42 invariants in 17 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 14/21 variables, 8/8 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/27 variables, 3/11 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 5 solved, 1 unsolved
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 59/137 variables, and 19 constraints, problems are : Problem set: 6 solved, 0 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 11/27 constraints, Generalized P Invariants (flows): 8/15 constraints, State Equation: 0/89 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 125ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
FORMULA CircularTrains-PT-048-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-048-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-048-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(F(p1))))))'
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 89 transition count 44
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 85 transition count 44
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 85 transition count 41
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 82 transition count 41
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 80 transition count 39
Applied a total of 18 rules in 26 ms. Remains 80 /89 variables (removed 9) and now considering 39/48 (removed 9) transitions.
// Phase 1: matrix 39 rows 80 cols
[2024-05-21 09:07:23] [INFO ] Computed 42 invariants in 2 ms
[2024-05-21 09:07:23] [INFO ] Implicit Places using invariants in 79 ms returned [1, 12, 18, 56, 72, 76, 77, 78]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 79 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/89 places, 39/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 72 transition count 34
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 67 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 66 transition count 33
Applied a total of 12 rules in 8 ms. Remains 66 /72 variables (removed 6) and now considering 33/39 (removed 6) transitions.
// Phase 1: matrix 33 rows 66 cols
[2024-05-21 09:07:23] [INFO ] Computed 34 invariants in 1 ms
[2024-05-21 09:07:23] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 09:07:23] [INFO ] Invariant cache hit.
[2024-05-21 09:07:23] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/89 places, 33/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 269 ms. Remains : 66/89 places, 33/48 transitions.
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-01
Product exploration explored 100000 steps with 196 reset in 340 ms.
Product exploration explored 100000 steps with 182 reset in 270 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 (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 254 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 1780 steps (0 resets) in 40 ms. (43 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p1 p0))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 271 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 33/33 transitions.
Applied a total of 0 rules in 8 ms. Remains 66 /66 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-21 09:07:25] [INFO ] Invariant cache hit.
[2024-05-21 09:07:25] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 09:07:25] [INFO ] Invariant cache hit.
[2024-05-21 09:07:25] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-05-21 09:07:25] [INFO ] Redundant transitions in 0 ms returned []
Running 17 sub problems to find dead transitions.
[2024-05-21 09:07:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 32/65 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/66 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 33/99 variables, 66/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/99 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 100 constraints, problems are : Problem set: 0 solved, 17 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 32/65 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/66 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 33/99 variables, 66/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 17/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/99 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 117 constraints, problems are : Problem set: 0 solved, 17 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 682ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 683ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 834 ms. Remains : 66/66 places, 33/33 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 p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 477 steps (0 resets) in 13 ms. (34 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p1 p0))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 333 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 200 reset in 208 ms.
Product exploration explored 100000 steps with 184 reset in 220 ms.
Built C files in :
/tmp/ltsmin4261794101614008212
[2024-05-21 09:07:27] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2024-05-21 09:07:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:07:27] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2024-05-21 09:07:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:07:27] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2024-05-21 09:07:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:07:27] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4261794101614008212
Running compilation step : cd /tmp/ltsmin4261794101614008212;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 257 ms.
Running link step : cd /tmp/ltsmin4261794101614008212;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin4261794101614008212;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2738276292342711704.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 33/33 transitions.
Applied a total of 0 rules in 11 ms. Remains 66 /66 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-21 09:07:42] [INFO ] Invariant cache hit.
[2024-05-21 09:07:42] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 09:07:42] [INFO ] Invariant cache hit.
[2024-05-21 09:07:42] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-21 09:07:42] [INFO ] Redundant transitions in 0 ms returned []
Running 17 sub problems to find dead transitions.
[2024-05-21 09:07:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 32/65 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/66 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 33/99 variables, 66/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/99 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 100 constraints, problems are : Problem set: 0 solved, 17 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 32/65 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/66 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 33/99 variables, 66/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 17/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/99 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 117 constraints, problems are : Problem set: 0 solved, 17 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 593ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 595ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 750 ms. Remains : 66/66 places, 33/33 transitions.
Built C files in :
/tmp/ltsmin18070057010143812876
[2024-05-21 09:07:43] [INFO ] Computing symmetric may disable matrix : 33 transitions.
[2024-05-21 09:07:43] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:07:43] [INFO ] Computing symmetric may enable matrix : 33 transitions.
[2024-05-21 09:07:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:07:43] [INFO ] Computing Do-Not-Accords matrix : 33 transitions.
[2024-05-21 09:07:43] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:07:43] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18070057010143812876
Running compilation step : cd /tmp/ltsmin18070057010143812876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 140 ms.
Running link step : cd /tmp/ltsmin18070057010143812876;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin18070057010143812876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased994931430426990728.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 09:07:58] [INFO ] Flatten gal took : 4 ms
[2024-05-21 09:07:58] [INFO ] Flatten gal took : 4 ms
[2024-05-21 09:07:58] [INFO ] Time to serialize gal into /tmp/LTL2653965818731451806.gal : 2 ms
[2024-05-21 09:07:58] [INFO ] Time to serialize properties into /tmp/LTL16339508887809850814.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2653965818731451806.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3561927935633351828.hoa' '-atoms' '/tmp/LTL16339508887809850814.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16339508887809850814.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3561927935633351828.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
78 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.800991,46484,1,0,277,225456,28,1,1490,167980,694
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-048-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property CircularTrains-PT-048-LTLCardinality-01 finished in 36101 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 5 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-05-21 09:07:59] [INFO ] Computed 42 invariants in 1 ms
[2024-05-21 09:07:59] [INFO ] Implicit Places using invariants in 60 ms returned [2, 14, 20, 54, 61, 84, 85]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 61 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/89 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 82/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-02
Product exploration explored 100000 steps with 173 reset in 213 ms.
Product exploration explored 100000 steps with 155 reset in 219 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) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 429 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 1259 steps (0 resets) in 28 ms. (43 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 535 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 48 rows 82 cols
[2024-05-21 09:08:01] [INFO ] Computed 35 invariants in 2 ms
[2024-05-21 09:08:01] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2024-05-21 09:08:01] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 2 ms returned unsat
Proved EG (NOT p0)
[2024-05-21 09:08:01] [INFO ] Invariant cache hit.
[2024-05-21 09:08:01] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2024-05-21 09:08:01] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 2 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0)))), (G (NOT p0)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 549 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-048-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-048-LTLCardinality-02 finished in 2510 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 5 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-05-21 09:08:01] [INFO ] Computed 42 invariants in 0 ms
[2024-05-21 09:08:02] [INFO ] Implicit Places using invariants in 62 ms returned [2, 14, 54, 61, 79, 84, 85, 87]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 63 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 81/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Product exploration explored 100000 steps with 50000 reset in 130 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), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-048-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-048-LTLCardinality-03 finished in 435 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(G((G(F(p0)) U p1))))))'
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-05-21 09:08:02] [INFO ] Invariant cache hit.
[2024-05-21 09:08:02] [INFO ] Implicit Places using invariants in 64 ms returned [2, 14, 20, 54, 61, 79, 84, 85, 87]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 65 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 80/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-06
Product exploration explored 100000 steps with 1583 reset in 211 ms.
Product exploration explored 100000 steps with 1556 reset in 222 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 (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 340 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
RANDOM walk for 134 steps (0 resets) in 5 ms. (22 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 378 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 80 cols
[2024-05-21 09:08:04] [INFO ] Computed 33 invariants in 1 ms
[2024-05-21 09:08:04] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 09:08:04] [INFO ] Invariant cache hit.
[2024-05-21 09:08:04] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2024-05-21 09:08:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 31/79 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/80 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 48/128 variables, 80/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 113 constraints, problems are : Problem set: 0 solved, 32 unsolved in 474 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 31/79 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/80 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 48/128 variables, 80/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 32/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 145 constraints, problems are : Problem set: 0 solved, 32 unsolved in 741 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 1222ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1223ms
Finished structural reductions in LTL mode , in 1 iterations and 1340 ms. Remains : 80/80 places, 48/48 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 (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 253 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
RANDOM walk for 145 steps (0 resets) in 7 ms. (18 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 270 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1564 reset in 211 ms.
Product exploration explored 100000 steps with 1545 reset in 218 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 80 transition count 48
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 13 place count 80 transition count 48
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 80 transition count 48
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 15 rules in 8 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-05-21 09:08:08] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
// Phase 1: matrix 48 rows 80 cols
[2024-05-21 09:08:08] [INFO ] Computed 33 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 31/79 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-21 09:08:08] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 5 ms to minimize.
[2024-05-21 09:08:08] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-21 09:08:08] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-21 09:08:08] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-21 09:08:08] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-21 09:08:08] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-21 09:08:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-21 09:08:08] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-21 09:08:08] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-21 09:08:08] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-21 09:08:08] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-21 09:08:08] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-21 09:08:08] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-21 09:08:08] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 5 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-21 09:08:08] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-21 09:08:08] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD25 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 16/48 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/48 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/80 variables, 1/49 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/49 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 48/128 variables, 80/129 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/129 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/129 constraints. Problems are: Problem set: 15 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 129 constraints, problems are : Problem set: 15 solved, 17 unsolved in 832 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 15 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 46/79 variables, 31/31 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 16/48 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/48 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/80 variables, 1/49 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/49 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 48/128 variables, 80/129 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 17/146 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/146 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/128 variables, 0/146 constraints. Problems are: Problem set: 15 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 146 constraints, problems are : Problem set: 15 solved, 17 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 17/32 constraints, Known Traps: 16/16 constraints]
After SMT, in 1214ms problems are : Problem set: 15 solved, 17 unsolved
Search for dead transitions found 15 dead transitions in 1216ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 80/80 places, 33/48 transitions.
Graph (complete) has 128 edges and 80 vertex of which 65 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 65 /80 variables (removed 15) and now considering 33/33 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 65/80 places, 33/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1242 ms. Remains : 65/80 places, 33/48 transitions.
Built C files in :
/tmp/ltsmin10835220241520149363
[2024-05-21 09:08:09] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10835220241520149363
Running compilation step : cd /tmp/ltsmin10835220241520149363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 144 ms.
Running link step : cd /tmp/ltsmin10835220241520149363;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10835220241520149363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9446730847586592931.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 80 cols
[2024-05-21 09:08:24] [INFO ] Computed 33 invariants in 13 ms
[2024-05-21 09:08:24] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 09:08:24] [INFO ] Invariant cache hit.
[2024-05-21 09:08:24] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2024-05-21 09:08:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 31/79 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/80 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 48/128 variables, 80/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 113 constraints, problems are : Problem set: 0 solved, 32 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 31/79 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/80 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 48/128 variables, 80/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 32/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 145 constraints, problems are : Problem set: 0 solved, 32 unsolved in 740 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 1228ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1228ms
Finished structural reductions in LTL mode , in 1 iterations and 1371 ms. Remains : 80/80 places, 48/48 transitions.
Built C files in :
/tmp/ltsmin1121460322916765391
[2024-05-21 09:08:25] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1121460322916765391
Running compilation step : cd /tmp/ltsmin1121460322916765391;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 147 ms.
Running link step : cd /tmp/ltsmin1121460322916765391;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1121460322916765391;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2967370863415496536.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 09:08:40] [INFO ] Flatten gal took : 4 ms
[2024-05-21 09:08:40] [INFO ] Flatten gal took : 4 ms
[2024-05-21 09:08:40] [INFO ] Time to serialize gal into /tmp/LTL7645781280870516423.gal : 1 ms
[2024-05-21 09:08:40] [INFO ] Time to serialize properties into /tmp/LTL9545299489107149162.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7645781280870516423.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3740404266335012548.hoa' '-atoms' '/tmp/LTL9545299489107149162.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9545299489107149162.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3740404266335012548.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:08:55] [INFO ] Flatten gal took : 4 ms
[2024-05-21 09:08:55] [INFO ] Flatten gal took : 4 ms
[2024-05-21 09:08:55] [INFO ] Time to serialize gal into /tmp/LTL15269205284971014628.gal : 1 ms
[2024-05-21 09:08:55] [INFO ] Time to serialize properties into /tmp/LTL12253647826383222815.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15269205284971014628.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12253647826383222815.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("(F12<=Section_22)")||(X(G((G(F("(F12<=Section_22)")))U("(Section_8>=1)")))))))
Formula 0 simplified : F(!"(F12<=Section_22)" & XF(FG!"(F12<=Section_22)" R !"(Section_8>=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:09:11] [INFO ] Flatten gal took : 9 ms
[2024-05-21 09:09:11] [INFO ] Applying decomposition
[2024-05-21 09:09:11] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2766473414813264488.txt' '-o' '/tmp/graph2766473414813264488.bin' '-w' '/tmp/graph2766473414813264488.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2766473414813264488.bin' '-l' '-1' '-v' '-w' '/tmp/graph2766473414813264488.weights' '-q' '0' '-e' '0.001'
[2024-05-21 09:09:11] [INFO ] Decomposing Gal with order
[2024-05-21 09:09:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 09:09:11] [INFO ] Flatten gal took : 29 ms
[2024-05-21 09:09:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 09:09:11] [INFO ] Time to serialize gal into /tmp/LTL883059822096558038.gal : 2 ms
[2024-05-21 09:09:11] [INFO ] Time to serialize properties into /tmp/LTL10998488454751863217.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL883059822096558038.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10998488454751863217.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("(gu13.F12<=gu13.Section_22)")||(X(G((G(F("(gu13.F12<=gu13.Section_22)")))U("(gi0.gi3.gi0.gu1.Section_8>=1)")))))))
Formula 0 simplified : F(!"(gu13.F12<=gu13.Section_22)" & XF(FG!"(gu13.F12<=gu13.Section_22)" R !"(gi0.gi3.gi0.gu1.Section_8>=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-048-LTLCardinality-06 finished in 83849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0)) U G(p1)))))'
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-05-21 09:09:26] [INFO ] Computed 42 invariants in 2 ms
[2024-05-21 09:09:26] [INFO ] Implicit Places using invariants in 72 ms returned [2, 14, 20, 54, 61, 79, 84, 85, 87]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 73 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/89 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 80/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-07
Product exploration explored 100000 steps with 1824 reset in 241 ms.
Product exploration explored 100000 steps with 1828 reset in 242 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 103 steps (0 resets) in 6 ms. (14 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 312 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 80 cols
[2024-05-21 09:09:28] [INFO ] Computed 33 invariants in 2 ms
[2024-05-21 09:09:28] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 09:09:28] [INFO ] Invariant cache hit.
[2024-05-21 09:09:28] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2024-05-21 09:09:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 31/79 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/80 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 48/128 variables, 80/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 113 constraints, problems are : Problem set: 0 solved, 32 unsolved in 502 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 31/79 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/80 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 48/128 variables, 80/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 32/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 145 constraints, problems are : Problem set: 0 solved, 32 unsolved in 758 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 1266ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1267ms
Finished structural reductions in LTL mode , in 1 iterations and 1388 ms. Remains : 80/80 places, 48/48 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 202 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 247 steps (0 resets) in 5 ms. (41 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 366 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 1771 reset in 240 ms.
Product exploration explored 100000 steps with 1821 reset in 253 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 80 transition count 48
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 13 place count 80 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 80 transition count 48
Deduced a syphon composed of 16 places in 1 ms
Applied a total of 16 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-05-21 09:09:31] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
// Phase 1: matrix 48 rows 80 cols
[2024-05-21 09:09:31] [INFO ] Computed 33 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 31/79 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-21 09:09:31] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 09:09:31] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-21 09:09:31] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-21 09:09:31] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-21 09:09:31] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-21 09:09:32] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-21 09:09:32] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-21 09:09:32] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-21 09:09:32] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-21 09:09:32] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 7 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-21 09:09:32] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-21 09:09:32] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-21 09:09:32] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-21 09:09:32] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-21 09:09:32] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-21 09:09:32] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-05-21 09:09:32] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD24 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 17/49 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/49 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1/80 variables, 1/50 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/50 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 48/128 variables, 80/130 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/130 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/130 constraints. Problems are: Problem set: 16 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 130 constraints, problems are : Problem set: 16 solved, 16 unsolved in 801 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 16 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 47/79 variables, 31/31 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 17/49 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/49 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1/80 variables, 1/50 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/50 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 48/128 variables, 80/130 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 16/146 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/146 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/128 variables, 0/146 constraints. Problems are: Problem set: 16 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 146 constraints, problems are : Problem set: 16 solved, 16 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 16/32 constraints, Known Traps: 17/17 constraints]
After SMT, in 1216ms problems are : Problem set: 16 solved, 16 unsolved
Search for dead transitions found 16 dead transitions in 1217ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 80/80 places, 32/48 transitions.
Graph (complete) has 128 edges and 80 vertex of which 64 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 64 /80 variables (removed 16) and now considering 32/32 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/80 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1235 ms. Remains : 64/80 places, 32/48 transitions.
Built C files in :
/tmp/ltsmin15384485236571139886
[2024-05-21 09:09:32] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15384485236571139886
Running compilation step : cd /tmp/ltsmin15384485236571139886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 150 ms.
Running link step : cd /tmp/ltsmin15384485236571139886;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15384485236571139886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14319139843261444158.hoa' '--buchi-type=spotba'
LTSmin run took 177 ms.
FORMULA CircularTrains-PT-048-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-048-LTLCardinality-07 finished in 7157 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 89 transition count 44
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 85 transition count 44
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 85 transition count 41
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 82 transition count 41
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 80 transition count 39
Applied a total of 18 rules in 8 ms. Remains 80 /89 variables (removed 9) and now considering 39/48 (removed 9) transitions.
// Phase 1: matrix 39 rows 80 cols
[2024-05-21 09:09:33] [INFO ] Computed 42 invariants in 0 ms
[2024-05-21 09:09:33] [INFO ] Implicit Places using invariants in 68 ms returned [2, 13, 19, 51, 57, 72, 76, 77, 78]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 69 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/89 places, 39/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 71 transition count 33
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 65 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 65 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 64 transition count 32
Applied a total of 14 rules in 3 ms. Remains 64 /71 variables (removed 7) and now considering 32/39 (removed 7) transitions.
// Phase 1: matrix 32 rows 64 cols
[2024-05-21 09:09:33] [INFO ] Computed 33 invariants in 0 ms
[2024-05-21 09:09:33] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 09:09:33] [INFO ] Invariant cache hit.
[2024-05-21 09:09:33] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/89 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 177 ms. Remains : 64/89 places, 32/48 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-08
Product exploration explored 100000 steps with 6583 reset in 210 ms.
Product exploration explored 100000 steps with 6652 reset in 225 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 200 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 66 steps (0 resets) in 4 ms. (13 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 181 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
[2024-05-21 09:09:34] [INFO ] Invariant cache hit.
[2024-05-21 09:09:34] [INFO ] [Real]Absence check using 31 positive place invariants in 5 ms returned sat
[2024-05-21 09:09:34] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 09:09:34] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-21 09:09:34] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-21 09:09:34] [INFO ] Added : 14 causal constraints over 3 iterations in 45 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-21 09:09:34] [INFO ] Invariant cache hit.
[2024-05-21 09:09:34] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 09:09:34] [INFO ] Invariant cache hit.
[2024-05-21 09:09:34] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-21 09:09:34] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-21 09:09:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 564ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 564ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 681 ms. Remains : 64/64 places, 32/32 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 371 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 59 steps (0 resets) in 4 ms. (11 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 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
[2024-05-21 09:09:36] [INFO ] Invariant cache hit.
[2024-05-21 09:09:36] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2024-05-21 09:09:36] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 09:09:36] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-21 09:09:36] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 09:09:36] [INFO ] Added : 14 causal constraints over 3 iterations in 24 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6672 reset in 211 ms.
Product exploration explored 100000 steps with 6836 reset in 231 ms.
Built C files in :
/tmp/ltsmin1850763220892639112
[2024-05-21 09:09:36] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2024-05-21 09:09:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:09:36] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2024-05-21 09:09:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:09:36] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2024-05-21 09:09:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:09:36] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1850763220892639112
Running compilation step : cd /tmp/ltsmin1850763220892639112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 119 ms.
Running link step : cd /tmp/ltsmin1850763220892639112;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1850763220892639112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12624161402219884772.hoa' '--buchi-type=spotba'
LTSmin run took 611 ms.
FORMULA CircularTrains-PT-048-LTLCardinality-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-048-LTLCardinality-08 finished in 4349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U p1) U (G(p1)||!p0)))'
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 89 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 86 transition count 45
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 86 transition count 42
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 83 transition count 42
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 80 transition count 39
Applied a total of 18 rules in 16 ms. Remains 80 /89 variables (removed 9) and now considering 39/48 (removed 9) transitions.
// Phase 1: matrix 39 rows 80 cols
[2024-05-21 09:09:37] [INFO ] Computed 42 invariants in 1 ms
[2024-05-21 09:09:37] [INFO ] Implicit Places using invariants in 59 ms returned [1, 12, 18, 50, 72, 76, 77, 78]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 60 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/89 places, 39/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 72 transition count 34
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 67 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 66 transition count 33
Applied a total of 12 rules in 4 ms. Remains 66 /72 variables (removed 6) and now considering 33/39 (removed 6) transitions.
// Phase 1: matrix 33 rows 66 cols
[2024-05-21 09:09:37] [INFO ] Computed 34 invariants in 1 ms
[2024-05-21 09:09:37] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 09:09:37] [INFO ] Invariant cache hit.
[2024-05-21 09:09:37] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/89 places, 33/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 179 ms. Remains : 66/89 places, 33/48 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (OR p0 p1), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-048-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLCardinality-11 finished in 308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 89 transition count 44
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 85 transition count 44
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 85 transition count 41
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 82 transition count 41
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 79 transition count 38
Applied a total of 20 rules in 7 ms. Remains 79 /89 variables (removed 10) and now considering 38/48 (removed 10) transitions.
// Phase 1: matrix 38 rows 79 cols
[2024-05-21 09:09:38] [INFO ] Computed 42 invariants in 1 ms
[2024-05-21 09:09:38] [INFO ] Implicit Places using invariants in 65 ms returned [1, 12, 18, 50, 56, 71, 75, 76, 77]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 66 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/89 places, 38/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 70 transition count 33
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 65 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 64 transition count 32
Applied a total of 12 rules in 3 ms. Remains 64 /70 variables (removed 6) and now considering 32/38 (removed 6) transitions.
// Phase 1: matrix 32 rows 64 cols
[2024-05-21 09:09:38] [INFO ] Computed 33 invariants in 1 ms
[2024-05-21 09:09:38] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 09:09:38] [INFO ] Invariant cache hit.
[2024-05-21 09:09:38] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/89 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 200 ms. Remains : 64/89 places, 32/48 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 203 ms.
Stack based approach found an accepted trace after 62007 steps with 0 reset with depth 62008 and stack size 35180 in 174 ms.
FORMULA CircularTrains-PT-048-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-048-LTLCardinality-12 finished in 615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-05-21 09:09:38] [INFO ] Computed 42 invariants in 1 ms
[2024-05-21 09:09:38] [INFO ] Implicit Places using invariants in 53 ms returned [2, 20, 54, 61, 79, 84, 85, 87]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 65 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 81/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-048-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLCardinality-13 finished in 148 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F((p1 U (p2||G(p1))))))))'
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 89 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 86 transition count 45
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 86 transition count 43
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 84 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 82 transition count 41
Applied a total of 14 rules in 5 ms. Remains 82 /89 variables (removed 7) and now considering 41/48 (removed 7) transitions.
// Phase 1: matrix 41 rows 82 cols
[2024-05-21 09:09:38] [INFO ] Computed 42 invariants in 0 ms
[2024-05-21 09:09:38] [INFO ] Implicit Places using invariants in 54 ms returned [1, 12, 18, 50, 57, 73, 78, 80]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 65 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/89 places, 41/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 74 transition count 36
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 69 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 68 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 68 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 67 transition count 34
Applied a total of 14 rules in 2 ms. Remains 67 /74 variables (removed 7) and now considering 34/41 (removed 7) transitions.
// Phase 1: matrix 34 rows 67 cols
[2024-05-21 09:09:38] [INFO ] Computed 34 invariants in 0 ms
[2024-05-21 09:09:38] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 09:09:38] [INFO ] Invariant cache hit.
[2024-05-21 09:09:38] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/89 places, 34/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 181 ms. Remains : 67/89 places, 34/48 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-14
Product exploration explored 100000 steps with 2174 reset in 266 ms.
Product exploration explored 100000 steps with 2047 reset in 281 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 p2) (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 601 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (8 resets) in 208 ms. (191 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 251 ms. (158 steps per ms) remains 2/2 properties
[2024-05-21 09:09:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
After SMT solving in domain Real declared 13/101 variables, and 5 constraints, problems are : Problem set: 2 solved, 0 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 5/30 constraints, Generalized P Invariants (flows): 0/4 constraints, State Equation: 0/67 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 26ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (G (OR (NOT p0) (NOT p1) p2)), (G (OR p0 (NOT p1) p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR p0 p1 p2))), (F p1)]
Knowledge based reduction with 7 factoid took 1018 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 34/34 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2024-05-21 09:09:41] [INFO ] Invariant cache hit.
[2024-05-21 09:09:41] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 09:09:41] [INFO ] Invariant cache hit.
[2024-05-21 09:09:41] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-21 09:09:41] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-21 09:09:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 30/64 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 3/67 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 34/101 variables, 67/101 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 101 constraints, problems are : Problem set: 0 solved, 18 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 30/64 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 3/67 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 34/101 variables, 67/101 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 18/119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/101 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 119 constraints, problems are : Problem set: 0 solved, 18 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 625ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 626ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 736 ms. Remains : 67/67 places, 34/34 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 p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 457 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 117 steps (0 resets) in 5 ms. (19 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 1 factoid took 472 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1520 reset in 228 ms.
Product exploration explored 100000 steps with 1478 reset in 250 ms.
Built C files in :
/tmp/ltsmin8998247128623536853
[2024-05-21 09:09:44] [INFO ] Computing symmetric may disable matrix : 34 transitions.
[2024-05-21 09:09:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:09:44] [INFO ] Computing symmetric may enable matrix : 34 transitions.
[2024-05-21 09:09:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:09:44] [INFO ] Computing Do-Not-Accords matrix : 34 transitions.
[2024-05-21 09:09:44] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:09:44] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8998247128623536853
Running compilation step : cd /tmp/ltsmin8998247128623536853;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 131 ms.
Running link step : cd /tmp/ltsmin8998247128623536853;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8998247128623536853;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6226664530874537180.hoa' '--buchi-type=spotba'
LTSmin run took 295 ms.
FORMULA CircularTrains-PT-048-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-048-LTLCardinality-14 finished in 5919 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 89 cols
[2024-05-21 09:09:44] [INFO ] Computed 42 invariants in 0 ms
[2024-05-21 09:09:44] [INFO ] Implicit Places using invariants in 59 ms returned [2, 14, 20, 54, 61, 79, 85, 87]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 60 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/89 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 81/89 places, 48/48 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-048-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLCardinality-15 finished in 229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(G((G(F(p0)) U p1))))))'
Found a Lengthening insensitive property : CircularTrains-PT-048-LTLCardinality-06
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 89/89 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 89 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 87 transition count 46
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 87 transition count 42
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 83 transition count 42
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 80 transition count 39
Applied a total of 18 rules in 6 ms. Remains 80 /89 variables (removed 9) and now considering 39/48 (removed 9) transitions.
// Phase 1: matrix 39 rows 80 cols
[2024-05-21 09:09:45] [INFO ] Computed 42 invariants in 0 ms
[2024-05-21 09:09:45] [INFO ] Implicit Places using invariants in 58 ms returned [1, 12, 18, 50, 56, 71, 76, 77, 78]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 59 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 71/89 places, 39/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 71 transition count 34
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 66 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 66 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 65 transition count 33
Applied a total of 12 rules in 3 ms. Remains 65 /71 variables (removed 6) and now considering 33/39 (removed 6) transitions.
// Phase 1: matrix 33 rows 65 cols
[2024-05-21 09:09:45] [INFO ] Computed 33 invariants in 1 ms
[2024-05-21 09:09:45] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 09:09:45] [INFO ] Invariant cache hit.
[2024-05-21 09:09:45] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 65/89 places, 33/48 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 172 ms. Remains : 65/89 places, 33/48 transitions.
Running random walk in product with property : CircularTrains-PT-048-LTLCardinality-06
Product exploration explored 100000 steps with 2367 reset in 213 ms.
Product exploration explored 100000 steps with 2398 reset in 240 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))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 532 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
RANDOM walk for 240 steps (0 resets) in 6 ms. (34 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 439 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 65 /65 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-21 09:09:47] [INFO ] Invariant cache hit.
[2024-05-21 09:09:47] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 09:09:47] [INFO ] Invariant cache hit.
[2024-05-21 09:09:47] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 09:09:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 31/64 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 33/98 variables, 65/98 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/98 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 98 constraints, problems are : Problem set: 0 solved, 17 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 31/64 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 33/98 variables, 65/98 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 17/115 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/98 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 115 constraints, problems are : Problem set: 0 solved, 17 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 619ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 621ms
Finished structural reductions in LTL mode , in 1 iterations and 725 ms. Remains : 65/65 places, 33/33 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))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 328 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
RANDOM walk for 103 steps (0 resets) in 4 ms. (20 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 625 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2369 reset in 222 ms.
Product exploration explored 100000 steps with 2379 reset in 243 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-21 09:09:50] [INFO ] Redundant transitions in 0 ms returned []
Running 17 sub problems to find dead transitions.
[2024-05-21 09:09:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 31/64 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 33/98 variables, 65/98 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/98 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 98 constraints, problems are : Problem set: 0 solved, 17 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 31/64 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 33/98 variables, 65/98 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 17/115 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/98 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 115 constraints, problems are : Problem set: 0 solved, 17 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 648ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 650ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 657 ms. Remains : 65/65 places, 33/33 transitions.
Built C files in :
/tmp/ltsmin11404362317143296981
[2024-05-21 09:09:51] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11404362317143296981
Running compilation step : cd /tmp/ltsmin11404362317143296981;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 118 ms.
Running link step : cd /tmp/ltsmin11404362317143296981;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11404362317143296981;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased513242628493837989.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-05-21 09:10:06] [INFO ] Invariant cache hit.
[2024-05-21 09:10:06] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 09:10:06] [INFO ] Invariant cache hit.
[2024-05-21 09:10:06] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 09:10:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 31/64 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 33/98 variables, 65/98 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/98 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 98 constraints, problems are : Problem set: 0 solved, 17 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 31/64 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 33/98 variables, 65/98 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 17/115 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/98 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 115 constraints, problems are : Problem set: 0 solved, 17 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 550ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 551ms
Finished structural reductions in LTL mode , in 1 iterations and 664 ms. Remains : 65/65 places, 33/33 transitions.
Built C files in :
/tmp/ltsmin8133679553933790856
[2024-05-21 09:10:07] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8133679553933790856
Running compilation step : cd /tmp/ltsmin8133679553933790856;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 126 ms.
Running link step : cd /tmp/ltsmin8133679553933790856;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8133679553933790856;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7962420863128137018.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 09:10:22] [INFO ] Flatten gal took : 10 ms
[2024-05-21 09:10:22] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:10:22] [INFO ] Time to serialize gal into /tmp/LTL10702995104356746189.gal : 1 ms
[2024-05-21 09:10:22] [INFO ] Time to serialize properties into /tmp/LTL13884854424887296823.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10702995104356746189.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16969643670842077048.hoa' '-atoms' '/tmp/LTL13884854424887296823.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL13884854424887296823.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16969643670842077048.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:10:37] [INFO ] Flatten gal took : 5 ms
[2024-05-21 09:10:37] [INFO ] Flatten gal took : 2 ms
[2024-05-21 09:10:37] [INFO ] Time to serialize gal into /tmp/LTL1256637390824258323.gal : 1 ms
[2024-05-21 09:10:37] [INFO ] Time to serialize properties into /tmp/LTL4330625816969893993.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1256637390824258323.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4330625816969893993.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("(F12<=Section_22)")||(X(G((G(F("(F12<=Section_22)")))U("(Section_8>=1)")))))))
Formula 0 simplified : F(!"(F12<=Section_22)" & XF(FG!"(F12<=Section_22)" R !"(Section_8>=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:10:52] [INFO ] Flatten gal took : 8 ms
[2024-05-21 09:10:52] [INFO ] Applying decomposition
[2024-05-21 09:10:52] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4216565017118387508.txt' '-o' '/tmp/graph4216565017118387508.bin' '-w' '/tmp/graph4216565017118387508.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4216565017118387508.bin' '-l' '-1' '-v' '-w' '/tmp/graph4216565017118387508.weights' '-q' '0' '-e' '0.001'
[2024-05-21 09:10:52] [INFO ] Decomposing Gal with order
[2024-05-21 09:10:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 09:10:52] [INFO ] Flatten gal took : 4 ms
[2024-05-21 09:10:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 09:10:52] [INFO ] Time to serialize gal into /tmp/LTL16809963975500481505.gal : 1 ms
[2024-05-21 09:10:52] [INFO ] Time to serialize properties into /tmp/LTL956848019036716251.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16809963975500481505.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL956848019036716251.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("(gu29.F12<=gu29.Section_22)")||(X(G((G(F("(gu29.F12<=gu29.Section_22)")))U("(gi0.gi0.gi0.gi0.gu1.Section_8>=1)")))))))
Formula 0 simplified : F(!"(gu29.F12<=gu29.Section_22)" & XF(FG!"(gu29.F12<=gu29.Section_22)" R !"(gi0.gi0.gi0.gi0.gu1.Section_8>=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-048-LTLCardinality-06 finished in 82491 ms.
[2024-05-21 09:11:07] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15525045065994020812
[2024-05-21 09:11:07] [INFO ] Computing symmetric may disable matrix : 48 transitions.
[2024-05-21 09:11:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:11:07] [INFO ] Computing symmetric may enable matrix : 48 transitions.
[2024-05-21 09:11:07] [INFO ] Applying decomposition
[2024-05-21 09:11:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:11:07] [INFO ] Computing Do-Not-Accords matrix : 48 transitions.
[2024-05-21 09:11:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:11:07] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15525045065994020812
Running compilation step : cd /tmp/ltsmin15525045065994020812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 09:11:07] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11803333663447304922.txt' '-o' '/tmp/graph11803333663447304922.bin' '-w' '/tmp/graph11803333663447304922.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11803333663447304922.bin' '-l' '-1' '-v' '-w' '/tmp/graph11803333663447304922.weights' '-q' '0' '-e' '0.001'
[2024-05-21 09:11:07] [INFO ] Decomposing Gal with order
[2024-05-21 09:11:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 09:11:07] [INFO ] Flatten gal took : 5 ms
[2024-05-21 09:11:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 09:11:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality5916865225659111944.gal : 1 ms
[2024-05-21 09:11:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality5830459549419445589.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5916865225659111944.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5830459549419445589.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((G(("(gu22.F12<=gu22.Section_22)")||(X(G((G(F("(gu22.F12<=gu22.Section_22)")))U("(gi0.gi1.gi0.gu27.Section_8>=1)")))))))
Formula 0 simplified : F(!"(gu22.F12<=gu22.Section_22)" & XF(FG!"(gu22.F12<=gu22.Section_22)" R !"(gi0.gi1.gi0.gu27.Section_8>=1)"))
Compilation finished in 178 ms.
Running link step : cd /tmp/ltsmin15525045065994020812;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin15525045065994020812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X([](([](<>((LTLAPp0==true))) U (LTLAPp1==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( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: LTL layer: formula: [](((LTLAPp0==true)||X([](([](<>((LTLAPp0==true))) U (LTLAPp1==true))))))
pins2lts-mc-linux64( 2/ 8), 0.003: "[](((LTLAPp0==true)||X([](([](<>((LTLAPp0==true))) U (LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.043: DFS-FIFO for weak LTL, using special progress label 51
pins2lts-mc-linux64( 0/ 8), 0.043: There are 52 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.043: State length is 90, there are 60 groups
pins2lts-mc-linux64( 0/ 8), 0.043: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.043: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.043: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.043: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.166: ~1 levels ~960 states ~15064 transitions
pins2lts-mc-linux64( 0/ 8), 0.210: ~1 levels ~1920 states ~30144 transitions
pins2lts-mc-linux64( 3/ 8), 0.259: ~129 levels ~3840 states ~22728 transitions
pins2lts-mc-linux64( 3/ 8), 0.278: ~129 levels ~7680 states ~28808 transitions
pins2lts-mc-linux64( 3/ 8), 0.331: ~129 levels ~15360 states ~41856 transitions
pins2lts-mc-linux64( 3/ 8), 0.421: ~129 levels ~30720 states ~70008 transitions
pins2lts-mc-linux64( 3/ 8), 0.590: ~129 levels ~61440 states ~132064 transitions
pins2lts-mc-linux64( 3/ 8), 0.903: ~129 levels ~122880 states ~260352 transitions
pins2lts-mc-linux64( 3/ 8), 1.379: ~129 levels ~245760 states ~535304 transitions
pins2lts-mc-linux64( 3/ 8), 2.129: ~129 levels ~491520 states ~1118512 transitions
pins2lts-mc-linux64( 7/ 8), 3.043: ~113 levels ~983040 states ~2285096 transitions
pins2lts-mc-linux64( 7/ 8), 4.338: ~113 levels ~1966080 states ~4666424 transitions
pins2lts-mc-linux64( 6/ 8), 7.015: ~152 levels ~3932160 states ~9762632 transitions
pins2lts-mc-linux64( 7/ 8), 12.366: ~113 levels ~7864320 states ~20375248 transitions
pins2lts-mc-linux64( 6/ 8), 23.697: ~152 levels ~15728640 states ~42859384 transitions
pins2lts-mc-linux64( 6/ 8), 47.502: ~152 levels ~31457280 states ~88146008 transitions
pins2lts-mc-linux64( 5/ 8), 85.332: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 85.412:
pins2lts-mc-linux64( 0/ 8), 85.412: mean standard work distribution: 1.8% (states) 0.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 85.412:
pins2lts-mc-linux64( 0/ 8), 85.412: Explored 50103113 states 148469700 transitions, fanout: 2.963
pins2lts-mc-linux64( 0/ 8), 85.412: Total exploration time 85.350 sec (85.260 sec minimum, 85.308 sec on average)
pins2lts-mc-linux64( 0/ 8), 85.412: States per second: 587031, Transitions per second: 1739540
pins2lts-mc-linux64( 0/ 8), 85.412:
pins2lts-mc-linux64( 0/ 8), 85.412: Progress states detected: 18177
pins2lts-mc-linux64( 0/ 8), 85.412: Redundant explorations: -0.0395
pins2lts-mc-linux64( 0/ 8), 85.412:
pins2lts-mc-linux64( 0/ 8), 85.412: Queue width: 8B, total height: 22662, memory: 0.17MB
pins2lts-mc-linux64( 0/ 8), 85.412: Tree memory: 638.4MB, 13.4 B/state, compr.: 3.7%
pins2lts-mc-linux64( 0/ 8), 85.412: Tree fill ratio (roots/leafs): 37.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 85.412: Stored 48 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 85.412: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 85.412: Est. total memory use: 638.6MB (~1024.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15525045065994020812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X([](([](<>((LTLAPp0==true))) U (LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15525045065994020812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X([](([](<>((LTLAPp0==true))) U (LTLAPp1==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:840)
Detected timeout of ITS tools.
[2024-05-21 09:32:22] [INFO ] Flatten gal took : 9 ms
[2024-05-21 09:32:22] [INFO ] Time to serialize gal into /tmp/LTLCardinality552418402200384303.gal : 1 ms
[2024-05-21 09:32:22] [INFO ] Time to serialize properties into /tmp/LTLCardinality16111548788572542537.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality552418402200384303.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16111548788572542537.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((G(("(F12<=Section_22)")||(X(G((G(F("(F12<=Section_22)")))U("(Section_8>=1)")))))))
Formula 0 simplified : F(!"(F12<=Section_22)" & XF(FG!"(F12<=Section_22)" R !"(Section_8>=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 09:53:37] [INFO ] Flatten gal took : 3 ms
[2024-05-21 09:53:37] [INFO ] Input system was already deterministic with 48 transitions.
[2024-05-21 09:53:37] [INFO ] Transformed 89 places.
[2024-05-21 09:53:37] [INFO ] Transformed 48 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
[2024-05-21 09:53:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality842194902614858847.gal : 2 ms
[2024-05-21 09:53:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality13862412154171632986.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality842194902614858847.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13862412154171632986.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(("(F12<=Section_22)")||(X(G((G(F("(F12<=Section_22)")))U("(Section_8>=1)")))))))
Formula 0 simplified : F(!"(F12<=Section_22)" & XF(FG!"(F12<=Section_22)" R !"(Section_8>=1)"))
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CircularTrains-PT-048, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-tall-171620505700339"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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