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

About the Execution of LTSMin+red for UtilityControlRoom-COL-Z4T4N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
662.995 2423696.00 9582596.00 587.60 FFFTFTT?FT?TTTFT 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.r489-tall-167912707701083.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 ltsminxred
Input is UtilityControlRoom-COL-Z4T4N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912707701083
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 8.7K Feb 26 14:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 14:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 14:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 14:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 17:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 17:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 15:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 15:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 15:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 15:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 17:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:26 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-Z4T4N10-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679338425929

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z4T4N10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 18:53:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 18:53:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 18:53:47] [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 18:53:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-20 18:53:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 635 ms
[2023-03-20 18:53:48] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 376 PT places and 750.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2023-03-20 18:53:48] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 4 ms.
[2023-03-20 18:53:48] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-15 TRUE 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 84 ms. (steps per millisecond=119 ) properties (out of 30) seen :29
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 13 cols
[2023-03-20 18:53:48] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-20 18:53:48] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 18:53:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-20 18:53:48] [INFO ] After 31ms 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 1 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2023-03-20 18:53:48] [INFO ] Flatten gal took : 15 ms
[2023-03-20 18:53:48] [INFO ] Flatten gal took : 3 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(10), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2023-03-20 18:53:48] [INFO ] Unfolded HLPN to a Petri net with 376 places and 750 transitions 2410 arcs in 21 ms.
[2023-03-20 18:53:48] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 366 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Applied a total of 0 rules in 12 ms. Remains 376 /376 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 376 cols
[2023-03-20 18:53:48] [INFO ] Computed 23 place invariants in 30 ms
[2023-03-20 18:53:48] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-20 18:53:48] [INFO ] Invariant cache hit.
[2023-03-20 18:53:49] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2023-03-20 18:53:49] [INFO ] Invariant cache hit.
[2023-03-20 18:53:49] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 676 ms. Remains : 376/376 places, 590/590 transitions.
Support contains 366 out of 376 places after structural reductions.
[2023-03-20 18:53:49] [INFO ] Flatten gal took : 51 ms
[2023-03-20 18:53:49] [INFO ] Flatten gal took : 43 ms
[2023-03-20 18:53:49] [INFO ] Input system was already deterministic with 590 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 30) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-20 18:53:49] [INFO ] Invariant cache hit.
[2023-03-20 18:53:50] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 18:53:50] [INFO ] [Nat]Absence check using 23 positive place invariants in 16 ms returned sat
[2023-03-20 18:53:50] [INFO ] After 72ms 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.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(G(F(p0)))'
Support contains 20 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 376 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 216 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 216 transition count 350
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 176 transition count 350
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 443 place count 173 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 446 place count 173 transition count 230
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 476 place count 143 transition count 200
Iterating global reduction 2 with 30 rules applied. Total rules applied 506 place count 143 transition count 200
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 536 place count 113 transition count 140
Iterating global reduction 2 with 30 rules applied. Total rules applied 566 place count 113 transition count 140
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 596 place count 83 transition count 110
Iterating global reduction 2 with 30 rules applied. Total rules applied 626 place count 83 transition count 110
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 656 place count 83 transition count 80
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 677 place count 72 transition count 70
Applied a total of 677 rules in 55 ms. Remains 72 /376 variables (removed 304) and now considering 70/590 (removed 520) transitions.
// Phase 1: matrix 70 rows 72 cols
[2023-03-20 18:53:50] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-20 18:53:50] [INFO ] Implicit Places using invariants in 42 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/376 places, 70/590 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 61 transition count 60
Applied a total of 20 rules in 5 ms. Remains 61 /71 variables (removed 10) and now considering 60/70 (removed 10) transitions.
// Phase 1: matrix 60 rows 61 cols
[2023-03-20 18:53:50] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-20 18:53:50] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-20 18:53:50] [INFO ] Invariant cache hit.
[2023-03-20 18:53:50] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/376 places, 60/590 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 187 ms. Remains : 61/376 places, 60/590 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GT 3 (ADD s41 s42 s43 s44 s45 s46 s47 s48 s49 s50)) (GT 2 (ADD s30 s31 s32 s33 s34 s35 s36 s37 s38 s39)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5437 reset in 331 ms.
Stack based approach found an accepted trace after 14768 steps with 789 reset with depth 17 and stack size 17 in 38 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLCardinality-00 finished in 766 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)&&X(F(p1))))'
Support contains 15 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 15 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 256 cols
[2023-03-20 18:53:51] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-20 18:53:51] [INFO ] Implicit Places using invariants in 107 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/376 places, 470/590 transitions.
Applied a total of 0 rules in 3 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 127 ms. Remains : 255/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s205 s206 s207 s208 s209 s210 s211 s212 s213 s214) (ADD s0 s1 s2 s3)), p1:(OR (GT 2 s184) (LEQ (ADD s205 s206 s207 s208 s209 s210 s211 s212 s...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 263 ms.
Product exploration explored 100000 steps with 50000 reset in 308 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 5 factoid took 111 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLCardinality-03 finished in 959 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' '!(((p0 U G(p1))||X((F(G(p2))||G(p3)))))'
Support contains 55 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 15 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2023-03-20 18:53:52] [INFO ] Invariant cache hit.
[2023-03-20 18:53:52] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-20 18:53:52] [INFO ] Invariant cache hit.
[2023-03-20 18:53:52] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2023-03-20 18:53:52] [INFO ] Invariant cache hit.
[2023-03-20 18:53:52] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 256/376 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 458 ms. Remains : 256/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=p3, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=2 dest: 1}, { cond=(AND p0 p3), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0) p3), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) p3), acceptance={} source=3 dest: 1}, { cond=(AND p1 p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=p2, acceptance={0} source=4 dest: 4}, { cond=(NOT p2), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=5 dest: 5}, { cond=(AND p1 p0 (NOT p2)), acceptance={1} source=5 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ 2 (ADD s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 357 ms.
Product exploration explored 100000 steps with 0 reset in 475 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X p3), (X (NOT (AND p1 (NOT p0) p3))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (AND (NOT p1) (NOT p0) p3)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (AND (NOT p1) p3)), (X (NOT (AND p0 p3))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p1 p3))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0) p3))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p3)))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2))))]
Knowledge based reduction with 27 factoid took 1342 ms. Reduced automaton from 7 states, 25 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2)]
Finished random walk after 221 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=55 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X p3), (X (NOT (AND p1 (NOT p0) p3))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (AND (NOT p1) (NOT p0) p3)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (AND (NOT p1) p3)), (X (NOT (AND p0 p3))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p1 p3))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0) p3))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p3)))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (F (NOT p3)), (F (NOT p2))]
Knowledge based reduction with 27 factoid took 1256 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2)]
Support contains 54 out of 256 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Applied a total of 0 rules in 7 ms. Remains 256 /256 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2023-03-20 18:53:56] [INFO ] Invariant cache hit.
[2023-03-20 18:53:56] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-20 18:53:56] [INFO ] Invariant cache hit.
[2023-03-20 18:53:57] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-20 18:53:57] [INFO ] Invariant cache hit.
[2023-03-20 18:53:57] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 471 ms. Remains : 256/256 places, 470/470 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 p3 p2), (X p3), (X (X p2)), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 132 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2)]
Finished random walk after 122 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND p3 p2), (X p3), (X (X p2)), (X (X p3))]
False Knowledge obtained : [(F (NOT p3)), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 336 ms.
Product exploration explored 100000 steps with 0 reset in 412 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2)]
Support contains 54 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 0 with 50 rules applied. Total rules applied 50 place count 256 transition count 500
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 90 place count 256 transition count 460
Deduced a syphon composed of 50 places in 0 ms
Applied a total of 90 rules in 30 ms. Remains 256 /256 variables (removed 0) and now considering 460/470 (removed 10) transitions.
[2023-03-20 18:53:59] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 460 rows 256 cols
[2023-03-20 18:53:59] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-20 18:53:59] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 256/256 places, 460/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 234 ms. Remains : 256/256 places, 460/470 transitions.
Support contains 54 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Applied a total of 0 rules in 3 ms. Remains 256 /256 variables (removed 0) and now considering 470/470 (removed 0) transitions.
// Phase 1: matrix 470 rows 256 cols
[2023-03-20 18:53:59] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-20 18:53:59] [INFO ] Implicit Places using invariants in 100 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/256 places, 470/470 transitions.
Applied a total of 0 rules in 3 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109 ms. Remains : 255/256 places, 470/470 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLCardinality-04 finished in 7302 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' '!((p0 U X(X(((G(p2)&&X(p3))||p1)))))'
Support contains 140 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 6 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2023-03-20 18:53:59] [INFO ] Invariant cache hit.
[2023-03-20 18:53:59] [INFO ] Implicit Places using invariants in 95 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/376 places, 470/590 transitions.
Applied a total of 0 rules in 2 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 255/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 681 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p2), (AND p2 (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND p2 (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND p2 (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 7}, { cond=p0, acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=8 dest: 11}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=8 dest: 12}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=8 dest: 13}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=8 dest: 14}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=9 dest: 5}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=10 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=11 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=11 dest: 9}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=12 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=13 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=13 dest: 8}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=13 dest: 11}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=14 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=14 dest: 8}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=14 dest: 11}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=14 dest: 12}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=14 dest: 13}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={0} source=14 dest: 14}]], initial=0, aps=[p0:(LEQ (ADD s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 582 ms.
Product exploration explored 100000 steps with 33333 reset in 573 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1 (NOT p2) (NOT p3))
Knowledge based reduction with 8 factoid took 321 ms. Reduced automaton from 15 states, 37 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLCardinality-05 finished in 2290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 51 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 14 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2023-03-20 18:54:01] [INFO ] Invariant cache hit.
[2023-03-20 18:54:01] [INFO ] Implicit Places using invariants in 105 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 107 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/376 places, 470/590 transitions.
Applied a total of 0 rules in 3 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 255/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(GT 2 s184), p0:(AND (GT 3 (ADD s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 254 ms.
Product exploration explored 100000 steps with 50000 reset in 265 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 p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0)
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLCardinality-06 finished in 868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 14 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 376 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 216 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 216 transition count 350
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 176 transition count 350
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 480 place count 156 transition count 330
Applied a total of 480 rules in 34 ms. Remains 156 /376 variables (removed 220) and now considering 330/590 (removed 260) transitions.
// Phase 1: matrix 330 rows 156 cols
[2023-03-20 18:54:02] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-20 18:54:02] [INFO ] Implicit Places using invariants in 136 ms returned [94, 95]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 137 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/376 places, 330/590 transitions.
Applied a total of 0 rules in 5 ms. Remains 154 /154 variables (removed 0) and now considering 330/330 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 177 ms. Remains : 154/376 places, 330/590 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 1 (ADD s0 s1 s2 s3)) (LEQ 1 (ADD s94 s95 s96 s97 s98 s99 s100 s101 s102 s103)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1337 reset in 264 ms.
Product exploration explored 100000 steps with 1345 reset in 272 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Support contains 14 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 330/330 transitions.
Applied a total of 0 rules in 6 ms. Remains 154 /154 variables (removed 0) and now considering 330/330 (removed 0) transitions.
// Phase 1: matrix 330 rows 154 cols
[2023-03-20 18:54:03] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-20 18:54:04] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-20 18:54:04] [INFO ] Invariant cache hit.
[2023-03-20 18:54:04] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-20 18:54:04] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-20 18:54:04] [INFO ] Invariant cache hit.
[2023-03-20 18:54:04] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 321 ms. Remains : 154/154 places, 330/330 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 77 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=25 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1369 reset in 262 ms.
Product exploration explored 100000 steps with 1389 reset in 273 ms.
Support contains 14 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 330/330 transitions.
Applied a total of 0 rules in 5 ms. Remains 154 /154 variables (removed 0) and now considering 330/330 (removed 0) transitions.
[2023-03-20 18:54:05] [INFO ] Invariant cache hit.
[2023-03-20 18:54:05] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-20 18:54:05] [INFO ] Invariant cache hit.
[2023-03-20 18:54:05] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-20 18:54:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 18:54:05] [INFO ] Invariant cache hit.
[2023-03-20 18:54:05] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 334 ms. Remains : 154/154 places, 330/330 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLCardinality-07 finished in 3073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0 U X(p1))||(!p0 U X(G(p2)))))))'
Support contains 190 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Applied a total of 0 rules in 2 ms. Remains 376 /376 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 376 cols
[2023-03-20 18:54:05] [INFO ] Computed 23 place invariants in 10 ms
[2023-03-20 18:54:05] [INFO ] Implicit Places using invariants in 134 ms returned [305]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 136 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 375/376 places, 590/590 transitions.
Applied a total of 0 rules in 13 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 151 ms. Remains : 375/376 places, 590/590 transitions.
Stuttering acceptance computed with spot in 382 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 9}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p0:(GT (ADD s325 s326 s327 s328 s329 s330 s331 s332 s333 s334) (ADD s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 92 steps with 9 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLCardinality-08 finished in 558 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)||(X(p0)&&F(p1))))))'
Support contains 15 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 8 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 256 cols
[2023-03-20 18:54:06] [INFO ] Computed 23 place invariants in 8 ms
[2023-03-20 18:54:06] [INFO ] Implicit Places using invariants in 112 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/376 places, 470/590 transitions.
Applied a total of 0 rules in 2 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 255/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(GT 1 s184), p0:(GT (ADD s0 s1 s2 s3) (ADD s185 s186 s187 s188 s189 s190 s191 s192 s193 s194))], 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 7779 reset in 305 ms.
Product exploration explored 100000 steps with 7531 reset in 316 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 p1)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 207 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 470 rows 255 cols
[2023-03-20 18:54:07] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-20 18:54:07] [INFO ] [Real]Absence check using 22 positive place invariants in 7 ms returned sat
[2023-03-20 18:54:07] [INFO ] After 53ms 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 p1) p0), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1))))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 158 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLCardinality-09 finished in 1501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||(p0&&G(p1)))))))'
Support contains 45 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 260 place count 246 transition count 460
Applied a total of 260 rules in 35 ms. Remains 246 /376 variables (removed 130) and now considering 460/590 (removed 130) transitions.
// Phase 1: matrix 460 rows 246 cols
[2023-03-20 18:54:07] [INFO ] Computed 23 place invariants in 7 ms
[2023-03-20 18:54:07] [INFO ] Implicit Places using invariants in 108 ms returned [175]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 110 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 245/376 places, 460/590 transitions.
Applied a total of 0 rules in 7 ms. Remains 245 /245 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 153 ms. Remains : 245/376 places, 460/590 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(GT (ADD s0 s1 s2 s3) s174), p0:(GT (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 s78 s79 s80 s8...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 422 ms.
Product exploration explored 100000 steps with 0 reset in 480 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 384 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 32 steps, including 0 resets, run visited all 6 properties in 5 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 550 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 460 rows 245 cols
[2023-03-20 18:54:10] [INFO ] Computed 22 place invariants in 6 ms
[2023-03-20 18:54:10] [INFO ] [Real]Absence check using 22 positive place invariants in 11 ms returned sat
[2023-03-20 18:54:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 18:54:10] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2023-03-20 18:54:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 18:54:10] [INFO ] [Nat]Absence check using 22 positive place invariants in 9 ms returned sat
[2023-03-20 18:54:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 18:54:10] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2023-03-20 18:54:11] [INFO ] Computed and/alt/rep : 420/880/420 causal constraints (skipped 0 transitions) in 29 ms.
[2023-03-20 18:54:13] [INFO ] Added : 415 causal constraints over 83 iterations in 2466 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 45 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 460/460 transitions.
Applied a total of 0 rules in 10 ms. Remains 245 /245 variables (removed 0) and now considering 460/460 (removed 0) transitions.
[2023-03-20 18:54:13] [INFO ] Invariant cache hit.
[2023-03-20 18:54:13] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-20 18:54:13] [INFO ] Invariant cache hit.
[2023-03-20 18:54:13] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2023-03-20 18:54:13] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 18:54:13] [INFO ] Invariant cache hit.
[2023-03-20 18:54:13] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 486 ms. Remains : 245/245 places, 460/460 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 321 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 32 steps, including 0 resets, run visited all 6 properties in 4 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 453 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 350 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
[2023-03-20 18:54:15] [INFO ] Invariant cache hit.
[2023-03-20 18:54:15] [INFO ] [Real]Absence check using 22 positive place invariants in 8 ms returned sat
[2023-03-20 18:54:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 18:54:15] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2023-03-20 18:54:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 18:54:15] [INFO ] [Nat]Absence check using 22 positive place invariants in 20 ms returned sat
[2023-03-20 18:54:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 18:54:16] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2023-03-20 18:54:16] [INFO ] Computed and/alt/rep : 420/880/420 causal constraints (skipped 0 transitions) in 25 ms.
[2023-03-20 18:54:18] [INFO ] Added : 403 causal constraints over 81 iterations in 2442 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 476 ms.
Product exploration explored 100000 steps with 0 reset in 508 ms.
Support contains 45 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 460/460 transitions.
Applied a total of 0 rules in 6 ms. Remains 245 /245 variables (removed 0) and now considering 460/460 (removed 0) transitions.
[2023-03-20 18:54:19] [INFO ] Invariant cache hit.
[2023-03-20 18:54:19] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-20 18:54:19] [INFO ] Invariant cache hit.
[2023-03-20 18:54:19] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-20 18:54:19] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 18:54:19] [INFO ] Invariant cache hit.
[2023-03-20 18:54:20] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 465 ms. Remains : 245/245 places, 460/460 transitions.
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLCardinality-10 finished in 12368 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((X((p2 U p3))||p1)))))'
Support contains 142 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 4 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 256 cols
[2023-03-20 18:54:20] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-20 18:54:20] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-20 18:54:20] [INFO ] Invariant cache hit.
[2023-03-20 18:54:20] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-20 18:54:20] [INFO ] Invariant cache hit.
[2023-03-20 18:54:20] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 256/376 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 384 ms. Remains : 256/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (LEQ s185 (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 s78 s79 s80 s81 s82 s83 s84 s85 s86 ...], 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 458 ms.
Product exploration explored 100000 steps with 50000 reset in 464 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p3) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 7 factoid took 155 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLCardinality-11 finished in 1668 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&&X(p1))))'
Support contains 90 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 6 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2023-03-20 18:54:21] [INFO ] Invariant cache hit.
[2023-03-20 18:54:21] [INFO ] Implicit Places using invariants in 106 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/376 places, 470/590 transitions.
Applied a total of 0 rules in 1 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116 ms. Remains : 255/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s185 s186 s187 s188 s189 s190 s191 s192 s193 s194) (ADD s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 382 ms.
Product exploration explored 100000 steps with 50000 reset in 388 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 7 factoid took 192 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLCardinality-12 finished in 1173 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)||G(p1)))'
Support contains 201 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 376 transition count 550
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 336 transition count 550
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 100 place count 326 transition count 540
Applied a total of 100 rules in 19 ms. Remains 326 /376 variables (removed 50) and now considering 540/590 (removed 50) transitions.
// Phase 1: matrix 540 rows 326 cols
[2023-03-20 18:54:23] [INFO ] Computed 23 place invariants in 10 ms
[2023-03-20 18:54:23] [INFO ] Implicit Places using invariants in 154 ms returned [264]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 156 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 325/376 places, 540/590 transitions.
Applied a total of 0 rules in 5 ms. Remains 325 /325 variables (removed 0) and now considering 540/540 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 180 ms. Remains : 325/376 places, 540/590 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GT s264 (ADD s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 50000 reset in 576 ms.
Product exploration explored 100000 steps with 50000 reset in 584 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLCardinality-13 finished in 1598 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' '!(((p0 U G(p1))||X((F(G(p2))||G(p3)))))'
Found a Lengthening insensitive property : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-04
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Support contains 55 out of 376 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 376 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 216 transition count 390
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 380 place count 206 transition count 380
Applied a total of 380 rules in 20 ms. Remains 206 /376 variables (removed 170) and now considering 380/590 (removed 210) transitions.
// Phase 1: matrix 380 rows 206 cols
[2023-03-20 18:54:24] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-20 18:54:25] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-20 18:54:25] [INFO ] Invariant cache hit.
[2023-03-20 18:54:25] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2023-03-20 18:54:25] [INFO ] Invariant cache hit.
[2023-03-20 18:54:25] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 206/376 places, 380/590 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 385 ms. Remains : 206/376 places, 380/590 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=p3, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=2 dest: 1}, { cond=(AND p0 p3), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0) p3), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) p3), acceptance={} source=3 dest: 1}, { cond=(AND p1 p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=p2, acceptance={0} source=4 dest: 4}, { cond=(NOT p2), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=5 dest: 5}, { cond=(AND p1 p0 (NOT p2)), acceptance={1} source=5 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ 2 (ADD s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 349 ms.
Stack based approach found an accepted trace after 82826 steps with 0 reset with depth 82827 and stack size 70303 in 333 ms.
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLCardinality-04 finished in 1451 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-04 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||(p0&&G(p1)))))))'
[2023-03-20 18:54:26] [INFO ] Flatten gal took : 35 ms
[2023-03-20 18:54:26] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-20 18:54:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 376 places, 590 transitions and 1770 arcs took 4 ms.
Total runtime 38896 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1738/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1190 seconds
MemTotal: 16393216 kB
MemFree: 16033128 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16085024 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1738/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1738/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1190 seconds
MemTotal: 16393216 kB
MemFree: 16021824 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16072500 kB
Could not compute solution for formula : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-04
Could not compute solution for formula : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-07
Could not compute solution for formula : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-10

BK_STOP 1679340849625

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

+ 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//../reducer/bin//../../itstools//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//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name UtilityControlRoom-COL-Z4T4N10-LTLCardinality-04
ltl formula formula --ltl=/tmp/1738/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 376 places, 590 transitions and 1770 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1738/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1738/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1738/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1738/ltl_0_
Killing (15) : 1744 1745 1746 1747 1748
Killing (9) : 1744 1745 1746 1747 1748
ltl formula name UtilityControlRoom-COL-Z4T4N10-LTLCardinality-07
ltl formula formula --ltl=/tmp/1738/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 376 places, 590 transitions and 1770 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1738/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1738/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1738/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1738/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name UtilityControlRoom-COL-Z4T4N10-LTLCardinality-10
ltl formula formula --ltl=/tmp/1738/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 376 places, 590 transitions and 1770 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1738/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1738/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1738/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1738/ltl_2_
Killing (15) : 1833 1834 1835 1836 1837
Killing (9) : 1833 1834 1835 1836 1837

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-Z4T4N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is UtilityControlRoom-COL-Z4T4N10, 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 r489-tall-167912707701083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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