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

About the Execution of LTSMin+red for CANConstruction-PT-005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
334.031 10311.00 21678.00 130.70 FFTFFFFFFFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694900612.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CANConstruction-PT-005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694900612
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 11K Feb 25 21:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 21:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 21:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 21:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 25 21:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 25 21:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 21:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 25 21:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 167K Mar 5 18:22 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 CANConstruction-PT-005-LTLFireability-00
FORMULA_NAME CANConstruction-PT-005-LTLFireability-01
FORMULA_NAME CANConstruction-PT-005-LTLFireability-02
FORMULA_NAME CANConstruction-PT-005-LTLFireability-03
FORMULA_NAME CANConstruction-PT-005-LTLFireability-04
FORMULA_NAME CANConstruction-PT-005-LTLFireability-05
FORMULA_NAME CANConstruction-PT-005-LTLFireability-06
FORMULA_NAME CANConstruction-PT-005-LTLFireability-07
FORMULA_NAME CANConstruction-PT-005-LTLFireability-08
FORMULA_NAME CANConstruction-PT-005-LTLFireability-09
FORMULA_NAME CANConstruction-PT-005-LTLFireability-10
FORMULA_NAME CANConstruction-PT-005-LTLFireability-11
FORMULA_NAME CANConstruction-PT-005-LTLFireability-12
FORMULA_NAME CANConstruction-PT-005-LTLFireability-13
FORMULA_NAME CANConstruction-PT-005-LTLFireability-14
FORMULA_NAME CANConstruction-PT-005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678650676678

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-005
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 19:51:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 19:51:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 19:51:18] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2023-03-12 19:51:18] [INFO ] Transformed 112 places.
[2023-03-12 19:51:18] [INFO ] Transformed 140 transitions.
[2023-03-12 19:51:18] [INFO ] Parsed PT model containing 112 places and 140 transitions and 400 arcs in 104 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANConstruction-PT-005-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 140/140 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 100 transition count 116
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 100 transition count 116
Applied a total of 24 rules in 29 ms. Remains 100 /112 variables (removed 12) and now considering 116/140 (removed 24) transitions.
// Phase 1: matrix 116 rows 100 cols
[2023-03-12 19:51:18] [INFO ] Computed 11 place invariants in 10 ms
[2023-03-12 19:51:18] [INFO ] Implicit Places using invariants in 159 ms returned [12, 26, 40, 54]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 186 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 96/112 places, 116/140 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 92 transition count 112
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 92 transition count 112
Applied a total of 8 rules in 6 ms. Remains 92 /96 variables (removed 4) and now considering 112/116 (removed 4) transitions.
// Phase 1: matrix 112 rows 92 cols
[2023-03-12 19:51:18] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-12 19:51:19] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-12 19:51:19] [INFO ] Invariant cache hit.
[2023-03-12 19:51:19] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-12 19:51:19] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 92/112 places, 112/140 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 375 ms. Remains : 92/112 places, 112/140 transitions.
Support contains 27 out of 92 places after structural reductions.
[2023-03-12 19:51:19] [INFO ] Flatten gal took : 25 ms
[2023-03-12 19:51:19] [INFO ] Flatten gal took : 10 ms
[2023-03-12 19:51:19] [INFO ] Input system was already deterministic with 112 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 22) seen :21
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 19:51:19] [INFO ] Invariant cache hit.
[2023-03-12 19:51:19] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-12 19:51:19] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 19:51:19] [INFO ] After 84ms 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.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA CANConstruction-PT-005-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 17 stabilizing places and 21 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' '!(F((F(G(p1))&&p0)))'
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 112/112 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 92 transition count 81
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 61 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 60 transition count 80
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 64 place count 60 transition count 76
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 72 place count 56 transition count 76
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 75 place count 53 transition count 70
Iterating global reduction 3 with 3 rules applied. Total rules applied 78 place count 53 transition count 70
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 80 place count 53 transition count 68
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 82 place count 51 transition count 68
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 90 place count 47 transition count 64
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 100 place count 42 transition count 74
Applied a total of 100 rules in 40 ms. Remains 42 /92 variables (removed 50) and now considering 74/112 (removed 38) transitions.
// Phase 1: matrix 74 rows 42 cols
[2023-03-12 19:51:19] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 19:51:20] [INFO ] Implicit Places using invariants in 90 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/92 places, 74/112 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 39 transition count 72
Applied a total of 4 rules in 20 ms. Remains 39 /41 variables (removed 2) and now considering 72/74 (removed 2) transitions.
// Phase 1: matrix 72 rows 39 cols
[2023-03-12 19:51:20] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-12 19:51:20] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-12 19:51:20] [INFO ] Invariant cache hit.
[2023-03-12 19:51:20] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-12 19:51:20] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/92 places, 72/112 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 360 ms. Remains : 39/92 places, 72/112 transitions.
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s24 1)), p1:(LT s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 53 steps with 1 reset in 2 ms.
FORMULA CANConstruction-PT-005-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-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' '!(X((F(p0)&&!(X(!p0) U p1)&&!p1)))'
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 112/112 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 89 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 89 transition count 106
Applied a total of 6 rules in 10 ms. Remains 89 /92 variables (removed 3) and now considering 106/112 (removed 6) transitions.
// Phase 1: matrix 106 rows 89 cols
[2023-03-12 19:51:20] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 19:51:20] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-12 19:51:20] [INFO ] Invariant cache hit.
[2023-03-12 19:51:20] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-12 19:51:20] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-12 19:51:20] [INFO ] Invariant cache hit.
[2023-03-12 19:51:21] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/92 places, 106/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 409 ms. Remains : 89/92 places, 106/112 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 (NOT p0))]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s60 1) (GEQ s62 1)), p0:(OR (LT s11 1) (LT s54 1))], 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 33333 reset in 338 ms.
Product exploration explored 100000 steps with 33333 reset in 158 ms.
Computed a total of 17 stabilizing places and 21 stable transitions
Computed a total of 17 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0)
Knowledge based reduction with 7 factoid took 285 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-005-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-005-LTLFireability-02 finished in 1427 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(G(p0))&&F(p1))))'
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 112/112 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 92 transition count 81
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 61 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 60 transition count 80
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 64 place count 60 transition count 76
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 72 place count 56 transition count 76
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 75 place count 53 transition count 70
Iterating global reduction 3 with 3 rules applied. Total rules applied 78 place count 53 transition count 70
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 80 place count 53 transition count 68
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 82 place count 51 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 84 place count 50 transition count 67
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 94 place count 45 transition count 77
Applied a total of 94 rules in 13 ms. Remains 45 /92 variables (removed 47) and now considering 77/112 (removed 35) transitions.
// Phase 1: matrix 77 rows 45 cols
[2023-03-12 19:51:22] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-12 19:51:22] [INFO ] Implicit Places using invariants in 39 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/92 places, 77/112 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 43 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 43 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 42 transition count 75
Applied a total of 4 rules in 5 ms. Remains 42 /44 variables (removed 2) and now considering 75/77 (removed 2) transitions.
// Phase 1: matrix 75 rows 42 cols
[2023-03-12 19:51:22] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 19:51:22] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-12 19:51:22] [INFO ] Invariant cache hit.
[2023-03-12 19:51:22] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-12 19:51:22] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 42/92 places, 75/112 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 198 ms. Remains : 42/92 places, 75/112 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s20 1) (LT s33 1)), p1:(OR (LT s0 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6872 reset in 259 ms.
Stack based approach found an accepted trace after 46 steps with 3 reset with depth 9 and stack size 9 in 1 ms.
FORMULA CANConstruction-PT-005-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-03 finished in 620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||X(p1)))))'
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 112/112 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 92 transition count 81
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 61 transition count 81
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 62 place count 61 transition count 77
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 70 place count 57 transition count 77
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 54 transition count 71
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 54 transition count 71
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 78 place count 54 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 80 place count 52 transition count 69
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 88 place count 48 transition count 65
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 98 place count 43 transition count 75
Applied a total of 98 rules in 21 ms. Remains 43 /92 variables (removed 49) and now considering 75/112 (removed 37) transitions.
// Phase 1: matrix 75 rows 43 cols
[2023-03-12 19:51:22] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 19:51:22] [INFO ] Implicit Places using invariants in 64 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/92 places, 75/112 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 41 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 41 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 40 transition count 73
Applied a total of 4 rules in 6 ms. Remains 40 /42 variables (removed 2) and now considering 73/75 (removed 2) transitions.
// Phase 1: matrix 73 rows 40 cols
[2023-03-12 19:51:22] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-12 19:51:22] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-12 19:51:22] [INFO ] Invariant cache hit.
[2023-03-12 19:51:22] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-12 19:51:22] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/92 places, 73/112 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 276 ms. Remains : 40/92 places, 73/112 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s5 1) (GEQ s8 1)), p0:(AND (GEQ s18 1) (GEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-005-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-04 finished in 409 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 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 112/112 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 92 transition count 79
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 59 transition count 79
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 66 place count 59 transition count 75
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 74 place count 55 transition count 75
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 53 transition count 71
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 53 transition count 71
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 53 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 52 transition count 70
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 92 place count 46 transition count 64
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 102 place count 41 transition count 73
Applied a total of 102 rules in 39 ms. Remains 41 /92 variables (removed 51) and now considering 73/112 (removed 39) transitions.
// Phase 1: matrix 73 rows 41 cols
[2023-03-12 19:51:23] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 19:51:23] [INFO ] Implicit Places using invariants in 81 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/92 places, 73/112 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 38 transition count 71
Applied a total of 4 rules in 3 ms. Remains 38 /40 variables (removed 2) and now considering 71/73 (removed 2) transitions.
// Phase 1: matrix 71 rows 38 cols
[2023-03-12 19:51:23] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-12 19:51:23] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-12 19:51:23] [INFO ] Invariant cache hit.
[2023-03-12 19:51:23] [INFO ] State equation strengthened by 64 read => feed constraints.
[2023-03-12 19:51:23] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/92 places, 71/112 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 236 ms. Remains : 38/92 places, 71/112 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-05 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:(LT s23 1)], 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 4773 reset in 163 ms.
Stack based approach found an accepted trace after 696 steps with 33 reset with depth 13 and stack size 12 in 2 ms.
FORMULA CANConstruction-PT-005-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-05 finished in 509 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||G(!p1)) U p2))'
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 112/112 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 92 transition count 82
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 62 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 61 transition count 81
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 62 place count 61 transition count 77
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 70 place count 57 transition count 77
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 73 place count 54 transition count 71
Iterating global reduction 3 with 3 rules applied. Total rules applied 76 place count 54 transition count 71
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 54 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 80 place count 52 transition count 69
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 88 place count 48 transition count 65
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 98 place count 43 transition count 75
Applied a total of 98 rules in 12 ms. Remains 43 /92 variables (removed 49) and now considering 75/112 (removed 37) transitions.
// Phase 1: matrix 75 rows 43 cols
[2023-03-12 19:51:23] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 19:51:23] [INFO ] Implicit Places using invariants in 41 ms returned [20]
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 : 42/92 places, 75/112 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 40 transition count 73
Applied a total of 4 rules in 3 ms. Remains 40 /42 variables (removed 2) and now considering 73/75 (removed 2) transitions.
// Phase 1: matrix 73 rows 40 cols
[2023-03-12 19:51:23] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-12 19:51:23] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-12 19:51:23] [INFO ] Invariant cache hit.
[2023-03-12 19:51:23] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-12 19:51:23] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/92 places, 73/112 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 153 ms. Remains : 40/92 places, 73/112 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p2), true, p1]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s17 1), p0:(AND (GEQ s4 1) (GEQ s12 1)), p1:(AND (GEQ s4 1) (GEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 72 steps with 3 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-06 finished in 283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 112/112 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 89 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 89 transition count 106
Applied a total of 6 rules in 2 ms. Remains 89 /92 variables (removed 3) and now considering 106/112 (removed 6) transitions.
// Phase 1: matrix 106 rows 89 cols
[2023-03-12 19:51:23] [INFO ] Computed 7 place invariants in 13 ms
[2023-03-12 19:51:23] [INFO ] Implicit Places using invariants in 93 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/92 places, 106/112 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 105
Applied a total of 2 rules in 2 ms. Remains 87 /88 variables (removed 1) and now considering 105/106 (removed 1) transitions.
// Phase 1: matrix 105 rows 87 cols
[2023-03-12 19:51:23] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 19:51:23] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-12 19:51:23] [INFO ] Invariant cache hit.
[2023-03-12 19:51:24] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-12 19:51:24] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 87/92 places, 105/112 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 247 ms. Remains : 87/92 places, 105/112 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 94 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-07 finished in 373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(X(p0))&&G(p1))))))'
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 112/112 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 89 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 89 transition count 106
Applied a total of 6 rules in 2 ms. Remains 89 /92 variables (removed 3) and now considering 106/112 (removed 6) transitions.
// Phase 1: matrix 106 rows 89 cols
[2023-03-12 19:51:24] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 19:51:24] [INFO ] Implicit Places using invariants in 63 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/92 places, 106/112 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 105
Applied a total of 2 rules in 2 ms. Remains 87 /88 variables (removed 1) and now considering 105/106 (removed 1) transitions.
// Phase 1: matrix 105 rows 87 cols
[2023-03-12 19:51:24] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 19:51:24] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-12 19:51:24] [INFO ] Invariant cache hit.
[2023-03-12 19:51:24] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-12 19:51:24] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 87/92 places, 105/112 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 240 ms. Remains : 87/92 places, 105/112 transitions.
Stuttering acceptance computed with spot in 463 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 5}, { cond=p1, acceptance={0} source=3 dest: 6}, { cond=p1, acceptance={} source=3 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0} source=6 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s23 1)), p0:(AND (GEQ s42 1) (GEQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 94 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-08 finished in 730 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)))'
Support contains 2 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 112/112 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 89 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 89 transition count 106
Applied a total of 6 rules in 2 ms. Remains 89 /92 variables (removed 3) and now considering 106/112 (removed 6) transitions.
// Phase 1: matrix 106 rows 89 cols
[2023-03-12 19:51:24] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 19:51:25] [INFO ] Implicit Places using invariants in 53 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/92 places, 106/112 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 105
Applied a total of 2 rules in 1 ms. Remains 87 /88 variables (removed 1) and now considering 105/106 (removed 1) transitions.
// Phase 1: matrix 105 rows 87 cols
[2023-03-12 19:51:25] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-12 19:51:25] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-12 19:51:25] [INFO ] Invariant cache hit.
[2023-03-12 19:51:25] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-12 19:51:25] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 87/92 places, 105/112 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 247 ms. Remains : 87/92 places, 105/112 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s18 1) (GEQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 217 steps with 2 reset in 1 ms.
FORMULA CANConstruction-PT-005-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-10 finished in 328 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 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 112/112 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 92 transition count 81
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 61 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 60 transition count 80
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 64 place count 60 transition count 76
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 72 place count 56 transition count 76
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 75 place count 53 transition count 70
Iterating global reduction 3 with 3 rules applied. Total rules applied 78 place count 53 transition count 70
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 80 place count 53 transition count 68
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 82 place count 51 transition count 68
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 90 place count 47 transition count 64
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 100 place count 42 transition count 74
Applied a total of 100 rules in 9 ms. Remains 42 /92 variables (removed 50) and now considering 74/112 (removed 38) transitions.
// Phase 1: matrix 74 rows 42 cols
[2023-03-12 19:51:25] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-12 19:51:25] [INFO ] Implicit Places using invariants in 34 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/92 places, 74/112 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 39 transition count 72
Applied a total of 4 rules in 3 ms. Remains 39 /41 variables (removed 2) and now considering 72/74 (removed 2) transitions.
// Phase 1: matrix 72 rows 39 cols
[2023-03-12 19:51:25] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 19:51:25] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-12 19:51:25] [INFO ] Invariant cache hit.
[2023-03-12 19:51:25] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-12 19:51:25] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/92 places, 72/112 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 186 ms. Remains : 39/92 places, 72/112 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-12 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:(LT s17 1)], 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 5862 reset in 110 ms.
Stack based approach found an accepted trace after 147 steps with 9 reset with depth 9 and stack size 9 in 0 ms.
FORMULA CANConstruction-PT-005-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-12 finished in 392 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(X(G(p1)))))'
Support contains 2 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 112/112 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 110
Applied a total of 2 rules in 2 ms. Remains 91 /92 variables (removed 1) and now considering 110/112 (removed 2) transitions.
// Phase 1: matrix 110 rows 91 cols
[2023-03-12 19:51:25] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 19:51:25] [INFO ] Implicit Places using invariants in 66 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/92 places, 110/112 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 89 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 109
Applied a total of 2 rules in 1 ms. Remains 89 /90 variables (removed 1) and now considering 109/110 (removed 1) transitions.
// Phase 1: matrix 109 rows 89 cols
[2023-03-12 19:51:25] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 19:51:25] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-12 19:51:25] [INFO ] Invariant cache hit.
[2023-03-12 19:51:25] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-12 19:51:25] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 89/92 places, 109/112 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 242 ms. Remains : 89/92 places, 109/112 transitions.
Stuttering acceptance computed with spot in 325 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 2}]], initial=4, aps=[p1:(GEQ s67 1), p0:(GEQ s65 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-13 finished in 581 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 U (p1||X(p2)))))'
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 112/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 90 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 90 transition count 108
Applied a total of 4 rules in 1 ms. Remains 90 /92 variables (removed 2) and now considering 108/112 (removed 4) transitions.
// Phase 1: matrix 108 rows 90 cols
[2023-03-12 19:51:26] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 19:51:26] [INFO ] Implicit Places using invariants in 112 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 114 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/92 places, 108/112 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 88 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 107
Applied a total of 2 rules in 4 ms. Remains 88 /89 variables (removed 1) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 88 cols
[2023-03-12 19:51:26] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 19:51:26] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-12 19:51:26] [INFO ] Invariant cache hit.
[2023-03-12 19:51:26] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-12 19:51:26] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/92 places, 107/112 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 307 ms. Remains : 88/92 places, 107/112 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LT s73 1), p0:(GEQ s10 1), p2:(OR (AND (GEQ s35 1) (GEQ s54 1)) (GEQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 217 steps with 3 reset in 1 ms.
FORMULA CANConstruction-PT-005-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-14 finished in 464 ms.
All properties solved by simple procedures.
Total runtime 8202 ms.
ITS solved all properties within timeout

BK_STOP 1678650686989

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="CANConstruction-PT-005"
export BK_EXAMINATION="LTLFireability"
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 CANConstruction-PT-005, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694900612"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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