fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r485-tall-167912700201027
Last Updated
May 14, 2023

About the Execution of ITS-Tools for UtilityControlRoom-COL-Z4T3N06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1900.331 207724.00 544938.00 567.40 FFTTTFFTFFFFFFFF normal

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-167912700201027.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-COL-Z4T3N06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912700201027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 8.6K Feb 26 14:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 14:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 14:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 14:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 17:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 17:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 14:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 14:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 17:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 29K 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-COL-Z4T3N06-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-COL-Z4T3N06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679313932983

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-COL-Z4T3N06
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-20 12:05:34] [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 12:05:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 12:05:34] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-20 12:05:34] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-20 12:05:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 641 ms
[2023-03-20 12:05:35] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 228 PT places and 450.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2023-03-20 12:05:35] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 6 ms.
[2023-03-20 12:05:35] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Initial state reduction rules removed 3 formulas.
FORMULA UtilityControlRoom-COL-Z4T3N06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T3N06-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T3N06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10001 steps, including 2 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 27) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 13 cols
[2023-03-20 12:05:35] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-20 12:05:35] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 12:05:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-20 12:05:35] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2023-03-20 12:05:35] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-20 12:05:36] [INFO ] Flatten gal took : 16 ms
FORMULA UtilityControlRoom-COL-Z4T3N06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 12:05:36] [INFO ] Flatten gal took : 2 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(6), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2023-03-20 12:05:36] [INFO ] Unfolded HLPN to a Petri net with 228 places and 450 transitions 1446 arcs in 17 ms.
[2023-03-20 12:05:36] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 222 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 12:05:36] [INFO ] Computed 15 place invariants in 18 ms
[2023-03-20 12:05:36] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-20 12:05:36] [INFO ] Invariant cache hit.
[2023-03-20 12:05:36] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2023-03-20 12:05:36] [INFO ] Invariant cache hit.
[2023-03-20 12:05:36] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 457 ms. Remains : 228/228 places, 354/354 transitions.
Support contains 222 out of 228 places after structural reductions.
[2023-03-20 12:05:36] [INFO ] Flatten gal took : 31 ms
[2023-03-20 12:05:36] [INFO ] Flatten gal took : 24 ms
[2023-03-20 12:05:36] [INFO ] Input system was already deterministic with 354 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 24) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 12:05:36] [INFO ] Invariant cache hit.
[2023-03-20 12:05:36] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:05:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-20 12:05:37] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.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 12:05:37] [INFO ] Computed 15 place invariants in 3 ms
[2023-03-20 12:05:37] [INFO ] Implicit Places using invariants in 80 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 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 4 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 103 ms. Remains : 155/228 places, 282/354 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-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 3556 reset in 341 ms.
Product exploration explored 100000 steps with 3537 reset in 263 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 137 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 38 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 130 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 50 ms :[(NOT p0)]
// Phase 1: matrix 282 rows 155 cols
[2023-03-20 12:05:38] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-20 12:05:38] [INFO ] [Real]Absence check using 14 positive place invariants in 8 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 95 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-COL-Z4T3N06-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T3N06-LTLCardinality-00 finished in 1579 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 0 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 1 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 32 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 12:05:38] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-20 12:05:39] [INFO ] Implicit Places using invariants in 82 ms returned [155]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 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 8 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 123 ms. Remains : 197/228 places, 324/354 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-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 679 ms.
Stack based approach found an accepted trace after 2123 steps with 0 reset with depth 2124 and stack size 522 in 25 ms.
FORMULA UtilityControlRoom-COL-Z4T3N06-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N06-LTLCardinality-01 finished in 953 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 1 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 26 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 12:05:39] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-20 12:05:39] [INFO ] Implicit Places using invariants in 39 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 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 12 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 12:05:39] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-20 12:05:39] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-20 12:05:39] [INFO ] Invariant cache hit.
[2023-03-20 12:05:40] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 121 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 200 ms. Remains : 91/228 places, 126/354 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-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 8109 reset in 211 ms.
Product exploration explored 100000 steps with 8134 reset in 191 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 161 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
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 110 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 46 ms :[(NOT p0)]
[2023-03-20 12:05:40] [INFO ] Invariant cache hit.
[2023-03-20 12:05:40] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-20 12:05:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:05:41] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-20 12:05:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:05:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-20 12:05:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:05:41] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-20 12:05:41] [INFO ] Computed and/alt/rep : 102/240/102 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-20 12:05:41] [INFO ] Added : 63 causal constraints over 13 iterations in 134 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 12:05:41] [INFO ] Invariant cache hit.
[2023-03-20 12:05:41] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-20 12:05:41] [INFO ] Invariant cache hit.
[2023-03-20 12:05:41] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-20 12:05:41] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 12:05:41] [INFO ] Invariant cache hit.
[2023-03-20 12:05:41] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 205 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 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 199 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2023-03-20 12:05:41] [INFO ] Invariant cache hit.
[2023-03-20 12:05:42] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-20 12:05:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:05:42] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-20 12:05:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:05:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-20 12:05:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:05:42] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-20 12:05:42] [INFO ] Computed and/alt/rep : 102/240/102 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-20 12:05:42] [INFO ] Added : 63 causal constraints over 13 iterations in 122 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8164 reset in 177 ms.
Product exploration explored 100000 steps with 8151 reset in 180 ms.
Built C files in :
/tmp/ltsmin2287532393064886921
[2023-03-20 12:05:42] [INFO ] Computing symmetric may disable matrix : 126 transitions.
[2023-03-20 12:05:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 12:05:42] [INFO ] Computing symmetric may enable matrix : 126 transitions.
[2023-03-20 12:05:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 12:05:42] [INFO ] Computing Do-Not-Accords matrix : 126 transitions.
[2023-03-20 12:05:42] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 12:05:42] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2287532393064886921
Running compilation step : cd /tmp/ltsmin2287532393064886921;'/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 343 ms.
Running link step : cd /tmp/ltsmin2287532393064886921;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin2287532393064886921;'/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/stateBased15214545694829768254.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 10 ms. Remains 91 /91 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-20 12:05:57] [INFO ] Invariant cache hit.
[2023-03-20 12:05:57] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-20 12:05:57] [INFO ] Invariant cache hit.
[2023-03-20 12:05:57] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-20 12:05:57] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 12:05:57] [INFO ] Invariant cache hit.
[2023-03-20 12:05:58] [INFO ] Dead Transitions using invariants and state equation in 66 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/ltsmin7288914796908028337
[2023-03-20 12:05:58] [INFO ] Computing symmetric may disable matrix : 126 transitions.
[2023-03-20 12:05:58] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 12:05:58] [INFO ] Computing symmetric may enable matrix : 126 transitions.
[2023-03-20 12:05:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 12:05:58] [INFO ] Computing Do-Not-Accords matrix : 126 transitions.
[2023-03-20 12:05:58] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 12:05:58] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7288914796908028337
Running compilation step : cd /tmp/ltsmin7288914796908028337;'/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 254 ms.
Running link step : cd /tmp/ltsmin7288914796908028337;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7288914796908028337;'/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/stateBased2632812974710952700.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-20 12:06:13] [INFO ] Flatten gal took : 6 ms
[2023-03-20 12:06:13] [INFO ] Flatten gal took : 6 ms
[2023-03-20 12:06:13] [INFO ] Time to serialize gal into /tmp/LTL10760538066547499887.gal : 2 ms
[2023-03-20 12:06:13] [INFO ] Time to serialize properties into /tmp/LTL9222492721631783545.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10760538066547499887.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12605556647683196955.hoa' '-atoms' '/tmp/LTL9222492721631783545.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/LTL9222492721631783545.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12605556647683196955.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
26 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.287062,26636,1,0,80,72957,20,17,2317,45186,163
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-COL-Z4T3N06-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-COL-Z4T3N06-LTLCardinality-02 finished in 33712 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 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
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 21 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 12:06:13] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-20 12:06:13] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-20 12:06:13] [INFO ] Invariant cache hit.
[2023-03-20 12:06:13] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-20 12:06:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:06:13] [INFO ] Invariant cache hit.
[2023-03-20 12:06:13] [INFO ] Dead Transitions using invariants and state equation in 38 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 172 ms. Remains : 38/228 places, 36/354 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-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 18793 reset in 127 ms.
Product exploration explored 100000 steps with 18761 reset in 123 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 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 28 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
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 128 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2023-03-20 12:06:14] [INFO ] Invariant cache hit.
[2023-03-20 12:06:14] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-20 12:06:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:06:14] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-20 12:06:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:06:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-20 12:06:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:06:14] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-20 12:06:14] [INFO ] Computed and/alt/rep : 30/84/30 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-20 12:06:14] [INFO ] Added : 3 causal constraints over 1 iterations in 9 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 12:06:14] [INFO ] Invariant cache hit.
[2023-03-20 12:06:14] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-20 12:06:14] [INFO ] Invariant cache hit.
[2023-03-20 12:06:14] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-20 12:06:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:06:14] [INFO ] Invariant cache hit.
[2023-03-20 12:06:14] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 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 145 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 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
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 147 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 104 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2023-03-20 12:06:15] [INFO ] Invariant cache hit.
[2023-03-20 12:06:15] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-20 12:06:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 12:06:15] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-20 12:06:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 12:06:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-20 12:06:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 12:06:15] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-20 12:06:15] [INFO ] Computed and/alt/rep : 30/84/30 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-20 12:06:15] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 18759 reset in 115 ms.
Product exploration explored 100000 steps with 18749 reset in 138 ms.
Built C files in :
/tmp/ltsmin17066531811255634966
[2023-03-20 12:06:15] [INFO ] Computing symmetric may disable matrix : 36 transitions.
[2023-03-20 12:06:15] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 12:06:15] [INFO ] Computing symmetric may enable matrix : 36 transitions.
[2023-03-20 12:06:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 12:06:15] [INFO ] Computing Do-Not-Accords matrix : 36 transitions.
[2023-03-20 12:06:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 12:06:15] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17066531811255634966
Running compilation step : cd /tmp/ltsmin17066531811255634966;'/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 108 ms.
Running link step : cd /tmp/ltsmin17066531811255634966;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin17066531811255634966;'/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/stateBased13638104425493156940.hoa' '--buchi-type=spotba'
LTSmin run took 93 ms.
FORMULA UtilityControlRoom-COL-Z4T3N06-LTLCardinality-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T3N06-LTLCardinality-03 finished in 2194 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 2 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 12:06:15] [INFO ] Computed 15 place invariants in 3 ms
[2023-03-20 12:06:15] [INFO ] Implicit Places using invariants in 80 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 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 84 ms. Remains : 227/228 places, 354/354 transitions.
Stuttering acceptance computed with spot in 359 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-COL-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 13439 reset in 558 ms.
Product exploration explored 100000 steps with 13410 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 (NOT p3)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (AND (NOT p2) p1 (NOT p3))), (X (X (NOT p3))), (X (X (NOT p0))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (AND (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 633 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 329 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 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 354 rows 227 cols
[2023-03-20 12:06:18] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-20 12:06:18] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-20 12:06:18] [INFO ] After 85ms 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 (NOT p3)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (AND (NOT p2) p1 (NOT p3))), (X (X (NOT p3))), (X (X (NOT p0))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (AND (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT 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 720 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 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 137 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 3 ms. Remains 227 /227 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-20 12:06:19] [INFO ] Invariant cache hit.
[2023-03-20 12:06:19] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-20 12:06:19] [INFO ] Invariant cache hit.
[2023-03-20 12:06:19] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2023-03-20 12:06:19] [INFO ] Invariant cache hit.
[2023-03-20 12:06:20] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 468 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 219 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 146 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 445 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=63 )
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 211 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 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 149 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 148 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 9146 reset in 487 ms.
Product exploration explored 100000 steps with 9168 reset in 497 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 160 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 1 ms
Applied a total of 30 rules in 19 ms. Remains 227 /227 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-20 12:06:22] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 354 rows 227 cols
[2023-03-20 12:06:22] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-20 12:06:22] [INFO ] Dead Transitions using invariants and state equation in 196 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 248 ms. Remains : 227/227 places, 354/354 transitions.
Built C files in :
/tmp/ltsmin12096575514151294540
[2023-03-20 12:06:22] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12096575514151294540
Running compilation step : cd /tmp/ltsmin12096575514151294540;'/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 568 ms.
Running link step : cd /tmp/ltsmin12096575514151294540;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12096575514151294540;'/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/stateBased16160420563101808990.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 4 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 12:06:37] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-20 12:06:37] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-20 12:06:37] [INFO ] Invariant cache hit.
[2023-03-20 12:06:38] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2023-03-20 12:06:38] [INFO ] Invariant cache hit.
[2023-03-20 12:06:38] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 391 ms. Remains : 227/227 places, 354/354 transitions.
Built C files in :
/tmp/ltsmin80326710832398558
[2023-03-20 12:06:38] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin80326710832398558
Running compilation step : cd /tmp/ltsmin80326710832398558;'/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 517 ms.
Running link step : cd /tmp/ltsmin80326710832398558;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin80326710832398558;'/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/stateBased7979970427875296884.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-20 12:06:53] [INFO ] Flatten gal took : 16 ms
[2023-03-20 12:06:53] [INFO ] Flatten gal took : 16 ms
[2023-03-20 12:06:53] [INFO ] Time to serialize gal into /tmp/LTL16001481295944863191.gal : 4 ms
[2023-03-20 12:06:53] [INFO ] Time to serialize properties into /tmp/LTL11796185135999722379.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/LTL16001481295944863191.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5906639644885758373.hoa' '-atoms' '/tmp/LTL11796185135999722379.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/LTL11796185135999722379.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5906639644885758373.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2023-03-20 12:07:08] [INFO ] Flatten gal took : 17 ms
[2023-03-20 12:07:08] [INFO ] Flatten gal took : 16 ms
[2023-03-20 12:07:08] [INFO ] Time to serialize gal into /tmp/LTL1626870695021422758.gal : 3 ms
[2023-03-20 12:07:08] [INFO ] Time to serialize properties into /tmp/LTL14593708483789939745.ltl : 4 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/LTL1626870695021422758.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14593708483789939745.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+Assigned_1)+(Assigned_2+Assigned_3))+((Assigned_4+Assigned_5)+(Assigned_6+Assigned_7)))+(((Assigned_8+A...10887
Formula 0 simplified : F(XXG!"((((((Assigned_0+Assigned_1)+(Assigned_2+Assigned_3))+((Assigned_4+Assigned_5)+(Assigned_6+Assigned_7)))+(((Assigned_8+Assign...8369
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2023-03-20 12:07:23] [INFO ] Flatten gal took : 15 ms
[2023-03-20 12:07:23] [INFO ] Applying decomposition
[2023-03-20 12:07:23] [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/graph2313992462251640017.txt' '-o' '/tmp/graph2313992462251640017.bin' '-w' '/tmp/graph2313992462251640017.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2313992462251640017.bin' '-l' '-1' '-v' '-w' '/tmp/graph2313992462251640017.weights' '-q' '0' '-e' '0.001'
[2023-03-20 12:07:23] [INFO ] Decomposing Gal with order
[2023-03-20 12:07:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-20 12:07:23] [INFO ] Removed a total of 299 redundant transitions.
[2023-03-20 12:07:23] [INFO ] Flatten gal took : 179 ms
[2023-03-20 12:07:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 196 labels/synchronizations in 12 ms.
[2023-03-20 12:07:24] [INFO ] Time to serialize gal into /tmp/LTL15253064955600677738.gal : 53 ms
[2023-03-20 12:07:24] [INFO ] Time to serialize properties into /tmp/LTL7771920769390836850.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/LTL15253064955600677738.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7771920769390836850.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("((((((gu1.Assigned_0+gu1.Assigned_1)+(gu1.Assigned_2+gu1.Assigned_3))+((gu1.Assigned_4+gu1.Assigned_5)+(gu1.Assigned_6+g...13991
Formula 0 simplified : F(XXG!"((((((gu1.Assigned_0+gu1.Assigned_1)+(gu1.Assigned_2+gu1.Assigned_3))+((gu1.Assigned_4+gu1.Assigned_5)+(gu1.Assigned_6+gu1.As...10705
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12093638087378557663
[2023-03-20 12:07:39] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12093638087378557663
Running compilation step : cd /tmp/ltsmin12093638087378557663;'/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 512 ms.
Running link step : cd /tmp/ltsmin12093638087378557663;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin12093638087378557663;'/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-COL-Z4T3N06-LTLCardinality-04 finished in 98462 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 2 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 12:07:54] [INFO ] Computed 15 place invariants in 4 ms
[2023-03-20 12:07:54] [INFO ] Implicit Places using invariants in 92 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 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 98 ms. Remains : 227/228 places, 354/354 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-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 432 reset in 260 ms.
Product exploration explored 100000 steps with 429 reset in 280 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) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 351 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 312 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=78 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 287 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 126 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 2 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 12:07:56] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-20 12:07:56] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-20 12:07:56] [INFO ] Invariant cache hit.
[2023-03-20 12:07:56] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2023-03-20 12:07:56] [INFO ] Invariant cache hit.
[2023-03-20 12:07:56] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 367 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 p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 206 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 164 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 227 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 442 reset in 289 ms.
Product exploration explored 100000 steps with 496 reset in 303 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 126 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 227 transition count 372
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 6 rules in 14 ms. Remains 227 /227 variables (removed 0) and now considering 372/354 (removed -18) transitions.
[2023-03-20 12:07:58] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 372 rows 227 cols
[2023-03-20 12:07:58] [INFO ] Computed 14 place invariants in 6 ms
[2023-03-20 12:07:58] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 227/227 places, 372/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 199 ms. Remains : 227/227 places, 372/354 transitions.
Built C files in :
/tmp/ltsmin17001282868267316886
[2023-03-20 12:07:58] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17001282868267316886
Running compilation step : cd /tmp/ltsmin17001282868267316886;'/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 521 ms.
Running link step : cd /tmp/ltsmin17001282868267316886;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17001282868267316886;'/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/stateBased9612505432105074189.hoa' '--buchi-type=spotba'
LTSmin run took 2958 ms.
FORMULA UtilityControlRoom-COL-Z4T3N06-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T3N06-LTLCardinality-05 finished in 7670 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 0 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 17 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 12:08:01] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-20 12:08:01] [INFO ] Implicit Places using invariants in 61 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 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 83 ms. Remains : 101/228 places, 204/354 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-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 264 ms.
Stack based approach found an accepted trace after 6332 steps with 0 reset with depth 6333 and stack size 6333 in 22 ms.
FORMULA UtilityControlRoom-COL-Z4T3N06-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N06-LTLCardinality-06 finished in 434 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)||G((F(p1)&&F(!p0)))))'
Support contains 31 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
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 282 place count 99 transition count 132
Applied a total of 282 rules in 16 ms. Remains 99 /228 variables (removed 129) and now considering 132/354 (removed 222) transitions.
// Phase 1: matrix 132 rows 99 cols
[2023-03-20 12:08:02] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-20 12:08:02] [INFO ] Implicit Places using invariants in 63 ms returned [0, 56]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 64 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/228 places, 132/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 82 ms. Remains : 97/228 places, 132/354 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) p0), p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N06-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 (ADD s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96)), p1:(GT (ADD s55 s56 s57 s58 s59 s60) s54...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 5956 reset in 157 ms.
Stack based approach found an accepted trace after 19195 steps with 1143 reset with depth 10 and stack size 10 in 32 ms.
FORMULA UtilityControlRoom-COL-Z4T3N06-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N06-LTLCardinality-09 finished in 454 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(p0)&&(p1||G(F(p2))))))'
Support contains 138 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 12:08:02] [INFO ] Computed 15 place invariants in 6 ms
[2023-03-20 12:08:02] [INFO ] Implicit Places using invariants in 88 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 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 0 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 92 ms. Remains : 227/228 places, 354/354 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) p1), true]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N06-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ (ADD s191 s192 s193 s194 s195 s196) (ADD s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 ...], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 79 steps with 26 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T3N06-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N06-LTLCardinality-10 finished in 285 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 154 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_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 0 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
Applied a total of 12 rules in 11 ms. Remains 222 /228 variables (removed 6) and now considering 348/354 (removed 6) transitions.
// Phase 1: matrix 348 rows 222 cols
[2023-03-20 12:08:03] [INFO ] Computed 15 place invariants in 4 ms
[2023-03-20 12:08:03] [INFO ] Implicit Places using invariants in 73 ms returned [179]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 221/228 places, 348/354 transitions.
Applied a total of 0 rules in 4 ms. Remains 221 /221 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 89 ms. Remains : 221/228 places, 348/354 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N06-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ (ADD s179 s180 s181 s182 s183 s184) (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)) (AND (GT ...], 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 292 ms.
Stack based approach found an accepted trace after 99012 steps with 0 reset with depth 99013 and stack size 80862 in 319 ms.
FORMULA UtilityControlRoom-COL-Z4T3N06-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N06-LTLCardinality-12 finished in 748 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((X(p0)&&G(p1))))'
Support contains 103 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 2 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 12:08:03] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-20 12:08:03] [INFO ] Implicit Places using invariants in 95 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 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 103 ms. Remains : 227/228 places, 354/354 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N06-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LEQ (ADD s191 s192 s193 s194 s195 s196) (ADD s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s...], 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T3N06-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N06-LTLCardinality-14 finished in 283 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)||G(F(!p1))))||(p2 U (p3||G(p2))))))'
Support contains 60 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 7 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 12:08:04] [INFO ] Computed 15 place invariants in 3 ms
[2023-03-20 12:08:04] [INFO ] Implicit Places using invariants in 73 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 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 1 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 85 ms. Remains : 155/228 places, 282/354 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p3) (NOT p2) (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p3) (NOT p2) (NOT p0) p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N06-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p3:(AND (GT 1 (ADD s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57)) (GT 1 (ADD s119 s120 s121 s122 s123 s...], 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 1814 reset in 222 ms.
Product exploration explored 100000 steps with 1803 reset in 231 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 p3 p2 p0 (NOT p1)), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1))), true, (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 456 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[false, (AND (NOT p0) p1), (AND (NOT p0) p1), false]
Finished random walk after 45 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND p3 p2 p0 (NOT p1)), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1))), true, (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (F (NOT (AND p2 p3 p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (AND p0 p1)), (F (AND (NOT p0) p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 553 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[false, (AND (NOT p0) p1), (AND (NOT p0) p1), false]
Stuttering acceptance computed with spot in 149 ms :[false, (AND (NOT p0) p1), (AND (NOT p0) p1), false]
Support contains 60 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
// Phase 1: matrix 282 rows 155 cols
[2023-03-20 12:08:06] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-20 12:08:06] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-20 12:08:06] [INFO ] Invariant cache hit.
[2023-03-20 12:08:06] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2023-03-20 12:08:06] [INFO ] Invariant cache hit.
[2023-03-20 12:08:06] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 155/155 places, 282/282 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2 p3), (X (OR p0 (NOT p1))), true, (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 28 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND p0 (NOT p1) p2 p3), (X (OR p0 (NOT p1))), true, (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 p1))]
Knowledge based reduction with 4 factoid took 202 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 1832 reset in 217 ms.
Product exploration explored 100000 steps with 1831 reset in 229 ms.
Built C files in :
/tmp/ltsmin9762508319506942508
[2023-03-20 12:08:08] [INFO ] Computing symmetric may disable matrix : 282 transitions.
[2023-03-20 12:08:08] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 12:08:08] [INFO ] Computing symmetric may enable matrix : 282 transitions.
[2023-03-20 12:08:08] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 12:08:08] [INFO ] Computing Do-Not-Accords matrix : 282 transitions.
[2023-03-20 12:08:08] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 12:08:08] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9762508319506942508
Running compilation step : cd /tmp/ltsmin9762508319506942508;'/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 541 ms.
Running link step : cd /tmp/ltsmin9762508319506942508;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9762508319506942508;'/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/stateBased3320886045441204836.hoa' '--buchi-type=spotba'
LTSmin run took 501 ms.
FORMULA UtilityControlRoom-COL-Z4T3N06-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T3N06-LTLCardinality-15 finished in 5101 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-COL-Z4T3N06-LTLCardinality-04
Stuttering acceptance computed with spot in 363 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 0 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 13 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 12:08:09] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-20 12:08:09] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-20 12:08:09] [INFO ] Invariant cache hit.
[2023-03-20 12:08:09] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2023-03-20 12:08:09] [INFO ] Invariant cache hit.
[2023-03-20 12:08:10] [INFO ] Dead Transitions using invariants and state equation in 145 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 343 ms. Remains : 215/228 places, 342/354 transitions.
Running random walk in product with property : UtilityControlRoom-COL-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 14479 reset in 611 ms.
Product exploration explored 100000 steps with 14434 reset in 612 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 (NOT p3)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (AND (NOT p2) p1 (NOT p3))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (AND (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
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 664 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 307 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 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 12:08:12] [INFO ] Invariant cache hit.
[2023-03-20 12:08:12] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-20 12:08:12] [INFO ] After 59ms 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 (NOT p3)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (AND (NOT p2) p1 (NOT p3))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (AND (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (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 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 11 factoid took 824 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 134 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 131 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 1 ms. Remains 215 /215 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2023-03-20 12:08:13] [INFO ] Invariant cache hit.
[2023-03-20 12:08:13] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-20 12:08:13] [INFO ] Invariant cache hit.
[2023-03-20 12:08:14] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2023-03-20 12:08:14] [INFO ] Invariant cache hit.
[2023-03-20 12:08:14] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 768 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 135 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 11 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=11 )
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 190 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 131 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 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))]
Stuttering acceptance computed with spot in 131 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 10133 reset in 530 ms.
Product exploration explored 100000 steps with 10076 reset in 542 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 135 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 15 ms. Remains 215 /215 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2023-03-20 12:08:16] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 342 rows 215 cols
[2023-03-20 12:08:16] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-20 12:08:16] [INFO ] Dead Transitions using invariants and state equation in 317 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 354 ms. Remains : 215/215 places, 342/342 transitions.
Built C files in :
/tmp/ltsmin17027043089918738851
[2023-03-20 12:08:16] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17027043089918738851
Running compilation step : cd /tmp/ltsmin17027043089918738851;'/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/ltsmin17027043089918738851;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17027043089918738851;'/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/stateBased15522623605042983658.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 4 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 12:08:31] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-20 12:08:32] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-20 12:08:32] [INFO ] Invariant cache hit.
[2023-03-20 12:08:32] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-20 12:08:32] [INFO ] Invariant cache hit.
[2023-03-20 12:08:32] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 346 ms. Remains : 215/215 places, 342/342 transitions.
Built C files in :
/tmp/ltsmin10831993284080661275
[2023-03-20 12:08:32] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10831993284080661275
Running compilation step : cd /tmp/ltsmin10831993284080661275;'/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 507 ms.
Running link step : cd /tmp/ltsmin10831993284080661275;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin10831993284080661275;'/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/stateBased6310441219191836702.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-20 12:08:47] [INFO ] Flatten gal took : 17 ms
[2023-03-20 12:08:47] [INFO ] Flatten gal took : 16 ms
[2023-03-20 12:08:47] [INFO ] Time to serialize gal into /tmp/LTL3633459880202098131.gal : 2 ms
[2023-03-20 12:08:47] [INFO ] Time to serialize properties into /tmp/LTL15477480942207749654.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3633459880202098131.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4670281565641062601.hoa' '-atoms' '/tmp/LTL15477480942207749654.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/LTL15477480942207749654.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4670281565641062601.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
26 unique states visited
0 strongly connected components in search stack
29 transitions explored
17 items max in DFS search stack
1089 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,10.9304,254940,1,0,90,1.21513e+06,36,35,8876,1.00532e+06,249
no accepting run found
Formula 0 is TRUE no accepting run found.
Treatment of property UtilityControlRoom-COL-Z4T3N06-LTLCardinality-04 finished in 50649 ms.
FORMULA UtilityControlRoom-COL-Z4T3N06-LTLCardinality-04 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2023-03-20 12:08:59] [INFO ] Flatten gal took : 15 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 205417 ms.

BK_STOP 1679314140707

--------------------
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-COL-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-COL-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-167912700201027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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