Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r485-tall-167912700401163.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is UtilityControlRoom-PT-Z4T3N06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912700401163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 45K Feb 26 14:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 241K Feb 26 14:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 49K Feb 26 14:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 213K Feb 26 14:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 22K Feb 25 17:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 17:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 34K Feb 25 17:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 102K Feb 25 17:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 75K Feb 26 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 376K Feb 26 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 97K Feb 26 14:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 376K Feb 26 14:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.9K Feb 25 17:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 191K Mar 5 18:23 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 UtilityControlRoom-PT-Z4T3N06-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679320549943

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z4T3N06
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-20 13:55:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-20 13:55:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 13:55:51] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-03-20 13:55:51] [INFO ] Transformed 228 places.
[2023-03-20 13:55:51] [INFO ] Transformed 450 transitions.
[2023-03-20 13:55:51] [INFO ] Parsed PT model containing 228 places and 450 transitions and 1446 arcs in 123 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 218 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Applied a total of 0 rules in 11 ms. Remains 228 /228 variables (removed 0) and now considering 354/354 (removed 0) transitions.
// Phase 1: matrix 354 rows 228 cols
[2023-03-20 13:55:51] [INFO ] Computed 15 place invariants in 19 ms
[2023-03-20 13:55:52] [INFO ] Implicit Places using invariants in 388 ms returned []
[2023-03-20 13:55:52] [INFO ] Invariant cache hit.
[2023-03-20 13:55:52] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2023-03-20 13:55:52] [INFO ] Invariant cache hit.
[2023-03-20 13:55:52] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 756 ms. Remains : 228/228 places, 354/354 transitions.
Support contains 218 out of 228 places after structural reductions.
[2023-03-20 13:55:52] [INFO ] Flatten gal took : 50 ms
[2023-03-20 13:55:52] [INFO ] Flatten gal took : 28 ms
[2023-03-20 13:55:52] [INFO ] Input system was already deterministic with 354 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 24) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 13:55:53] [INFO ] Invariant cache hit.
[2023-03-20 13:55:53] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-20 13:55:53] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 30 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 156 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 156 transition count 282
Applied a total of 144 rules in 16 ms. Remains 156 /228 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 156 cols
[2023-03-20 13:55:53] [INFO ] Computed 15 place invariants in 9 ms
[2023-03-20 13:55:53] [INFO ] Implicit Places using invariants in 118 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 120 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/228 places, 282/354 transitions.
Applied a total of 0 rules in 6 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 142 ms. Remains : 155/228 places, 282/354 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s113 s114 s115 s116 s117 s118) (ADD s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 3535 reset in 454 ms.
Product exploration explored 100000 steps with 3555 reset in 322 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 128 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 167 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 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0)]
// Phase 1: matrix 282 rows 155 cols
[2023-03-20 13:55:55] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-20 13:55:55] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-00 finished in 1955 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 126 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 24 Pre rules applied. Total rules applied 0 place count 228 transition count 330
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 204 transition count 330
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 0 with 12 rules applied. Total rules applied 60 place count 198 transition count 324
Applied a total of 60 rules in 51 ms. Remains 198 /228 variables (removed 30) and now considering 324/354 (removed 30) transitions.
// Phase 1: matrix 324 rows 198 cols
[2023-03-20 13:55:55] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-20 13:55:55] [INFO ] Implicit Places using invariants in 219 ms returned [155]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 223 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 197/228 places, 324/354 transitions.
Applied a total of 0 rules in 11 ms. Remains 197 /197 variables (removed 0) and now considering 324/324 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 285 ms. Remains : 197/228 places, 324/354 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ (ADD s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27) (ADD s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 701 ms.
Stack based approach found an accepted trace after 323 steps with 0 reset with depth 324 and stack size 324 in 9 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-01 finished in 1108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 24 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 228 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 132 transition count 234
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 219 place count 129 transition count 162
Iterating global reduction 2 with 3 rules applied. Total rules applied 222 place count 129 transition count 162
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 240 place count 111 transition count 144
Iterating global reduction 2 with 18 rules applied. Total rules applied 258 place count 111 transition count 144
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 283 place count 98 transition count 132
Applied a total of 283 rules in 23 ms. Remains 98 /228 variables (removed 130) and now considering 132/354 (removed 222) transitions.
// Phase 1: matrix 132 rows 98 cols
[2023-03-20 13:55:56] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-20 13:55:56] [INFO ] Implicit Places using invariants in 66 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/228 places, 132/354 transitions.
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 0 with 12 rules applied. Total rules applied 12 place count 91 transition count 126
Applied a total of 12 rules in 7 ms. Remains 91 /97 variables (removed 6) and now considering 126/132 (removed 6) transitions.
// Phase 1: matrix 126 rows 91 cols
[2023-03-20 13:55:56] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-20 13:55:56] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-20 13:55:56] [INFO ] Invariant cache hit.
[2023-03-20 13:55:56] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 91/228 places, 126/354 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 204 ms. Remains : 91/228 places, 126/354 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 8113 reset in 213 ms.
Product exploration explored 100000 steps with 8142 reset in 205 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 106 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 29 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 120 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 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2023-03-20 13:55:57] [INFO ] Invariant cache hit.
[2023-03-20 13:55:57] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-20 13:55:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:55:57] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-20 13:55:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:55:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-20 13:55:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:55:57] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-20 13:55:57] [INFO ] Computed and/alt/rep : 102/240/102 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-20 13:55:57] [INFO ] Added : 61 causal constraints over 13 iterations in 142 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 24 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 91 /91 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-20 13:55:57] [INFO ] Invariant cache hit.
[2023-03-20 13:55:58] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-20 13:55:58] [INFO ] Invariant cache hit.
[2023-03-20 13:55:58] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-20 13:55:58] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 13:55:58] [INFO ] Invariant cache hit.
[2023-03-20 13:55:58] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 91/91 places, 126/126 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 95 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)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 203 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 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2023-03-20 13:55:58] [INFO ] Invariant cache hit.
[2023-03-20 13:55:58] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-20 13:55:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:55:58] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-20 13:55:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:55:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-20 13:55:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:55:58] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-20 13:55:58] [INFO ] Computed and/alt/rep : 102/240/102 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-20 13:55:58] [INFO ] Added : 61 causal constraints over 13 iterations in 120 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8160 reset in 188 ms.
Product exploration explored 100000 steps with 8155 reset in 183 ms.
Built C files in :
/tmp/ltsmin5374550681487905670
[2023-03-20 13:55:59] [INFO ] Computing symmetric may disable matrix : 126 transitions.
[2023-03-20 13:55:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 13:55:59] [INFO ] Computing symmetric may enable matrix : 126 transitions.
[2023-03-20 13:55:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 13:55:59] [INFO ] Computing Do-Not-Accords matrix : 126 transitions.
[2023-03-20 13:55:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 13:55:59] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5374550681487905670
Running compilation step : cd /tmp/ltsmin5374550681487905670;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 327 ms.
Running link step : cd /tmp/ltsmin5374550681487905670;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin5374550681487905670;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16845355013609011994.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 24 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 91 /91 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-20 13:56:14] [INFO ] Invariant cache hit.
[2023-03-20 13:56:14] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-20 13:56:14] [INFO ] Invariant cache hit.
[2023-03-20 13:56:14] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-20 13:56:14] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 13:56:14] [INFO ] Invariant cache hit.
[2023-03-20 13:56:14] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 196 ms. Remains : 91/91 places, 126/126 transitions.
Built C files in :
/tmp/ltsmin143265997712013102
[2023-03-20 13:56:14] [INFO ] Computing symmetric may disable matrix : 126 transitions.
[2023-03-20 13:56:14] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 13:56:14] [INFO ] Computing symmetric may enable matrix : 126 transitions.
[2023-03-20 13:56:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 13:56:14] [INFO ] Computing Do-Not-Accords matrix : 126 transitions.
[2023-03-20 13:56:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 13:56:14] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin143265997712013102
Running compilation step : cd /tmp/ltsmin143265997712013102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 221 ms.
Running link step : cd /tmp/ltsmin143265997712013102;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin143265997712013102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4044369840395787001.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-20 13:56:29] [INFO ] Flatten gal took : 7 ms
[2023-03-20 13:56:29] [INFO ] Flatten gal took : 7 ms
[2023-03-20 13:56:29] [INFO ] Time to serialize gal into /tmp/LTL12917499669096311803.gal : 2 ms
[2023-03-20 13:56:29] [INFO ] Time to serialize properties into /tmp/LTL14501128645376679205.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12917499669096311803.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17832920958611167265.hoa' '-atoms' '/tmp/LTL14501128645376679205.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL14501128645376679205.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17832920958611167265.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
30 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.356275,26644,1,0,80,71952,20,17,2354,44461,163
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-02 finished in 33771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 7 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 228 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 132 transition count 234
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 216 place count 132 transition count 210
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 264 place count 108 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 267 place count 105 transition count 138
Iterating global reduction 2 with 3 rules applied. Total rules applied 270 place count 105 transition count 138
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 288 place count 87 transition count 120
Iterating global reduction 2 with 18 rules applied. Total rules applied 306 place count 87 transition count 120
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 324 place count 69 transition count 84
Iterating global reduction 2 with 18 rules applied. Total rules applied 342 place count 69 transition count 84
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 360 place count 51 transition count 66
Iterating global reduction 2 with 18 rules applied. Total rules applied 378 place count 51 transition count 66
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 396 place count 51 transition count 48
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 396 place count 51 transition count 42
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 408 place count 45 transition count 42
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 421 place count 38 transition count 36
Applied a total of 421 rules in 19 ms. Remains 38 /228 variables (removed 190) and now considering 36/354 (removed 318) transitions.
// Phase 1: matrix 36 rows 38 cols
[2023-03-20 13:56:30] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-20 13:56:30] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-20 13:56:30] [INFO ] Invariant cache hit.
[2023-03-20 13:56:30] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-20 13:56:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 13:56:30] [INFO ] Invariant cache hit.
[2023-03-20 13:56:30] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/228 places, 36/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 38/228 places, 36/354 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s19 (ADD s20 s21 s22 s23 s24 s25))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 18785 reset in 126 ms.
Product exploration explored 100000 steps with 18797 reset in 126 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 115 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 34 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
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 108 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 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2023-03-20 13:56:31] [INFO ] Invariant cache hit.
[2023-03-20 13:56:31] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-20 13:56:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:56:31] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-20 13:56:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:56:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-20 13:56:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:56:31] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-20 13:56:31] [INFO ] Computed and/alt/rep : 30/84/30 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-20 13:56:31] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 36/36 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 36/36 (removed 0) transitions.
[2023-03-20 13:56:31] [INFO ] Invariant cache hit.
[2023-03-20 13:56:31] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-20 13:56:31] [INFO ] Invariant cache hit.
[2023-03-20 13:56:31] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-20 13:56:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 13:56:31] [INFO ] Invariant cache hit.
[2023-03-20 13:56:31] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141 ms. Remains : 38/38 places, 36/36 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 138 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 41 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
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 122 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2023-03-20 13:56:31] [INFO ] Invariant cache hit.
[2023-03-20 13:56:31] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-20 13:56:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:56:31] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-20 13:56:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:56:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-20 13:56:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:56:31] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-20 13:56:31] [INFO ] Computed and/alt/rep : 30/84/30 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-20 13:56:31] [INFO ] Added : 3 causal constraints over 1 iterations in 8 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 18686 reset in 116 ms.
Product exploration explored 100000 steps with 18795 reset in 128 ms.
Built C files in :
/tmp/ltsmin2633113628071342910
[2023-03-20 13:56:32] [INFO ] Computing symmetric may disable matrix : 36 transitions.
[2023-03-20 13:56:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 13:56:32] [INFO ] Computing symmetric may enable matrix : 36 transitions.
[2023-03-20 13:56:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 13:56:32] [INFO ] Computing Do-Not-Accords matrix : 36 transitions.
[2023-03-20 13:56:32] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 13:56:32] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2633113628071342910
Running compilation step : cd /tmp/ltsmin2633113628071342910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 123 ms.
Running link step : cd /tmp/ltsmin2633113628071342910;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2633113628071342910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12635180582334928973.hoa' '--buchi-type=spotba'
LTSmin run took 61 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-03 finished in 2066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(X(F(p0)))||(p1 U (p2||G(p1)))))||((X(X(F(p0)))||(p1 U (p2||G(p1))))&&F(p3))))'
Support contains 172 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 228 /228 variables (removed 0) and now considering 354/354 (removed 0) transitions.
// Phase 1: matrix 354 rows 228 cols
[2023-03-20 13:56:32] [INFO ] Computed 15 place invariants in 5 ms
[2023-03-20 13:56:32] [INFO ] Implicit Places using invariants in 69 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 227/228 places, 354/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 227 /227 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 227/228 places, 354/354 transitions.
Stuttering acceptance computed with spot in 356 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(AND (GT (ADD s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177) (ADD s10 s11 s12...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13386 reset in 564 ms.
Product exploration explored 100000 steps with 13409 reset in 568 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p3) (NOT p0)), (X (AND (NOT p2) p1 (NOT p3))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT p3)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT p3))), (X (X (AND (NOT p2) p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 736 ms. Reduced automaton from 9 states, 15 edges and 4 AP (stutter sensitive) to 8 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 354 rows 227 cols
[2023-03-20 13:56:35] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-20 13:56:35] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-20 13:56:35] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p3) (NOT p0)), (X (AND (NOT p2) p1 (NOT p3))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT p3)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT p3))), (X (X (AND (NOT p2) p1 (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F p0), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F p3), (F (NOT (AND p1 (NOT p2) (NOT p3))))]
Knowledge based reduction with 13 factoid took 783 ms. Reduced automaton from 8 states, 12 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 168 out of 227 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 227 /227 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-20 13:56:36] [INFO ] Invariant cache hit.
[2023-03-20 13:56:36] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-20 13:56:36] [INFO ] Invariant cache hit.
[2023-03-20 13:56:36] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-20 13:56:36] [INFO ] Invariant cache hit.
[2023-03-20 13:56:36] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 325 ms. Remains : 227/227 places, 354/354 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 121 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=60 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 9243 reset in 502 ms.
Product exploration explored 100000 steps with 9208 reset in 505 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 168 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 227 transition count 354
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 30 rules in 16 ms. Remains 227 /227 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-20 13:56:39] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 354 rows 227 cols
[2023-03-20 13:56:39] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-20 13:56:39] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 227/227 places, 354/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 269 ms. Remains : 227/227 places, 354/354 transitions.
Built C files in :
/tmp/ltsmin13144338537802101084
[2023-03-20 13:56:39] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13144338537802101084
Running compilation step : cd /tmp/ltsmin13144338537802101084;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 544 ms.
Running link step : cd /tmp/ltsmin13144338537802101084;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13144338537802101084;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14737282893058474283.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 168 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Applied a total of 0 rules in 11 ms. Remains 227 /227 variables (removed 0) and now considering 354/354 (removed 0) transitions.
// Phase 1: matrix 354 rows 227 cols
[2023-03-20 13:56:54] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-20 13:56:54] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-20 13:56:54] [INFO ] Invariant cache hit.
[2023-03-20 13:56:54] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2023-03-20 13:56:54] [INFO ] Invariant cache hit.
[2023-03-20 13:56:54] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 354 ms. Remains : 227/227 places, 354/354 transitions.
Built C files in :
/tmp/ltsmin17083748742383037801
[2023-03-20 13:56:54] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17083748742383037801
Running compilation step : cd /tmp/ltsmin17083748742383037801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 531 ms.
Running link step : cd /tmp/ltsmin17083748742383037801;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17083748742383037801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15922145115774668330.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-20 13:57:09] [INFO ] Flatten gal took : 20 ms
[2023-03-20 13:57:10] [INFO ] Flatten gal took : 25 ms
[2023-03-20 13:57:10] [INFO ] Time to serialize gal into /tmp/LTL6055077168863413100.gal : 14 ms
[2023-03-20 13:57:10] [INFO ] Time to serialize properties into /tmp/LTL2278151578584635393.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6055077168863413100.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10599645159963313577.hoa' '-atoms' '/tmp/LTL2278151578584635393.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2278151578584635393.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10599645159963313577.hoa
Detected timeout of ITS tools.
[2023-03-20 13:57:25] [INFO ] Flatten gal took : 17 ms
[2023-03-20 13:57:25] [INFO ] Flatten gal took : 15 ms
[2023-03-20 13:57:25] [INFO ] Time to serialize gal into /tmp/LTL8251190525405563884.gal : 2 ms
[2023-03-20 13:57:25] [INFO ] Time to serialize properties into /tmp/LTL14529098965263460734.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8251190525405563884.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14529098965263460734.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G((X(X(F("((((((Assigned_0_0+Assigned_0_1)+(Assigned_0_2+Assigned_0_3))+((Assigned_1_0+Assigned_1_1)+(Assigned_1_2+Assigned_1_3)))...12947
Formula 0 simplified : F(XXG!"((((((Assigned_0_0+Assigned_0_1)+(Assigned_0_2+Assigned_0_3))+((Assigned_1_0+Assigned_1_1)+(Assigned_1_2+Assigned_1_3)))+(((A...9833
Detected timeout of ITS tools.
[2023-03-20 13:57:40] [INFO ] Flatten gal took : 14 ms
[2023-03-20 13:57:40] [INFO ] Applying decomposition
[2023-03-20 13:57:40] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3601610320801745013.txt' '-o' '/tmp/graph3601610320801745013.bin' '-w' '/tmp/graph3601610320801745013.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3601610320801745013.bin' '-l' '-1' '-v' '-w' '/tmp/graph3601610320801745013.weights' '-q' '0' '-e' '0.001'
[2023-03-20 13:57:40] [INFO ] Decomposing Gal with order
[2023-03-20 13:57:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-20 13:57:40] [INFO ] Removed a total of 306 redundant transitions.
[2023-03-20 13:57:40] [INFO ] Flatten gal took : 170 ms
[2023-03-20 13:57:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 273 labels/synchronizations in 16 ms.
[2023-03-20 13:57:40] [INFO ] Time to serialize gal into /tmp/LTL9724005838491802150.gal : 4 ms
[2023-03-20 13:57:40] [INFO ] Time to serialize properties into /tmp/LTL6317253115262276431.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9724005838491802150.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6317253115262276431.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G((X(X(F("((((((gi2.gu2.Assigned_0_0+gi2.gu2.Assigned_0_1)+(gi2.gu2.Assigned_0_2+gi2.gu2.Assigned_0_3))+((gi2.gu2.Assigned_1_0+gi2...16835
Formula 0 simplified : F(XXG!"((((((gi2.gu2.Assigned_0_0+gi2.gu2.Assigned_0_1)+(gi2.gu2.Assigned_0_2+gi2.gu2.Assigned_0_3))+((gi2.gu2.Assigned_1_0+gi2.gu2....12953
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11580440427803984155
[2023-03-20 13:57:55] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11580440427803984155
Running compilation step : cd /tmp/ltsmin11580440427803984155;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 476 ms.
Running link step : cd /tmp/ltsmin11580440427803984155;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin11580440427803984155;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((X(X(<>((LTLAPp0==true))))||((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))))||(<>((LTLAPp3==true))&&(X(X(<>((LTLAPp0==true))))||((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-04 finished in 98380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 126 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Applied a total of 0 rules in 3 ms. Remains 228 /228 variables (removed 0) and now considering 354/354 (removed 0) transitions.
// Phase 1: matrix 354 rows 228 cols
[2023-03-20 13:58:10] [INFO ] Computed 15 place invariants in 6 ms
[2023-03-20 13:58:11] [INFO ] Implicit Places using invariants in 169 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 171 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 227/228 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 227 /227 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 175 ms. Remains : 227/228 places, 354/354 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 3 (ADD s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177)), p0:(LEQ (ADD s18...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 444 reset in 258 ms.
Stack based approach found an accepted trace after 54156 steps with 227 reset with depth 352 and stack size 352 in 147 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-05 finished in 718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 228 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 132 transition count 234
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 216 place count 132 transition count 210
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 264 place count 108 transition count 210
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 276 place count 102 transition count 204
Applied a total of 276 rules in 13 ms. Remains 102 /228 variables (removed 126) and now considering 204/354 (removed 150) transitions.
// Phase 1: matrix 204 rows 102 cols
[2023-03-20 13:58:11] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-20 13:58:11] [INFO ] Implicit Places using invariants in 92 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/228 places, 204/354 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 110 ms. Remains : 101/228 places, 204/354 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ 1 (ADD s0 s1 s2 s3)) (GT 1 (ADD s58 s59 s60 s61 s62 s63)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 250 ms.
Stack based approach found an accepted trace after 2197 steps with 0 reset with depth 2198 and stack size 2198 in 6 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-06 finished in 410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0&&F(p1)) U (!p0&&X(X(p2)))))))'
Support contains 4 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 157 transition count 283
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 157 transition count 283
Applied a total of 142 rules in 10 ms. Remains 157 /228 variables (removed 71) and now considering 283/354 (removed 71) transitions.
// Phase 1: matrix 283 rows 157 cols
[2023-03-20 13:58:11] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-20 13:58:12] [INFO ] Implicit Places using invariants in 77 ms returned [114]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/228 places, 283/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 156 /156 variables (removed 0) and now considering 283/283 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 156/228 places, 283/354 transitions.
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (NOT p1), (NOT p2), (OR (NOT p2) p0), (NOT p2), true]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(NOT p0), acceptance={0} source=4 dest: 3}, { cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s115 s130), p1:(AND (LEQ s115 s130) (LEQ s129 s70)), p2:(LEQ 1 s129)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 821 steps with 17 reset in 2 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-09 finished in 414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 156 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 156 transition count 282
Applied a total of 144 rules in 6 ms. Remains 156 /228 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 156 cols
[2023-03-20 13:58:12] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-20 13:58:12] [INFO ] Implicit Places using invariants in 77 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/228 places, 282/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 155/228 places, 282/354 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GT 1 s112) (LEQ s113 s110))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 56 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-11 finished in 187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&F(p1)))))'
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 156 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 156 transition count 282
Applied a total of 144 rules in 5 ms. Remains 156 /228 variables (removed 72) and now considering 282/354 (removed 72) transitions.
[2023-03-20 13:58:12] [INFO ] Invariant cache hit.
[2023-03-20 13:58:12] [INFO ] Implicit Places using invariants in 71 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/228 places, 282/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 155/228 places, 282/354 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s103 s114), p1:(GT 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 9 reset in 201 ms.
Stack based approach found an accepted trace after 14052 steps with 0 reset with depth 14053 and stack size 14053 in 38 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-12 finished in 458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(X(G(!p0))))))'
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 156 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 156 transition count 282
Applied a total of 144 rules in 6 ms. Remains 156 /228 variables (removed 72) and now considering 282/354 (removed 72) transitions.
[2023-03-20 13:58:13] [INFO ] Invariant cache hit.
[2023-03-20 13:58:13] [INFO ] Implicit Places using invariants in 69 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/228 places, 282/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 155/228 places, 282/354 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, p0, p0, true, true, true]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(GT s138 s112)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-14 finished in 254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 228 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 132 transition count 234
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 216 place count 132 transition count 210
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 264 place count 108 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 267 place count 105 transition count 138
Iterating global reduction 2 with 3 rules applied. Total rules applied 270 place count 105 transition count 138
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 288 place count 87 transition count 120
Iterating global reduction 2 with 18 rules applied. Total rules applied 306 place count 87 transition count 120
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 324 place count 69 transition count 84
Iterating global reduction 2 with 18 rules applied. Total rules applied 342 place count 69 transition count 84
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 360 place count 51 transition count 66
Iterating global reduction 2 with 18 rules applied. Total rules applied 378 place count 51 transition count 66
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 396 place count 51 transition count 48
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 396 place count 51 transition count 42
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 408 place count 45 transition count 42
Applied a total of 408 rules in 17 ms. Remains 45 /228 variables (removed 183) and now considering 42/354 (removed 312) transitions.
// Phase 1: matrix 42 rows 45 cols
[2023-03-20 13:58:13] [INFO ] Computed 15 place invariants in 0 ms
[2023-03-20 13:58:13] [INFO ] Implicit Places using invariants in 41 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/228 places, 42/354 transitions.
Applied a total of 0 rules in 5 ms. Remains 44 /44 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 76 ms. Remains : 44/228 places, 42/354 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT 3 s18), p0:(LEQ 1 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 128 ms.
Product exploration explored 100000 steps with 1 reset in 155 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 p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 7127 steps, including 2 resets, run visited all 2 properties in 22 ms. (steps per millisecond=323 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 42 rows 44 cols
[2023-03-20 13:58:14] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-20 13:58:14] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-20 13:58:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:58:14] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-20 13:58:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:58:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-20 13:58:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:58:14] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-20 13:58:14] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-20 13:58:14] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-20 13:58:14] [INFO ] Invariant cache hit.
[2023-03-20 13:58:14] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-20 13:58:14] [INFO ] Invariant cache hit.
[2023-03-20 13:58:14] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-20 13:58:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 13:58:14] [INFO ] Invariant cache hit.
[2023-03-20 13:58:14] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 44/44 places, 42/42 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 (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 159 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :1
Finished Best-First random walk after 30 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 223 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-20 13:58:15] [INFO ] Invariant cache hit.
[2023-03-20 13:58:15] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-20 13:58:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:58:15] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-20 13:58:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:58:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-20 13:58:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:58:15] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-20 13:58:15] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-20 13:58:15] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 138 ms.
Product exploration explored 100000 steps with 1 reset in 177 ms.
Built C files in :
/tmp/ltsmin452304585782062583
[2023-03-20 13:58:15] [INFO ] Computing symmetric may disable matrix : 42 transitions.
[2023-03-20 13:58:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 13:58:15] [INFO ] Computing symmetric may enable matrix : 42 transitions.
[2023-03-20 13:58:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 13:58:15] [INFO ] Computing Do-Not-Accords matrix : 42 transitions.
[2023-03-20 13:58:15] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 13:58:15] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin452304585782062583
Running compilation step : cd /tmp/ltsmin452304585782062583;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 132 ms.
Running link step : cd /tmp/ltsmin452304585782062583;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin452304585782062583;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15822145851967828913.hoa' '--buchi-type=spotba'
LTSmin run took 3911 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-15 finished in 6737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(X(F(p0)))||(p1 U (p2||G(p1)))))||((X(X(F(p0)))||(p1 U (p2||G(p1))))&&F(p3))))'
Found a Shortening insensitive property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-04
Stuttering acceptance computed with spot in 391 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p0))]
Support contains 172 out of 228 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 222 transition count 348
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 7 places and 0 transitions.
Iterating global reduction 0 with 13 rules applied. Total rules applied 25 place count 215 transition count 342
Applied a total of 25 rules in 8 ms. Remains 215 /228 variables (removed 13) and now considering 342/354 (removed 12) transitions.
// Phase 1: matrix 342 rows 215 cols
[2023-03-20 13:58:20] [INFO ] Computed 14 place invariants in 6 ms
[2023-03-20 13:58:20] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-20 13:58:20] [INFO ] Invariant cache hit.
[2023-03-20 13:58:20] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-20 13:58:20] [INFO ] Invariant cache hit.
[2023-03-20 13:58:20] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 215/228 places, 342/354 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 314 ms. Remains : 215/228 places, 342/354 transitions.
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(AND (GT (ADD s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171) (ADD s4 s5 s6 s7...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14482 reset in 604 ms.
Product exploration explored 100000 steps with 14318 reset in 597 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p3) (NOT p0)), (X (AND (NOT p2) p1 (NOT p3))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT p3)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT p3)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
Knowledge based reduction with 10 factoid took 737 ms. Reduced automaton from 9 states, 15 edges and 4 AP (stutter sensitive) to 8 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 13:58:23] [INFO ] Invariant cache hit.
[2023-03-20 13:58:23] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-20 13:58:23] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p3) (NOT p0)), (X (AND (NOT p2) p1 (NOT p3))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT p3)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT p3))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F p0), (F (NOT (AND (NOT p3) (NOT p0)))), (F (NOT (AND p1 (NOT p2) (NOT p0)))), (F p3), (F (NOT (AND p1 (NOT p2) (NOT p3))))]
Knowledge based reduction with 11 factoid took 860 ms. Reduced automaton from 8 states, 12 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 168 out of 215 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 342/342 transitions.
Applied a total of 0 rules in 2 ms. Remains 215 /215 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2023-03-20 13:58:24] [INFO ] Invariant cache hit.
[2023-03-20 13:58:24] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-20 13:58:24] [INFO ] Invariant cache hit.
[2023-03-20 13:58:24] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-20 13:58:24] [INFO ] Invariant cache hit.
[2023-03-20 13:58:24] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 307 ms. Remains : 215/215 places, 342/342 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0)))))]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 13 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F p0), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 2 factoid took 194 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 10151 reset in 539 ms.
Product exploration explored 100000 steps with 10133 reset in 521 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 168 out of 215 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 215/215 places, 342/342 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 215 transition count 342
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 24 rules in 12 ms. Remains 215 /215 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2023-03-20 13:58:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 342 rows 215 cols
[2023-03-20 13:58:27] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-20 13:58:27] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 215/215 places, 342/342 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 215/215 places, 342/342 transitions.
Built C files in :
/tmp/ltsmin15115279958109687624
[2023-03-20 13:58:27] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15115279958109687624
Running compilation step : cd /tmp/ltsmin15115279958109687624;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 498 ms.
Running link step : cd /tmp/ltsmin15115279958109687624;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15115279958109687624;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13890183049171613167.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 168 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 342/342 transitions.
Applied a total of 0 rules in 5 ms. Remains 215 /215 variables (removed 0) and now considering 342/342 (removed 0) transitions.
// Phase 1: matrix 342 rows 215 cols
[2023-03-20 13:58:42] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-20 13:58:42] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-20 13:58:42] [INFO ] Invariant cache hit.
[2023-03-20 13:58:42] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2023-03-20 13:58:42] [INFO ] Invariant cache hit.
[2023-03-20 13:58:42] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 336 ms. Remains : 215/215 places, 342/342 transitions.
Built C files in :
/tmp/ltsmin2995431050527813143
[2023-03-20 13:58:42] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2995431050527813143
Running compilation step : cd /tmp/ltsmin2995431050527813143;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 486 ms.
Running link step : cd /tmp/ltsmin2995431050527813143;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2995431050527813143;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2257633439493595113.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-20 13:58:57] [INFO ] Flatten gal took : 31 ms
[2023-03-20 13:58:57] [INFO ] Flatten gal took : 31 ms
[2023-03-20 13:58:57] [INFO ] Time to serialize gal into /tmp/LTL12392847397828100345.gal : 2 ms
[2023-03-20 13:58:57] [INFO ] Time to serialize properties into /tmp/LTL14830091236646315005.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12392847397828100345.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7730804187827682214.hoa' '-atoms' '/tmp/LTL14830091236646315005.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14830091236646315005.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7730804187827682214.hoa
Detected timeout of ITS tools.
[2023-03-20 13:59:13] [INFO ] Flatten gal took : 25 ms
[2023-03-20 13:59:13] [INFO ] Flatten gal took : 14 ms
[2023-03-20 13:59:13] [INFO ] Time to serialize gal into /tmp/LTL12714664959843393125.gal : 2 ms
[2023-03-20 13:59:13] [INFO ] Time to serialize properties into /tmp/LTL7659414901624034571.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12714664959843393125.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7659414901624034571.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G((X(X(F("((((((Assigned_0_0+Assigned_0_1)+(Assigned_0_2+Assigned_0_3))+((Assigned_1_0+Assigned_1_1)+(Assigned_1_2+Assigned_1_3)))...12947
Formula 0 simplified : F(XXG!"((((((Assigned_0_0+Assigned_0_1)+(Assigned_0_2+Assigned_0_3))+((Assigned_1_0+Assigned_1_1)+(Assigned_1_2+Assigned_1_3)))+(((A...9833
Detected timeout of ITS tools.
[2023-03-20 13:59:28] [INFO ] Flatten gal took : 23 ms
[2023-03-20 13:59:28] [INFO ] Applying decomposition
[2023-03-20 13:59:28] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4006248634106679893.txt' '-o' '/tmp/graph4006248634106679893.bin' '-w' '/tmp/graph4006248634106679893.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4006248634106679893.bin' '-l' '-1' '-v' '-w' '/tmp/graph4006248634106679893.weights' '-q' '0' '-e' '0.001'
[2023-03-20 13:59:28] [INFO ] Decomposing Gal with order
[2023-03-20 13:59:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-20 13:59:28] [INFO ] Removed a total of 322 redundant transitions.
[2023-03-20 13:59:28] [INFO ] Flatten gal took : 80 ms
[2023-03-20 13:59:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 192 labels/synchronizations in 19 ms.
[2023-03-20 13:59:28] [INFO ] Time to serialize gal into /tmp/LTL6554775895966933491.gal : 3 ms
[2023-03-20 13:59:28] [INFO ] Time to serialize properties into /tmp/LTL4236632852187264506.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6554775895966933491.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4236632852187264506.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G((X(X(F("((((((gi1.gu2.Assigned_0_0+gi1.gu2.Assigned_0_1)+(gi1.gu2.Assigned_0_2+gi1.gu2.Assigned_0_3))+((gi1.gu2.Assigned_1_0+gi1...16803
Formula 0 simplified : F(XXG!"((((((gi1.gu2.Assigned_0_0+gi1.gu2.Assigned_0_1)+(gi1.gu2.Assigned_0_2+gi1.gu2.Assigned_0_3))+((gi1.gu2.Assigned_1_0+gi1.gu2....12921
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4361887703105236657
[2023-03-20 13:59:43] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4361887703105236657
Running compilation step : cd /tmp/ltsmin4361887703105236657;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 491 ms.
Running link step : cd /tmp/ltsmin4361887703105236657;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin4361887703105236657;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((X(X(<>((LTLAPp0==true))))||((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))))||(<>((LTLAPp3==true))&&(X(X(<>((LTLAPp0==true))))||((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-04 finished in 98588 ms.
[2023-03-20 13:59:58] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8421743054376019011
[2023-03-20 13:59:58] [INFO ] Computing symmetric may disable matrix : 354 transitions.
[2023-03-20 13:59:58] [INFO ] Applying decomposition
[2023-03-20 13:59:58] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 13:59:58] [INFO ] Computing symmetric may enable matrix : 354 transitions.
[2023-03-20 13:59:58] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 13:59:58] [INFO ] Flatten gal took : 11 ms
[2023-03-20 13:59:58] [INFO ] Computing Do-Not-Accords matrix : 354 transitions.
[2023-03-20 13:59:58] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 13:59:58] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8421743054376019011
Running compilation step : cd /tmp/ltsmin8421743054376019011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3110846640165416435.txt' '-o' '/tmp/graph3110846640165416435.bin' '-w' '/tmp/graph3110846640165416435.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3110846640165416435.bin' '-l' '-1' '-v' '-w' '/tmp/graph3110846640165416435.weights' '-q' '0' '-e' '0.001'
[2023-03-20 13:59:58] [INFO ] Decomposing Gal with order
[2023-03-20 13:59:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-20 13:59:58] [INFO ] Removed a total of 299 redundant transitions.
[2023-03-20 13:59:58] [INFO ] Flatten gal took : 82 ms
[2023-03-20 13:59:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 225 labels/synchronizations in 8 ms.
[2023-03-20 13:59:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality5754516026169226253.gal : 2 ms
[2023-03-20 13:59:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality1364181696345866008.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5754516026169226253.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1364181696345866008.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !(((G((X(X(F("((((((gu2.Assigned_0_0+gu2.Assigned_0_1)+(gu2.Assigned_0_2+gu2.Assigned_0_3))+((gu2.Assigned_1_0+gu2.Assigned_1_1)+(gu2....16051
Formula 0 simplified : F(XXG!"((((((gu2.Assigned_0_0+gu2.Assigned_0_1)+(gu2.Assigned_0_2+gu2.Assigned_0_3))+((gu2.Assigned_1_0+gu2.Assigned_1_1)+(gu2.Assig...12169
Compilation finished in 784 ms.
Running link step : cd /tmp/ltsmin8421743054376019011;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8421743054376019011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((X(X(<>((LTLAPp0==true))))||((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))))||((X(X(<>((LTLAPp0==true))))||((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true)))))&&<>((LTLAPp3==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( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Loading model from ./gal.so
pins2lts-mc-linux64( 7/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.019: LTL layer: formula: ([]((X(X(<>((LTLAPp0==true))))||((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))))||((X(X(<>((LTLAPp0==true))))||((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true)))))&&<>((LTLAPp3==true))))
pins2lts-mc-linux64( 5/ 8), 0.019: "([]((X(X(<>((LTLAPp0==true))))||((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))))||((X(X(<>((LTLAPp0==true))))||((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true)))))&&<>((LTLAPp3==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.020: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.041: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.140: DFS-FIFO for weak LTL, using special progress label 359
pins2lts-mc-linux64( 0/ 8), 0.141: There are 360 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.141: State length is 229, there are 369 groups
pins2lts-mc-linux64( 0/ 8), 0.141: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.141: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.141: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.141: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.178: ~1 levels ~960 states ~11480 transitions
pins2lts-mc-linux64( 0/ 8), 0.243: ~1 levels ~1920 states ~22304 transitions
pins2lts-mc-linux64( 0/ 8), 0.355: ~1 levels ~3840 states ~42664 transitions
pins2lts-mc-linux64( 0/ 8), 0.543: ~1 levels ~7680 states ~92136 transitions
pins2lts-mc-linux64( 0/ 8), 0.799: ~1 levels ~15360 states ~184520 transitions
pins2lts-mc-linux64( 0/ 8), 1.365: ~1 levels ~30720 states ~359080 transitions
pins2lts-mc-linux64( 0/ 8), 2.120: ~1 levels ~61440 states ~662496 transitions
pins2lts-mc-linux64( 0/ 8), 3.383: ~1 levels ~122880 states ~1295104 transitions
pins2lts-mc-linux64( 6/ 8), 5.465: ~1 levels ~245760 states ~2761856 transitions
pins2lts-mc-linux64( 0/ 8), 9.110: ~1 levels ~491520 states ~5377440 transitions
pins2lts-mc-linux64( 0/ 8), 15.485: ~1 levels ~983040 states ~10148080 transitions
pins2lts-mc-linux64( 2/ 8), 32.254: ~14 levels ~1966080 states ~21434232 transitions
pins2lts-mc-linux64( 2/ 8), 47.418: ~14 levels ~3932160 states ~25531448 transitions
pins2lts-mc-linux64( 2/ 8), 76.480: ~14 levels ~7864320 states ~33718688 transitions
pins2lts-mc-linux64( 2/ 8), 126.927: ~14 levels ~15728640 states ~50101240 transitions
pins2lts-mc-linux64( 2/ 8), 225.628: ~14 levels ~31457280 states ~82851592 transitions
pins2lts-mc-linux64( 2/ 8), 421.696: ~14 levels ~62914560 states ~148334936 transitions
pins2lts-mc-linux64( 5/ 8), 756.434: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 756.504:
pins2lts-mc-linux64( 0/ 8), 756.504: mean standard work distribution: 33.8% (states) 36.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 756.504:
pins2lts-mc-linux64( 0/ 8), 756.504: Explored 88253771 states 365924453 transitions, fanout: 4.146
pins2lts-mc-linux64( 0/ 8), 756.504: Total exploration time 756.330 sec (756.270 sec minimum, 756.309 sec on average)
pins2lts-mc-linux64( 0/ 8), 756.504: States per second: 116687, Transitions per second: 483816
pins2lts-mc-linux64( 0/ 8), 756.504:
pins2lts-mc-linux64( 0/ 8), 756.504: Progress states detected: 62409984
pins2lts-mc-linux64( 0/ 8), 756.504: Redundant explorations: -34.2456
pins2lts-mc-linux64( 0/ 8), 756.504:
pins2lts-mc-linux64( 0/ 8), 756.504: Queue width: 8B, total height: 68848698, memory: 525.27MB
pins2lts-mc-linux64( 0/ 8), 756.504: Tree memory: 1067.8MB, 8.3 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 756.504: Tree fill ratio (roots/leafs): 99.0%/17.0%
pins2lts-mc-linux64( 0/ 8), 756.504: Stored 409 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 756.504: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 756.504: Est. total memory use: 1593.1MB (~1549.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8421743054376019011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((X(X(<>((LTLAPp0==true))))||((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))))||((X(X(<>((LTLAPp0==true))))||((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true)))))&&<>((LTLAPp3==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8421743054376019011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((X(X(<>((LTLAPp0==true))))||((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))))||((X(X(<>((LTLAPp0==true))))||((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true)))))&&<>((LTLAPp3==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-20 14:21:21] [INFO ] Flatten gal took : 12 ms
[2023-03-20 14:21:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality7814301032140664429.gal : 3 ms
[2023-03-20 14:21:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality8900835030774375502.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7814301032140664429.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8900835030774375502.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !(((G((X(X(F("((((((Assigned_0_0+Assigned_0_1)+(Assigned_0_2+Assigned_0_3))+((Assigned_1_0+Assigned_1_1)+(Assigned_1_2+Assigned_1_3)))...12947
Formula 0 simplified : F(XXG!"((((((Assigned_0_0+Assigned_0_1)+(Assigned_0_2+Assigned_0_3))+((Assigned_1_0+Assigned_1_1)+(Assigned_1_2+Assigned_1_3)))+(((A...9833
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2023-03-20 14:42:43] [INFO ] Flatten gal took : 15 ms
[2023-03-20 14:42:43] [INFO ] Input system was already deterministic with 354 transitions.
[2023-03-20 14:42:43] [INFO ] Transformed 228 places.
[2023-03-20 14:42:43] [INFO ] Transformed 354 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
[2023-03-20 14:42:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality4961015168570855921.gal : 99 ms
[2023-03-20 14:42:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality2715180771706538283.ltl : 15 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4961015168570855921.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2715180771706538283.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G((X(X(F("((((((Assigned_0_0+Assigned_0_1)+(Assigned_0_2+Assigned_0_3))+((Assigned_1_0+Assigned_1_1)+(Assigned_1_2+Assigned_1_3)))...12947
Formula 0 simplified : F(XXG!"((((((Assigned_0_0+Assigned_0_1)+(Assigned_0_2+Assigned_0_3))+((Assigned_1_0+Assigned_1_1)+(Assigned_1_2+Assigned_1_3)))+(((A...9833
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
37 unique states visited
0 strongly connected components in search stack
44 transitions explored
23 items max in DFS search stack
34260 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,342.659,2894184,1,0,171,1.74904e+07,43,71,13545,1.11719e+07,465
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Total runtime 3170353 ms.

BK_STOP 1679323722689

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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