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-171620505700356.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-192, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505700356
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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 4.1K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 12 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 14:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 12 14:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:33 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 147K 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-192-LTLFireability-00
FORMULA_NAME CircularTrains-PT-192-LTLFireability-01
FORMULA_NAME CircularTrains-PT-192-LTLFireability-02
FORMULA_NAME CircularTrains-PT-192-LTLFireability-03
FORMULA_NAME CircularTrains-PT-192-LTLFireability-04
FORMULA_NAME CircularTrains-PT-192-LTLFireability-05
FORMULA_NAME CircularTrains-PT-192-LTLFireability-06
FORMULA_NAME CircularTrains-PT-192-LTLFireability-07
FORMULA_NAME CircularTrains-PT-192-LTLFireability-08
FORMULA_NAME CircularTrains-PT-192-LTLFireability-09
FORMULA_NAME CircularTrains-PT-192-LTLFireability-10
FORMULA_NAME CircularTrains-PT-192-LTLFireability-11
FORMULA_NAME CircularTrains-PT-192-LTLFireability-12
FORMULA_NAME CircularTrains-PT-192-LTLFireability-13
FORMULA_NAME CircularTrains-PT-192-LTLFireability-14
FORMULA_NAME CircularTrains-PT-192-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716286056165

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-192
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 10:07:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 10:07:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:07:37] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-05-21 10:07:37] [INFO ] Transformed 384 places.
[2024-05-21 10:07:37] [INFO ] Transformed 192 transitions.
[2024-05-21 10:07:37] [INFO ] Parsed PT model containing 384 places and 192 transitions and 768 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA CircularTrains-PT-192-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-192-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-192-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-192-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-192-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-192-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 192/192 transitions.
Applied a total of 0 rules in 54 ms. Remains 384 /384 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 384 cols
[2024-05-21 10:07:37] [INFO ] Computed 193 invariants in 37 ms
[2024-05-21 10:07:38] [INFO ] Implicit Places using invariants in 498 ms returned [1, 10, 18, 21, 28, 37, 44, 47, 48, 62, 64, 65, 78, 81, 89, 101, 102, 133, 138, 141, 144, 146, 160, 163, 167, 217, 230, 231, 244, 245, 247, 261, 283, 284, 285, 293, 298, 311, 313, 314, 324, 327, 330, 333, 350, 354, 356, 357, 366, 369, 371, 374, 375, 376, 378, 380, 382]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 534 ms to find 57 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 327/384 places, 192/192 transitions.
Applied a total of 0 rules in 18 ms. Remains 327 /327 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 622 ms. Remains : 327/384 places, 192/192 transitions.
Support contains 38 out of 327 places after structural reductions.
[2024-05-21 10:07:38] [INFO ] Flatten gal took : 41 ms
[2024-05-21 10:07:38] [INFO ] Flatten gal took : 18 ms
[2024-05-21 10:07:38] [INFO ] Input system was already deterministic with 192 transitions.
RANDOM walk for 1028 steps (0 resets) in 142 ms. (7 steps per ms) remains 0/16 properties
FORMULA CircularTrains-PT-192-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 327 transition count 143
Reduce places removed 49 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 278 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 277 transition count 142
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 100 place count 277 transition count 135
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 114 place count 270 transition count 135
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 126 place count 264 transition count 129
Applied a total of 126 rules in 55 ms. Remains 264 /327 variables (removed 63) and now considering 129/192 (removed 63) transitions.
// Phase 1: matrix 129 rows 264 cols
[2024-05-21 10:07:38] [INFO ] Computed 136 invariants in 3 ms
[2024-05-21 10:07:39] [INFO ] Implicit Places using invariants in 196 ms returned [5, 55, 76, 139, 230, 242, 251]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 197 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 257/327 places, 129/192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 257 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 256 transition count 128
Applied a total of 2 rules in 10 ms. Remains 256 /257 variables (removed 1) and now considering 128/129 (removed 1) transitions.
// Phase 1: matrix 128 rows 256 cols
[2024-05-21 10:07:39] [INFO ] Computed 129 invariants in 3 ms
[2024-05-21 10:07:39] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-21 10:07:39] [INFO ] Invariant cache hit.
[2024-05-21 10:07:39] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 256/327 places, 128/192 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 681 ms. Remains : 256/327 places, 128/192 transitions.
Stuttering acceptance computed with spot in 282 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 723 ms.
Product exploration explored 100000 steps with 0 reset in 849 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), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 516 steps (0 resets) in 38 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2024-05-21 10:07:41] [INFO ] Invariant cache hit.
[2024-05-21 10:07:41] [INFO ] [Real]Absence check using 127 positive place invariants in 41 ms returned sat
[2024-05-21 10:07:41] [INFO ] [Real]Absence check using 127 positive and 2 generalized place invariants in 9 ms returned sat
[2024-05-21 10:07:42] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2024-05-21 10:07:42] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-21 10:07:42] [INFO ] Added : 62 causal constraints over 13 iterations in 389 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 128/128 transitions.
Applied a total of 0 rules in 7 ms. Remains 256 /256 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-21 10:07:42] [INFO ] Invariant cache hit.
[2024-05-21 10:07:42] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-21 10:07:42] [INFO ] Invariant cache hit.
[2024-05-21 10:07:42] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2024-05-21 10:07:43] [INFO ] Redundant transitions in 2 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-21 10:07:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 127/255 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/256 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 128/384 variables, 256/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/384 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 385 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2325 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 127/255 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/256 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 128/384 variables, 256/385 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 64/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/384 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 449 constraints, problems are : Problem set: 0 solved, 64 unsolved in 8878 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 11232ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 11238ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11603 ms. Remains : 256/256 places, 128/128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 330 steps (0 resets) in 10 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2024-05-21 10:07:54] [INFO ] Invariant cache hit.
[2024-05-21 10:07:54] [INFO ] [Real]Absence check using 127 positive place invariants in 72 ms returned sat
[2024-05-21 10:07:54] [INFO ] [Real]Absence check using 127 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-21 10:07:55] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2024-05-21 10:07:55] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-21 10:07:55] [INFO ] Added : 62 causal constraints over 13 iterations in 407 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 642 ms.
Product exploration explored 100000 steps with 0 reset in 748 ms.
Built C files in :
/tmp/ltsmin9640362756831682608
[2024-05-21 10:07:56] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2024-05-21 10:07:56] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:07:56] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2024-05-21 10:07:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:07:57] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2024-05-21 10:07:57] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:07:57] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9640362756831682608
Running compilation step : cd /tmp/ltsmin9640362756831682608;'/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 443 ms.
Running link step : cd /tmp/ltsmin9640362756831682608;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin9640362756831682608;'/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/stateBased17957866423667522931.hoa' '--buchi-type=spotba'
LTSmin run took 643 ms.
FORMULA CircularTrains-PT-192-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-192-LTLFireability-03 finished in 19368 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(G((F(p0) U p1)))))'
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 327 /327 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 327 cols
[2024-05-21 10:07:58] [INFO ] Computed 136 invariants in 8 ms
[2024-05-21 10:07:58] [INFO ] Implicit Places using invariants in 174 ms returned [6, 63, 171, 289, 302, 312]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 176 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 321/327 places, 192/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 183 ms. Remains : 321/327 places, 192/192 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-06
Product exploration explored 100000 steps with 737 reset in 777 ms.
Product exploration explored 100000 steps with 737 reset in 799 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 (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 416 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 349 steps (0 resets) in 8 ms. (38 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 468 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 192 rows 321 cols
[2024-05-21 10:08:01] [INFO ] Computed 130 invariants in 3 ms
[2024-05-21 10:08:01] [INFO ] [Real]Absence check using 127 positive place invariants in 79 ms returned sat
[2024-05-21 10:08:01] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 9 ms returned sat
[2024-05-21 10:08:02] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2024-05-21 10:08:02] [INFO ] Computed and/alt/rep : 128/192/128 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-21 10:08:03] [INFO ] Added : 125 causal constraints over 25 iterations in 1084 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-21 10:08:03] [INFO ] Invariant cache hit.
[2024-05-21 10:08:03] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-21 10:08:03] [INFO ] Invariant cache hit.
[2024-05-21 10:08:03] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-05-21 10:08:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 127/320 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/321 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 192/513 variables, 321/451 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/513 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 451 constraints, problems are : Problem set: 0 solved, 128 unsolved in 5619 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 127/320 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/321 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 192/513 variables, 321/451 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 128/579 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/513 variables, and 579 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 35673ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 35676ms
Finished structural reductions in LTL mode , in 1 iterations and 36177 ms. Remains : 321/321 places, 192/192 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 379 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 465 steps (0 resets) in 19 ms. (23 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 373 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-21 10:08:40] [INFO ] Invariant cache hit.
[2024-05-21 10:08:40] [INFO ] [Real]Absence check using 127 positive place invariants in 25 ms returned sat
[2024-05-21 10:08:40] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 14 ms returned sat
[2024-05-21 10:08:41] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2024-05-21 10:08:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:08:41] [INFO ] [Nat]Absence check using 127 positive place invariants in 27 ms returned sat
[2024-05-21 10:08:41] [INFO ] [Nat]Absence check using 127 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-21 10:08:41] [INFO ] [Nat]Absence check using state equation in 536 ms returned sat
[2024-05-21 10:08:41] [INFO ] Computed and/alt/rep : 128/192/128 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-21 10:08:42] [INFO ] Added : 125 causal constraints over 25 iterations in 1039 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 763 reset in 751 ms.
Product exploration explored 100000 steps with 768 reset in 812 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 192/192 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 321 transition count 192
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 60 place count 321 transition count 192
Deduced a syphon composed of 62 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 321 transition count 192
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 321 transition count 192
Deduced a syphon composed of 63 places in 0 ms
Applied a total of 63 rules in 52 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-21 10:08:44] [INFO ] Redundant transitions in 6 ms returned []
Running 128 sub problems to find dead transitions.
// Phase 1: matrix 192 rows 321 cols
[2024-05-21 10:08:44] [INFO ] Computed 130 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 127/320 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-21 10:08:45] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 10 ms to minimize.
[2024-05-21 10:08:45] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-21 10:08:46] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-21 10:08:46] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-21 10:08:46] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-05-21 10:08:46] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-21 10:08:46] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-21 10:08:46] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-05-21 10:08:46] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-21 10:08:46] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-21 10:08:46] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-21 10:08:46] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-21 10:08:46] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2024-05-21 10:08:46] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-21 10:08:46] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-21 10:08:46] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-05-21 10:08:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-21 10:08:46] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-21 10:08:46] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-21 10:08:46] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD122 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 20/149 constraints. Problems are: Problem set: 20 solved, 108 unsolved
[2024-05-21 10:08:47] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-21 10:08:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-21 10:08:47] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-21 10:08:47] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-05-21 10:08:47] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-05-21 10:08:47] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD98 is UNSAT
[2024-05-21 10:08:47] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 7/156 constraints. Problems are: Problem set: 27 solved, 101 unsolved
[2024-05-21 10:08:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-21 10:08:47] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-05-21 10:08:47] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-21 10:08:47] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-21 10:08:47] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-21 10:08:47] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-21 10:08:48] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-21 10:08:48] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 4 ms to minimize.
[2024-05-21 10:08:48] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-21 10:08:48] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-21 10:08:48] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-21 10:08:48] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-21 10:08:48] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-21 10:08:48] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-21 10:08:48] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-21 10:08:48] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-21 10:08:48] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-21 10:08:48] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-05-21 10:08:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-21 10:08:48] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 20/176 constraints. Problems are: Problem set: 47 solved, 81 unsolved
[2024-05-21 10:08:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-21 10:08:48] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-21 10:08:48] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD74 is UNSAT
[2024-05-21 10:08:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-21 10:08:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD83 is UNSAT
[2024-05-21 10:08:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-21 10:08:49] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-21 10:08:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 8/184 constraints. Problems are: Problem set: 55 solved, 73 unsolved
[2024-05-21 10:08:49] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-21 10:08:49] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 3 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-21 10:08:49] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-21 10:08:49] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-21 10:08:49] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-21 10:08:50] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD87 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 6/190 constraints. Problems are: Problem set: 61 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 0/190 constraints. Problems are: Problem set: 61 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 1/321 variables, 1/191 constraints. Problems are: Problem set: 61 solved, 67 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 0/191 constraints. Problems are: Problem set: 61 solved, 67 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD29 is UNSAT
At refinement iteration 11 (OVERLAPS) 192/513 variables, 321/512 constraints. Problems are: Problem set: 63 solved, 65 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/513 variables, 0/512 constraints. Problems are: Problem set: 63 solved, 65 unsolved
At refinement iteration 13 (OVERLAPS) 0/513 variables, 0/512 constraints. Problems are: Problem set: 63 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 512 constraints, problems are : Problem set: 63 solved, 65 unsolved in 7654 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 63 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 63 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 190/320 variables, 127/127 constraints. Problems are: Problem set: 63 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 2/129 constraints. Problems are: Problem set: 63 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 61/190 constraints. Problems are: Problem set: 63 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/190 constraints. Problems are: Problem set: 63 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 1/321 variables, 1/191 constraints. Problems are: Problem set: 63 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/191 constraints. Problems are: Problem set: 63 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 192/513 variables, 321/512 constraints. Problems are: Problem set: 63 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 65/577 constraints. Problems are: Problem set: 63 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/513 variables, 0/577 constraints. Problems are: Problem set: 63 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/513 variables, 0/577 constraints. Problems are: Problem set: 63 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 513/513 variables, and 577 constraints, problems are : Problem set: 63 solved, 65 unsolved in 6050 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 65/128 constraints, Known Traps: 61/61 constraints]
After SMT, in 13726ms problems are : Problem set: 63 solved, 65 unsolved
Search for dead transitions found 63 dead transitions in 13731ms
Found 63 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 63 transitions
Dead transitions reduction (with SMT) removed 63 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 321/321 places, 129/192 transitions.
Graph (complete) has 516 edges and 321 vertex of which 258 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.1 ms
Discarding 63 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 20 ms. Remains 258 /321 variables (removed 63) and now considering 129/129 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 258/321 places, 129/192 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13820 ms. Remains : 258/321 places, 129/192 transitions.
Built C files in :
/tmp/ltsmin12425378349969777238
[2024-05-21 10:08:58] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12425378349969777238
Running compilation step : cd /tmp/ltsmin12425378349969777238;'/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 399 ms.
Running link step : cd /tmp/ltsmin12425378349969777238;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12425378349969777238;'/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/stateBased2104962368896515696.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 192/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 321 cols
[2024-05-21 10:09:13] [INFO ] Computed 130 invariants in 4 ms
[2024-05-21 10:09:14] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-21 10:09:14] [INFO ] Invariant cache hit.
[2024-05-21 10:09:14] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-05-21 10:09:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 127/320 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/321 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 192/513 variables, 321/451 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/513 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 451 constraints, problems are : Problem set: 0 solved, 128 unsolved in 6005 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 127/320 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/321 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 192/513 variables, 321/451 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 128/579 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/513 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 513/513 variables, and 579 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 36046ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 36053ms
Finished structural reductions in LTL mode , in 1 iterations and 36456 ms. Remains : 321/321 places, 192/192 transitions.
Built C files in :
/tmp/ltsmin5516110694958036911
[2024-05-21 10:09:50] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5516110694958036911
Running compilation step : cd /tmp/ltsmin5516110694958036911;'/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 367 ms.
Running link step : cd /tmp/ltsmin5516110694958036911;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin5516110694958036911;'/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/stateBased1074870276966652869.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 10:10:05] [INFO ] Flatten gal took : 18 ms
[2024-05-21 10:10:05] [INFO ] Flatten gal took : 12 ms
[2024-05-21 10:10:05] [INFO ] Time to serialize gal into /tmp/LTL13379814657989768173.gal : 4 ms
[2024-05-21 10:10:05] [INFO ] Time to serialize properties into /tmp/LTL17237761599670071535.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13379814657989768173.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7817720845280134756.hoa' '-atoms' '/tmp/LTL17237761599670071535.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...319
Loading property file /tmp/LTL17237761599670071535.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7817720845280134756.hoa
Detected timeout of ITS tools.
[2024-05-21 10:10:20] [INFO ] Flatten gal took : 11 ms
[2024-05-21 10:10:20] [INFO ] Flatten gal took : 11 ms
[2024-05-21 10:10:20] [INFO ] Time to serialize gal into /tmp/LTL5550437107053481732.gal : 3 ms
[2024-05-21 10:10:20] [INFO ] Time to serialize properties into /tmp/LTL6541990471056739453.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5550437107053481732.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6541990471056739453.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 : !(((F("((Section_11>=1)&&(F12>=1))"))||(X(G((F("((Section_11>=1)&&(F12>=1))"))U("((F110>=1)&&(Section_109>=1))"))))))
Formula 0 simplified : G!"((Section_11>=1)&&(F12>=1))" & XF(G!"((Section_11>=1)&&(F12>=1))" R !"((F110>=1)&&(Section_109>=1))")
Detected timeout of ITS tools.
[2024-05-21 10:10:35] [INFO ] Flatten gal took : 10 ms
[2024-05-21 10:10:35] [INFO ] Applying decomposition
[2024-05-21 10:10:35] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6737676831850755199.txt' '-o' '/tmp/graph6737676831850755199.bin' '-w' '/tmp/graph6737676831850755199.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6737676831850755199.bin' '-l' '-1' '-v' '-w' '/tmp/graph6737676831850755199.weights' '-q' '0' '-e' '0.001'
[2024-05-21 10:10:35] [INFO ] Decomposing Gal with order
[2024-05-21 10:10:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 10:10:35] [INFO ] Flatten gal took : 74 ms
[2024-05-21 10:10:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2024-05-21 10:10:35] [INFO ] Time to serialize gal into /tmp/LTL11374256676214616469.gal : 13 ms
[2024-05-21 10:10:35] [INFO ] Time to serialize properties into /tmp/LTL14193496582873764037.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/LTL11374256676214616469.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14193496582873764037.ltl' '-c' '-stutter-deadlock'

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...256
Read 1 LTL properties
Checking formula 0 : !(((F("((i12.i1.u42.Section_11>=1)&&(i6.u60.F12>=1))"))||(X(G((F("((i12.i1.u42.Section_11>=1)&&(i6.u60.F12>=1))"))U("((i15.i0.u12.F110...196
Formula 0 simplified : G!"((i12.i1.u42.Section_11>=1)&&(i6.u60.F12>=1))" & XF(G!"((i12.i1.u42.Section_11>=1)&&(i6.u60.F12>=1))" R !"((i15.i0.u12.F110>=1)&&...185
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-192-LTLFireability-06 finished in 172786 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(F(p0)))&&X(F(G((X(p0) U p1))))))'
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Applied a total of 0 rules in 9 ms. Remains 327 /327 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 327 cols
[2024-05-21 10:10:50] [INFO ] Computed 136 invariants in 5 ms
[2024-05-21 10:10:51] [INFO ] Implicit Places using invariants in 226 ms returned [6, 63, 91, 171, 289, 302, 312]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 227 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 320/327 places, 192/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 240 ms. Remains : 320/327 places, 192/192 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-08
Product exploration explored 100000 steps with 153 reset in 669 ms.
Product exploration explored 100000 steps with 175 reset in 726 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 317 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
RANDOM walk for 327 steps (0 resets) in 11 ms. (27 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 283 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 4 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 192/192 transitions.
Applied a total of 0 rules in 8 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 320 cols
[2024-05-21 10:10:54] [INFO ] Computed 129 invariants in 2 ms
[2024-05-21 10:10:54] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-21 10:10:54] [INFO ] Invariant cache hit.
[2024-05-21 10:10:54] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-05-21 10:10:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 127/319 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/320 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 192/512 variables, 320/449 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 449 constraints, problems are : Problem set: 0 solved, 128 unsolved in 5544 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 127/319 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/320 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 192/512 variables, 320/449 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 128/577 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/512 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 577 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 35569ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 35570ms
Finished structural reductions in LTL mode , in 1 iterations and 35960 ms. Remains : 320/320 places, 192/192 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 256 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
RANDOM walk for 418 steps (0 resets) in 8 ms. (46 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 315 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 166 reset in 652 ms.
Product exploration explored 100000 steps with 167 reset in 704 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 4 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 192/192 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 320 transition count 192
Deduced a syphon composed of 64 places in 0 ms
Applied a total of 64 rules in 20 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-21 10:11:32] [INFO ] Redundant transitions in 5 ms returned []
Running 128 sub problems to find dead transitions.
// Phase 1: matrix 192 rows 320 cols
[2024-05-21 10:11:32] [INFO ] Computed 129 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 127/319 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-21 10:11:33] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 2 ms to minimize.
[2024-05-21 10:11:33] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-21 10:11:33] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-21 10:11:33] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-21 10:11:33] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-21 10:11:33] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-21 10:11:33] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-05-21 10:11:33] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-05-21 10:11:34] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 0 ms to minimize.
[2024-05-21 10:11:34] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-05-21 10:11:34] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 0 ms to minimize.
[2024-05-21 10:11:34] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-21 10:11:34] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-21 10:11:34] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-21 10:11:34] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-21 10:11:34] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-21 10:11:34] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-21 10:11:34] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-21 10:11:34] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-21 10:11:34] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD123 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 20/148 constraints. Problems are: Problem set: 19 solved, 109 unsolved
[2024-05-21 10:11:34] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-21 10:11:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-21 10:11:35] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-21 10:11:35] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-05-21 10:11:35] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD52 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 5/153 constraints. Problems are: Problem set: 24 solved, 104 unsolved
[2024-05-21 10:11:35] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-21 10:11:35] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-21 10:11:35] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-21 10:11:35] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-21 10:11:35] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-21 10:11:35] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-21 10:11:35] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-21 10:11:35] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-21 10:11:35] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-05-21 10:11:35] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-05-21 10:11:35] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-21 10:11:36] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 0 ms to minimize.
[2024-05-21 10:11:36] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-21 10:11:36] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-05-21 10:11:36] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-21 10:11:36] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-21 10:11:36] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-21 10:11:36] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-21 10:11:36] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-21 10:11:36] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD121 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 20/173 constraints. Problems are: Problem set: 44 solved, 84 unsolved
[2024-05-21 10:11:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-21 10:11:36] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-21 10:11:36] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-21 10:11:36] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-05-21 10:11:36] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-05-21 10:11:36] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-21 10:11:36] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-21 10:11:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-21 10:11:37] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-21 10:11:37] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-21 10:11:37] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-21 10:11:37] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD108 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD100 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 12/185 constraints. Problems are: Problem set: 56 solved, 72 unsolved
[2024-05-21 10:11:37] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-21 10:11:37] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-21 10:11:37] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-21 10:11:37] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-21 10:11:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD83 is UNSAT
[2024-05-21 10:11:38] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD86 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 6/191 constraints. Problems are: Problem set: 62 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/191 constraints. Problems are: Problem set: 62 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 1/320 variables, 1/192 constraints. Problems are: Problem set: 62 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/192 constraints. Problems are: Problem set: 62 solved, 66 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD29 is UNSAT
At refinement iteration 11 (OVERLAPS) 192/512 variables, 320/512 constraints. Problems are: Problem set: 64 solved, 64 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/512 variables, 0/512 constraints. Problems are: Problem set: 64 solved, 64 unsolved
At refinement iteration 13 (OVERLAPS) 0/512 variables, 0/512 constraints. Problems are: Problem set: 64 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 512 constraints, problems are : Problem set: 64 solved, 64 unsolved in 7741 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 64 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 64 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 191/319 variables, 127/127 constraints. Problems are: Problem set: 64 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 1/128 constraints. Problems are: Problem set: 64 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 63/191 constraints. Problems are: Problem set: 64 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 0/191 constraints. Problems are: Problem set: 64 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 1/320 variables, 1/192 constraints. Problems are: Problem set: 64 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/192 constraints. Problems are: Problem set: 64 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 192/512 variables, 320/512 constraints. Problems are: Problem set: 64 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 64/576 constraints. Problems are: Problem set: 64 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 0/576 constraints. Problems are: Problem set: 64 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/512 variables, 0/576 constraints. Problems are: Problem set: 64 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 576 constraints, problems are : Problem set: 64 solved, 64 unsolved in 9372 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 64/128 constraints, Known Traps: 63/63 constraints]
After SMT, in 17127ms problems are : Problem set: 64 solved, 64 unsolved
Search for dead transitions found 64 dead transitions in 17129ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 320/320 places, 128/192 transitions.
Graph (complete) has 512 edges and 320 vertex of which 256 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.3 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 256 /320 variables (removed 64) and now considering 128/128 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 256/320 places, 128/192 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17173 ms. Remains : 256/320 places, 128/192 transitions.
Built C files in :
/tmp/ltsmin17162446342050975392
[2024-05-21 10:11:49] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17162446342050975392
Running compilation step : cd /tmp/ltsmin17162446342050975392;'/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 391 ms.
Running link step : cd /tmp/ltsmin17162446342050975392;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin17162446342050975392;'/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/stateBased15563873225032604230.hoa' '--buchi-type=spotba'
LTSmin run took 2877 ms.
FORMULA CircularTrains-PT-192-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-192-LTLFireability-08 finished in 62334 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 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 327 /327 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 327 cols
[2024-05-21 10:11:53] [INFO ] Computed 136 invariants in 3 ms
[2024-05-21 10:11:53] [INFO ] Implicit Places using invariants in 176 ms returned [6, 63, 91, 171, 289, 302, 312]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 177 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 320/327 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 186 ms. Remains : 320/327 places, 192/192 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 578 ms.
Product exploration explored 100000 steps with 50000 reset in 629 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 24 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-192-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-192-LTLFireability-09 finished in 1514 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(G(p0))&&F(p1))))'
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 327 transition count 143
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 278 transition count 143
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 98 place count 278 transition count 136
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 112 place count 271 transition count 136
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 124 place count 265 transition count 130
Applied a total of 124 rules in 19 ms. Remains 265 /327 variables (removed 62) and now considering 130/192 (removed 62) transitions.
// Phase 1: matrix 130 rows 265 cols
[2024-05-21 10:11:54] [INFO ] Computed 136 invariants in 2 ms
[2024-05-21 10:11:54] [INFO ] Implicit Places using invariants in 176 ms returned [55, 77, 140, 231, 243, 252]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 177 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 259/327 places, 130/192 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 258 transition count 129
Applied a total of 2 rules in 10 ms. Remains 258 /259 variables (removed 1) and now considering 129/130 (removed 1) transitions.
// Phase 1: matrix 129 rows 258 cols
[2024-05-21 10:11:54] [INFO ] Computed 130 invariants in 1 ms
[2024-05-21 10:11:55] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-21 10:11:55] [INFO ] Invariant cache hit.
[2024-05-21 10:11:55] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 258/327 places, 129/192 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 556 ms. Remains : 258/327 places, 129/192 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-10
Product exploration explored 100000 steps with 1 reset in 634 ms.
Product exploration explored 100000 steps with 1 reset in 822 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))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 202 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 249 steps (0 resets) in 10 ms. (22 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 261 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-21 10:11:57] [INFO ] Invariant cache hit.
[2024-05-21 10:11:57] [INFO ] [Real]Absence check using 127 positive place invariants in 23 ms returned sat
[2024-05-21 10:11:57] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 9 ms returned sat
[2024-05-21 10:11:58] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2024-05-21 10:11:58] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-21 10:11:58] [INFO ] Added : 63 causal constraints over 13 iterations in 312 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-21 10:11:58] [INFO ] Invariant cache hit.
[2024-05-21 10:11:58] [INFO ] [Real]Absence check using 127 positive place invariants in 22 ms returned sat
[2024-05-21 10:11:58] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 7 ms returned sat
[2024-05-21 10:11:58] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2024-05-21 10:11:58] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-21 10:11:59] [INFO ] Added : 62 causal constraints over 13 iterations in 302 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-05-21 10:11:59] [INFO ] Invariant cache hit.
[2024-05-21 10:11:59] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-21 10:11:59] [INFO ] Invariant cache hit.
[2024-05-21 10:11:59] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2024-05-21 10:11:59] [INFO ] Redundant transitions in 1 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-21 10:11:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 127/257 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 1/258 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 388 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2298 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 127/257 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 1/258 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 65/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 453 constraints, problems are : Problem set: 0 solved, 65 unsolved in 13758 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 16063ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 16064ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16492 ms. Remains : 258/258 places, 129/129 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 243 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 403 steps (0 resets) in 9 ms. (40 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 246 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-21 10:12:16] [INFO ] Invariant cache hit.
[2024-05-21 10:12:16] [INFO ] [Real]Absence check using 127 positive place invariants in 23 ms returned sat
[2024-05-21 10:12:16] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 8 ms returned sat
[2024-05-21 10:12:16] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2024-05-21 10:12:16] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-21 10:12:17] [INFO ] Added : 63 causal constraints over 13 iterations in 337 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-21 10:12:17] [INFO ] Invariant cache hit.
[2024-05-21 10:12:17] [INFO ] [Real]Absence check using 127 positive place invariants in 22 ms returned sat
[2024-05-21 10:12:17] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 7 ms returned sat
[2024-05-21 10:12:17] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2024-05-21 10:12:17] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-21 10:12:17] [INFO ] Added : 62 causal constraints over 13 iterations in 286 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 603 ms.
Product exploration explored 100000 steps with 4 reset in 715 ms.
Built C files in :
/tmp/ltsmin16816862420565133805
[2024-05-21 10:12:19] [INFO ] Computing symmetric may disable matrix : 129 transitions.
[2024-05-21 10:12:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:12:19] [INFO ] Computing symmetric may enable matrix : 129 transitions.
[2024-05-21 10:12:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:12:19] [INFO ] Computing Do-Not-Accords matrix : 129 transitions.
[2024-05-21 10:12:19] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:12:19] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16816862420565133805
Running compilation step : cd /tmp/ltsmin16816862420565133805;'/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 311 ms.
Running link step : cd /tmp/ltsmin16816862420565133805;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin16816862420565133805;'/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/stateBased8269754146572235877.hoa' '--buchi-type=spotba'
LTSmin run took 2034 ms.
FORMULA CircularTrains-PT-192-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-192-LTLFireability-10 finished in 26976 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))'
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 327 transition count 143
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 278 transition count 143
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 98 place count 278 transition count 135
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 114 place count 270 transition count 135
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 126 place count 264 transition count 129
Applied a total of 126 rules in 13 ms. Remains 264 /327 variables (removed 63) and now considering 129/192 (removed 63) transitions.
// Phase 1: matrix 129 rows 264 cols
[2024-05-21 10:12:21] [INFO ] Computed 136 invariants in 1 ms
[2024-05-21 10:12:21] [INFO ] Implicit Places using invariants in 147 ms returned [5, 55, 76, 139, 230, 251]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 148 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/327 places, 129/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 166 ms. Remains : 258/327 places, 129/192 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-11
Product exploration explored 100000 steps with 1457 reset in 811 ms.
Product exploration explored 100000 steps with 1468 reset in 872 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), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 237 steps (0 resets) in 10 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
// Phase 1: matrix 129 rows 258 cols
[2024-05-21 10:12:24] [INFO ] Computed 130 invariants in 3 ms
[2024-05-21 10:12:24] [INFO ] [Real]Absence check using 127 positive place invariants in 23 ms returned sat
[2024-05-21 10:12:24] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 7 ms returned sat
[2024-05-21 10:12:24] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2024-05-21 10:12:24] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-21 10:12:24] [INFO ] Added : 63 causal constraints over 13 iterations in 353 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-05-21 10:12:24] [INFO ] Invariant cache hit.
[2024-05-21 10:12:24] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-21 10:12:24] [INFO ] Invariant cache hit.
[2024-05-21 10:12:25] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-05-21 10:12:25] [INFO ] Redundant transitions in 1 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-21 10:12:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 126/256 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 2/258 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 388 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2279 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 126/256 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 2/258 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 65/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 453 constraints, problems are : Problem set: 0 solved, 65 unsolved in 12412 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 14697ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 14697ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15029 ms. Remains : 258/258 places, 129/129 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 139 steps (0 resets) in 9 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-05-21 10:12:40] [INFO ] Invariant cache hit.
[2024-05-21 10:12:40] [INFO ] [Real]Absence check using 127 positive place invariants in 24 ms returned sat
[2024-05-21 10:12:40] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 8 ms returned sat
[2024-05-21 10:12:40] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2024-05-21 10:12:40] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-21 10:12:40] [INFO ] Added : 63 causal constraints over 13 iterations in 366 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1454 reset in 820 ms.
Product exploration explored 100000 steps with 1487 reset in 888 ms.
Built C files in :
/tmp/ltsmin6075838164989633142
[2024-05-21 10:12:42] [INFO ] Computing symmetric may disable matrix : 129 transitions.
[2024-05-21 10:12:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:12:42] [INFO ] Computing symmetric may enable matrix : 129 transitions.
[2024-05-21 10:12:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:12:42] [INFO ] Computing Do-Not-Accords matrix : 129 transitions.
[2024-05-21 10:12:42] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:12:42] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6075838164989633142
Running compilation step : cd /tmp/ltsmin6075838164989633142;'/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 338 ms.
Running link step : cd /tmp/ltsmin6075838164989633142;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin6075838164989633142;'/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/stateBased13345616207361327077.hoa' '--buchi-type=spotba'
LTSmin run took 1674 ms.
FORMULA CircularTrains-PT-192-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-192-LTLFireability-11 finished in 22966 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))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 327 transition count 141
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 276 transition count 141
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 102 place count 276 transition count 136
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 112 place count 271 transition count 136
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 124 place count 265 transition count 130
Applied a total of 124 rules in 16 ms. Remains 265 /327 variables (removed 62) and now considering 130/192 (removed 62) transitions.
// Phase 1: matrix 130 rows 265 cols
[2024-05-21 10:12:44] [INFO ] Computed 136 invariants in 1 ms
[2024-05-21 10:12:44] [INFO ] Implicit Places using invariants in 189 ms returned [5, 55, 76, 139, 243, 252]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 190 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 259/327 places, 130/192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 259 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 258 transition count 129
Applied a total of 2 rules in 6 ms. Remains 258 /259 variables (removed 1) and now considering 129/130 (removed 1) transitions.
// Phase 1: matrix 129 rows 258 cols
[2024-05-21 10:12:44] [INFO ] Computed 130 invariants in 2 ms
[2024-05-21 10:12:45] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-21 10:12:45] [INFO ] Invariant cache hit.
[2024-05-21 10:12:45] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 258/327 places, 129/192 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 589 ms. Remains : 258/327 places, 129/192 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-13
Product exploration explored 100000 steps with 2131 reset in 813 ms.
Product exploration explored 100000 steps with 2130 reset in 881 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 156 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 240 steps (0 resets) in 7 ms. (30 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 172 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-05-21 10:12:47] [INFO ] Invariant cache hit.
[2024-05-21 10:12:47] [INFO ] [Real]Absence check using 126 positive place invariants in 24 ms returned sat
[2024-05-21 10:12:47] [INFO ] [Real]Absence check using 126 positive and 4 generalized place invariants in 10 ms returned sat
[2024-05-21 10:12:47] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2024-05-21 10:12:47] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-21 10:12:48] [INFO ] Added : 62 causal constraints over 13 iterations in 298 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-05-21 10:12:48] [INFO ] Invariant cache hit.
[2024-05-21 10:12:48] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-21 10:12:48] [INFO ] Invariant cache hit.
[2024-05-21 10:12:48] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2024-05-21 10:12:48] [INFO ] Redundant transitions in 1 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-21 10:12:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 126/256 variables, 126/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 2/258 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 388 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2612 ms.
Refiners :[Positive P Invariants (semi-flows): 126/126 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 126/256 variables, 126/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 2/258 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 65/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 453 constraints, problems are : Problem set: 0 solved, 65 unsolved in 13216 ms.
Refiners :[Positive P Invariants (semi-flows): 126/126 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 15835ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 15836ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16177 ms. Remains : 258/258 places, 129/129 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 189 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
RANDOM walk for 258 steps (0 resets) in 10 ms. (23 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 169 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-05-21 10:13:04] [INFO ] Invariant cache hit.
[2024-05-21 10:13:04] [INFO ] [Real]Absence check using 126 positive place invariants in 23 ms returned sat
[2024-05-21 10:13:04] [INFO ] [Real]Absence check using 126 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 10:13:05] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2024-05-21 10:13:05] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-21 10:13:05] [INFO ] Added : 62 causal constraints over 13 iterations in 280 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2079 reset in 796 ms.
Product exploration explored 100000 steps with 2151 reset in 873 ms.
Built C files in :
/tmp/ltsmin17623771124270661361
[2024-05-21 10:13:07] [INFO ] Computing symmetric may disable matrix : 129 transitions.
[2024-05-21 10:13:07] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:13:07] [INFO ] Computing symmetric may enable matrix : 129 transitions.
[2024-05-21 10:13:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:13:07] [INFO ] Computing Do-Not-Accords matrix : 129 transitions.
[2024-05-21 10:13:07] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:13:07] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17623771124270661361
Running compilation step : cd /tmp/ltsmin17623771124270661361;'/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 334 ms.
Running link step : cd /tmp/ltsmin17623771124270661361;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17623771124270661361;'/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/stateBased6334689701004670196.hoa' '--buchi-type=spotba'
LTSmin run took 404 ms.
FORMULA CircularTrains-PT-192-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-192-LTLFireability-13 finished in 23217 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||G(p1))) U X(!p1)))'
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 327 /327 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 327 cols
[2024-05-21 10:13:07] [INFO ] Computed 136 invariants in 4 ms
[2024-05-21 10:13:08] [INFO ] Implicit Places using invariants in 161 ms returned [6, 63, 91, 171, 289, 302]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 161 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 321/327 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 170 ms. Remains : 321/327 places, 192/192 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) p1), (NOT p1), (AND (NOT p1) (NOT p0)), p1, p1, true, p1]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-14
Entered a terminal (fully accepting) state of product in 218 steps with 83 reset in 3 ms.
FORMULA CircularTrains-PT-192-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLFireability-14 finished in 449 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((p0||G((G(p1)||X(p2))))))'
Support contains 6 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Applied a total of 0 rules in 7 ms. Remains 327 /327 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-21 10:13:08] [INFO ] Invariant cache hit.
[2024-05-21 10:13:08] [INFO ] Implicit Places using invariants in 161 ms returned [6, 91, 289, 302, 312]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 162 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 322/327 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 322 /322 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 172 ms. Remains : 322/327 places, 192/192 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-15
Entered a terminal (fully accepting) state of product in 101 steps with 0 reset in 2 ms.
FORMULA CircularTrains-PT-192-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLFireability-15 finished in 397 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(G((F(p0) U p1)))))'
Found a Lengthening insensitive property : CircularTrains-PT-192-LTLFireability-06
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 327/327 places, 192/192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 327 transition count 143
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 278 transition count 143
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 98 place count 278 transition count 136
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 112 place count 271 transition count 136
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 124 place count 265 transition count 130
Applied a total of 124 rules in 16 ms. Remains 265 /327 variables (removed 62) and now considering 130/192 (removed 62) transitions.
// Phase 1: matrix 130 rows 265 cols
[2024-05-21 10:13:09] [INFO ] Computed 136 invariants in 3 ms
[2024-05-21 10:13:09] [INFO ] Implicit Places using invariants in 157 ms returned [5, 55, 140, 231, 243, 252]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 158 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 259/327 places, 130/192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 259 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 258 transition count 129
Applied a total of 2 rules in 5 ms. Remains 258 /259 variables (removed 1) and now considering 129/130 (removed 1) transitions.
// Phase 1: matrix 129 rows 258 cols
[2024-05-21 10:13:09] [INFO ] Computed 130 invariants in 1 ms
[2024-05-21 10:13:09] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-21 10:13:09] [INFO ] Invariant cache hit.
[2024-05-21 10:13:09] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 258/327 places, 129/192 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 500 ms. Remains : 258/327 places, 129/192 transitions.
Running random walk in product with property : CircularTrains-PT-192-LTLFireability-06
Product exploration explored 100000 steps with 1398 reset in 796 ms.
Product exploration explored 100000 steps with 1467 reset in 857 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))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) 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 (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 409 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 278 steps (0 resets) in 10 ms. (25 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) 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 (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 504 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-21 10:13:12] [INFO ] Invariant cache hit.
[2024-05-21 10:13:12] [INFO ] [Real]Absence check using 127 positive place invariants in 24 ms returned sat
[2024-05-21 10:13:12] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-21 10:13:12] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2024-05-21 10:13:12] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-21 10:13:13] [INFO ] Added : 63 causal constraints over 13 iterations in 390 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-05-21 10:13:13] [INFO ] Invariant cache hit.
[2024-05-21 10:13:13] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-21 10:13:13] [INFO ] Invariant cache hit.
[2024-05-21 10:13:13] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-21 10:13:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 127/257 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 1/258 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 388 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2351 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 127/257 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 1/258 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 65/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 453 constraints, problems are : Problem set: 0 solved, 65 unsolved in 13854 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 16211ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 16212ms
Finished structural reductions in LTL mode , in 1 iterations and 16553 ms. Remains : 258/258 places, 129/129 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) 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 (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 346 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 417 steps (0 resets) in 21 ms. (18 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) 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 (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 457 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-21 10:13:30] [INFO ] Invariant cache hit.
[2024-05-21 10:13:31] [INFO ] [Real]Absence check using 127 positive place invariants in 23 ms returned sat
[2024-05-21 10:13:31] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-21 10:13:31] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2024-05-21 10:13:31] [INFO ] Computed and/alt/rep : 65/129/65 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-21 10:13:31] [INFO ] Added : 63 causal constraints over 13 iterations in 358 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1472 reset in 828 ms.
Product exploration explored 100000 steps with 1458 reset in 866 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-05-21 10:13:33] [INFO ] Redundant transitions in 1 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-21 10:13:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 127/257 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 1/258 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 388 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2273 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 127/257 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 1/258 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 65/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 453 constraints, problems are : Problem set: 0 solved, 65 unsolved in 13757 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 16058ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 16060ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16081 ms. Remains : 258/258 places, 129/129 transitions.
Built C files in :
/tmp/ltsmin11077804977619223129
[2024-05-21 10:13:49] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11077804977619223129
Running compilation step : cd /tmp/ltsmin11077804977619223129;'/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 291 ms.
Running link step : cd /tmp/ltsmin11077804977619223129;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin11077804977619223129;'/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/stateBased14728278118707919729.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 129/129 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-05-21 10:14:04] [INFO ] Invariant cache hit.
[2024-05-21 10:14:05] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-21 10:14:05] [INFO ] Invariant cache hit.
[2024-05-21 10:14:05] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-21 10:14:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 127/257 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 1/258 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/387 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 388 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2275 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 127/257 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 1/258 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 129/387 variables, 258/388 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 65/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 453 constraints, problems are : Problem set: 0 solved, 65 unsolved in 13836 ms.
Refiners :[Positive P Invariants (semi-flows): 127/127 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 16134ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 16135ms
Finished structural reductions in LTL mode , in 1 iterations and 16494 ms. Remains : 258/258 places, 129/129 transitions.
Built C files in :
/tmp/ltsmin1638649178122695979
[2024-05-21 10:14:21] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1638649178122695979
Running compilation step : cd /tmp/ltsmin1638649178122695979;'/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 311 ms.
Running link step : cd /tmp/ltsmin1638649178122695979;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1638649178122695979;'/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/stateBased15745627424010257103.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 10:14:36] [INFO ] Flatten gal took : 8 ms
[2024-05-21 10:14:36] [INFO ] Flatten gal took : 8 ms
[2024-05-21 10:14:36] [INFO ] Time to serialize gal into /tmp/LTL17931688437057005556.gal : 2 ms
[2024-05-21 10:14:36] [INFO ] Time to serialize properties into /tmp/LTL5143932181910220379.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/LTL17931688437057005556.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14588475971905267972.hoa' '-atoms' '/tmp/LTL5143932181910220379.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...319
Loading property file /tmp/LTL5143932181910220379.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14588475971905267972.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 10:14:51] [INFO ] Flatten gal took : 7 ms
[2024-05-21 10:14:51] [INFO ] Flatten gal took : 8 ms
[2024-05-21 10:14:51] [INFO ] Time to serialize gal into /tmp/LTL2436847778624484987.gal : 4 ms
[2024-05-21 10:14:51] [INFO ] Time to serialize properties into /tmp/LTL2691325000428695687.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/LTL2436847778624484987.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2691325000428695687.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 : !(((F("((Section_11>=1)&&(F12>=1))"))||(X(G((F("((Section_11>=1)&&(F12>=1))"))U("((F110>=1)&&(Section_109>=1))"))))))
Formula 0 simplified : G!"((Section_11>=1)&&(F12>=1))" & XF(G!"((Section_11>=1)&&(F12>=1))" R !"((F110>=1)&&(Section_109>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 10:15:06] [INFO ] Flatten gal took : 7 ms
[2024-05-21 10:15:06] [INFO ] Applying decomposition
[2024-05-21 10:15:06] [INFO ] Flatten gal took : 7 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/graph1656384768917000348.txt' '-o' '/tmp/graph1656384768917000348.bin' '-w' '/tmp/graph1656384768917000348.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1656384768917000348.bin' '-l' '-1' '-v' '-w' '/tmp/graph1656384768917000348.weights' '-q' '0' '-e' '0.001'
[2024-05-21 10:15:06] [INFO ] Decomposing Gal with order
[2024-05-21 10:15:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 10:15:06] [INFO ] Flatten gal took : 13 ms
[2024-05-21 10:15:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-21 10:15:06] [INFO ] Time to serialize gal into /tmp/LTL5287906793526147222.gal : 4 ms
[2024-05-21 10:15:06] [INFO ] Time to serialize properties into /tmp/LTL3021268243403854436.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/LTL5287906793526147222.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3021268243403854436.ltl' '-c' '-stutter-deadlock'

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...254
Read 1 LTL properties
Checking formula 0 : !(((F("((i7.i0.i0.u90.Section_11>=1)&&(i7.i0.i1.u66.F12>=1))"))||(X(G((F("((i7.i0.i0.u90.Section_11>=1)&&(i7.i0.i1.u66.F12>=1))"))U("(...218
Formula 0 simplified : G!"((i7.i0.i0.u90.Section_11>=1)&&(i7.i0.i1.u66.F12>=1))" & XF(G!"((i7.i0.i0.u90.Section_11>=1)&&(i7.i0.i1.u66.F12>=1))" R !"((i12.i...207
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-192-LTLFireability-06 finished in 132981 ms.
[2024-05-21 10:15:21] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
[2024-05-21 10:15:21] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin5076633325793059157
[2024-05-21 10:15:21] [INFO ] Flatten gal took : 8 ms
[2024-05-21 10:15:21] [INFO ] Computing symmetric may disable matrix : 192 transitions.
[2024-05-21 10:15:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:15:21] [INFO ] Computing symmetric may enable matrix : 192 transitions.
[2024-05-21 10:15:21] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:15:21] [INFO ] Computing Do-Not-Accords matrix : 192 transitions.
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/graph8659429810280325133.txt' '-o' '/tmp/graph8659429810280325133.bin' '-w' '/tmp/graph8659429810280325133.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8659429810280325133.bin' '-l' '-1' '-v' '-w' '/tmp/graph8659429810280325133.weights' '-q' '0' '-e' '0.001'
[2024-05-21 10:15:21] [INFO ] Decomposing Gal with order
[2024-05-21 10:15:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 10:15:21] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:15:21] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5076633325793059157
Running compilation step : cd /tmp/ltsmin5076633325793059157;'/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 10:15:21] [INFO ] Flatten gal took : 19 ms
[2024-05-21 10:15:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-21 10:15:21] [INFO ] Time to serialize gal into /tmp/LTLFireability11261959333035865990.gal : 11 ms
[2024-05-21 10:15:21] [INFO ] Time to serialize properties into /tmp/LTLFireability8084461014517237039.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/LTLFireability11261959333035865990.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8084461014517237039.ltl' '-c' '-stutter-deadlock'

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 : !(((F("((i14.i1.u47.Section_11>=1)&&(i19.i0.u62.F12>=1))"))||(X(G((F("((i14.i1.u47.Section_11>=1)&&(i19.i0.u62.F12>=1))"))U("((i15.i0....204
Formula 0 simplified : G!"((i14.i1.u47.Section_11>=1)&&(i19.i0.u62.F12>=1))" & XF(G!"((i14.i1.u47.Section_11>=1)&&(i19.i0.u62.F12>=1))" R !"((i15.i0.u40.F1...193
Compilation finished in 468 ms.
Running link step : cd /tmp/ltsmin5076633325793059157;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5076633325793059157;'/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( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: 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( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: LTL layer: formula: (<>((LTLAPp0==true))||X([]((<>((LTLAPp0==true)) U (LTLAPp1==true)))))
pins2lts-mc-linux64( 1/ 8), 0.006: "(<>((LTLAPp0==true))||X([]((<>((LTLAPp0==true)) U (LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.006: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.036: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.121: DFS-FIFO for weak LTL, using special progress label 195
pins2lts-mc-linux64( 0/ 8), 0.121: There are 196 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.121: State length is 328, there are 196 groups
pins2lts-mc-linux64( 0/ 8), 0.121: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.121: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.121: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.121: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.717: ~117 levels ~960 states ~49256 transitions
pins2lts-mc-linux64( 1/ 8), 0.992: ~235 levels ~1920 states ~87384 transitions
pins2lts-mc-linux64( 1/ 8), 1.346: ~466 levels ~3840 states ~156160 transitions
pins2lts-mc-linux64( 1/ 8), 1.861: ~935 levels ~7680 states ~278832 transitions
pins2lts-mc-linux64( 1/ 8), 2.530: ~1859 levels ~15360 states ~481432 transitions
pins2lts-mc-linux64( 1/ 8), 3.096: ~3042 levels ~30720 states ~642816 transitions
pins2lts-mc-linux64( 1/ 8), 3.277: ~3042 levels ~61440 states ~713184 transitions
pins2lts-mc-linux64( 1/ 8), 3.736: ~3042 levels ~122880 states ~862632 transitions
pins2lts-mc-linux64( 1/ 8), 4.540: ~3042 levels ~245760 states ~1195992 transitions
pins2lts-mc-linux64( 1/ 8), 6.181: ~3042 levels ~491520 states ~1879312 transitions
pins2lts-mc-linux64( 6/ 8), 9.279: ~3042 levels ~983040 states ~3357552 transitions
pins2lts-mc-linux64( 6/ 8), 14.995: ~3042 levels ~1966080 states ~6304312 transitions
pins2lts-mc-linux64( 1/ 8), 25.747: ~3042 levels ~3932160 states ~12495864 transitions
pins2lts-mc-linux64( 1/ 8), 46.441: ~3042 levels ~7864320 states ~25631200 transitions
pins2lts-mc-linux64( 1/ 8), 88.681: ~3042 levels ~15728640 states ~52751296 transitions
pins2lts-mc-linux64( 1/ 8), 201.314: ~3042 levels ~31457280 states ~109904168 transitions
pins2lts-mc-linux64( 6/ 8), 429.717: ~3042 levels ~62914560 states ~226322864 transitions
pins2lts-mc-linux64( 6/ 8), 868.703: ~3042 levels ~125829120 states ~472209568 transitions
pins2lts-mc-linux64( 1/ 8), 1258.948: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1258.965:
pins2lts-mc-linux64( 0/ 8), 1258.965: mean standard work distribution: 173.2% (states) 173.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 1258.965:
pins2lts-mc-linux64( 0/ 8), 1258.965: Explored 45733200 states 175351840 transitions, fanout: 3.834
pins2lts-mc-linux64( 0/ 8), 1258.965: Total exploration time 1258.840 sec (1258.800 sec minimum, 1258.820 sec on average)
pins2lts-mc-linux64( 0/ 8), 1258.965: States per second: 36330, Transitions per second: 139296
pins2lts-mc-linux64( 0/ 8), 1258.965:
pins2lts-mc-linux64( 0/ 8), 1258.965: Progress states detected: 1
pins2lts-mc-linux64( 0/ 8), 1258.965: Redundant explorations: -0.3325
pins2lts-mc-linux64( 0/ 8), 1258.965:
pins2lts-mc-linux64( 0/ 8), 1258.965: Queue width: 8B, total height: 6224, memory: 0.05MB
pins2lts-mc-linux64( 0/ 8), 1258.965: Tree memory: 606.1MB, 13.9 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 1258.965: Tree fill ratio (roots/leafs): 34.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1258.965: Stored 199 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1258.965: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1258.965: Est. total memory use: 606.1MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5076633325793059157;'/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/ltsmin5076633325793059157;'/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 10:37:56] [INFO ] Flatten gal took : 18 ms
[2024-05-21 10:37:56] [INFO ] Time to serialize gal into /tmp/LTLFireability6910043497584728832.gal : 2 ms
[2024-05-21 10:37:56] [INFO ] Time to serialize properties into /tmp/LTLFireability13005283161005985152.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/LTLFireability6910043497584728832.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13005283161005985152.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...298
Read 1 LTL properties
Checking formula 0 : !(((F("((Section_11>=1)&&(F12>=1))"))||(X(G((F("((Section_11>=1)&&(F12>=1))"))U("((F110>=1)&&(Section_109>=1))"))))))
Formula 0 simplified : G!"((Section_11>=1)&&(F12>=1))" & XF(G!"((Section_11>=1)&&(F12>=1))" R !"((F110>=1)&&(Section_109>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-21 11:00:30] [INFO ] Flatten gal took : 18 ms
[2024-05-21 11:00:30] [INFO ] Input system was already deterministic with 192 transitions.
[2024-05-21 11:00:30] [INFO ] Transformed 327 places.
[2024-05-21 11:00:30] [INFO ] Transformed 192 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 11:00:30] [INFO ] Time to serialize gal into /tmp/LTLFireability17548270608051045136.gal : 3 ms
[2024-05-21 11:00:30] [INFO ] Time to serialize properties into /tmp/LTLFireability14587902498196683646.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/LTLFireability17548270608051045136.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14587902498196683646.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...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F("((Section_11>=1)&&(F12>=1))"))||(X(G((F("((Section_11>=1)&&(F12>=1))"))U("((F110>=1)&&(Section_109>=1))"))))))
Formula 0 simplified : G!"((Section_11>=1)&&(F12>=1))" & XF(G!"((Section_11>=1)&&(F12>=1))" R !"((F110>=1)&&(Section_109>=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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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 LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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