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.r263-smll-167863538200387.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 lolaxred
Input is ParamProductionCell-PT-3, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538200387
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 8.0K Feb 26 17:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 17:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 17:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 174K 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 ParamProductionCell-PT-3-LTLCardinality-00
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-01
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-02
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-03
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-04
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-05
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-06
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-07
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-08
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-09
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678780920113

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-3
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 08:02:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 08:02:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 08:02:02] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2023-03-14 08:02:02] [INFO ] Transformed 231 places.
[2023-03-14 08:02:02] [INFO ] Transformed 202 transitions.
[2023-03-14 08:02:02] [INFO ] Found NUPN structural information;
[2023-03-14 08:02:02] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ParamProductionCell-PT-3-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 226 transition count 197
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 226 transition count 197
Applied a total of 10 rules in 56 ms. Remains 226 /231 variables (removed 5) and now considering 197/202 (removed 5) transitions.
// Phase 1: matrix 197 rows 226 cols
[2023-03-14 08:02:02] [INFO ] Computed 59 place invariants in 18 ms
[2023-03-14 08:02:03] [INFO ] Implicit Places using invariants in 606 ms returned [15, 16, 18, 19, 24, 31, 36, 41, 42, 46, 59, 64, 65, 78, 79, 98, 99, 101, 113, 114, 116, 118, 119, 159, 160, 162, 164, 192, 195, 201, 206, 217]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 660 ms to find 32 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/231 places, 197/202 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 196
Applied a total of 2 rules in 24 ms. Remains 193 /194 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 193 cols
[2023-03-14 08:02:03] [INFO ] Computed 27 place invariants in 6 ms
[2023-03-14 08:02:03] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-14 08:02:03] [INFO ] Invariant cache hit.
[2023-03-14 08:02:03] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:02:04] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 193/231 places, 196/202 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1322 ms. Remains : 193/231 places, 196/202 transitions.
Support contains 25 out of 193 places after structural reductions.
[2023-03-14 08:02:04] [INFO ] Flatten gal took : 56 ms
[2023-03-14 08:02:04] [INFO ] Flatten gal took : 23 ms
[2023-03-14 08:02:04] [INFO ] Input system was already deterministic with 196 transitions.
Support contains 22 out of 193 places (down from 25) after GAL structural reductions.
Finished random walk after 220 steps, including 0 resets, run visited all 14 properties in 52 ms. (steps per millisecond=4 )
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' '!(F(G(p0)))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 196/196 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 193 transition count 172
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 169 transition count 172
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 48 place count 169 transition count 157
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 78 place count 154 transition count 157
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 152 transition count 155
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 152 transition count 155
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 180 place count 103 transition count 106
Applied a total of 180 rules in 47 ms. Remains 103 /193 variables (removed 90) and now considering 106/196 (removed 90) transitions.
// Phase 1: matrix 106 rows 103 cols
[2023-03-14 08:02:04] [INFO ] Computed 27 place invariants in 4 ms
[2023-03-14 08:02:04] [INFO ] Implicit Places using invariants in 120 ms returned [17, 22, 70, 85, 88, 93]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 123 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/193 places, 106/196 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 90 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 89 transition count 98
Applied a total of 16 rules in 12 ms. Remains 89 /97 variables (removed 8) and now considering 98/106 (removed 8) transitions.
// Phase 1: matrix 98 rows 89 cols
[2023-03-14 08:02:04] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 08:02:05] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-14 08:02:05] [INFO ] Invariant cache hit.
[2023-03-14 08:02:05] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:02:05] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/193 places, 98/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 495 ms. Remains : 89/193 places, 98/196 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s72 0) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 397 ms.
Stack based approach found an accepted trace after 945 steps with 0 reset with depth 946 and stack size 754 in 14 ms.
FORMULA ParamProductionCell-PT-3-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLCardinality-02 finished in 1142 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 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 196/196 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 193 transition count 172
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 169 transition count 172
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 48 place count 169 transition count 155
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 82 place count 152 transition count 155
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 150 transition count 153
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 150 transition count 153
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 184 place count 101 transition count 104
Applied a total of 184 rules in 28 ms. Remains 101 /193 variables (removed 92) and now considering 104/196 (removed 92) transitions.
// Phase 1: matrix 104 rows 101 cols
[2023-03-14 08:02:05] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-14 08:02:06] [INFO ] Implicit Places using invariants in 126 ms returned [17, 22, 34, 69, 82, 85, 90]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 127 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/193 places, 104/196 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 87 transition count 97
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 16 place count 86 transition count 96
Applied a total of 16 rules in 9 ms. Remains 86 /94 variables (removed 8) and now considering 96/104 (removed 8) transitions.
// Phase 1: matrix 96 rows 86 cols
[2023-03-14 08:02:06] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-14 08:02:06] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-14 08:02:06] [INFO ] Invariant cache hit.
[2023-03-14 08:02:06] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:02:06] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/193 places, 96/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 466 ms. Remains : 86/193 places, 96/196 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-03 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:(AND (EQ s33 0) (EQ s79 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 1692 reset in 214 ms.
Product exploration explored 100000 steps with 1690 reset in 255 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 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)]
Finished random walk after 54 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=18 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 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)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2023-03-14 08:02:07] [INFO ] Invariant cache hit.
[2023-03-14 08:02:07] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-14 08:02:07] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-14 08:02:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:02:07] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-14 08:02:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:02:07] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2023-03-14 08:02:07] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-14 08:02:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:02:07] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-14 08:02:07] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:02:07] [INFO ] [Nat]Added 67 Read/Feed constraints in 23 ms returned sat
[2023-03-14 08:02:07] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 4 ms to minimize.
[2023-03-14 08:02:07] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2023-03-14 08:02:07] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2023-03-14 08:02:08] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 2 ms to minimize.
[2023-03-14 08:02:08] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
[2023-03-14 08:02:08] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2023-03-14 08:02:08] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2023-03-14 08:02:08] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2023-03-14 08:02:08] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 463 ms
[2023-03-14 08:02:08] [INFO ] Computed and/alt/rep : 94/218/94 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-14 08:02:08] [INFO ] Added : 91 causal constraints over 19 iterations in 264 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 96/96 transitions.
Applied a total of 0 rules in 6 ms. Remains 86 /86 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2023-03-14 08:02:08] [INFO ] Invariant cache hit.
[2023-03-14 08:02:08] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-14 08:02:08] [INFO ] Invariant cache hit.
[2023-03-14 08:02:08] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:02:08] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2023-03-14 08:02:08] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-14 08:02:08] [INFO ] Invariant cache hit.
[2023-03-14 08:02:08] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 373 ms. Remains : 86/86 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 193 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 74 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=24 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2023-03-14 08:02:09] [INFO ] Invariant cache hit.
[2023-03-14 08:02:09] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2023-03-14 08:02:09] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-14 08:02:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:02:09] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-14 08:02:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:02:09] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-14 08:02:09] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-14 08:02:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:02:09] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-14 08:02:09] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:02:09] [INFO ] [Nat]Added 67 Read/Feed constraints in 16 ms returned sat
[2023-03-14 08:02:09] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2023-03-14 08:02:09] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-14 08:02:09] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2023-03-14 08:02:09] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2023-03-14 08:02:09] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2023-03-14 08:02:10] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-14 08:02:10] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2023-03-14 08:02:10] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2023-03-14 08:02:10] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 380 ms
[2023-03-14 08:02:10] [INFO ] Computed and/alt/rep : 94/218/94 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-14 08:02:10] [INFO ] Added : 91 causal constraints over 19 iterations in 220 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1701 reset in 153 ms.
Product exploration explored 100000 steps with 1696 reset in 221 ms.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2023-03-14 08:02:10] [INFO ] Invariant cache hit.
[2023-03-14 08:02:10] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-14 08:02:10] [INFO ] Invariant cache hit.
[2023-03-14 08:02:10] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:02:11] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-03-14 08:02:11] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-14 08:02:11] [INFO ] Invariant cache hit.
[2023-03-14 08:02:11] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 390 ms. Remains : 86/86 places, 96/96 transitions.
Treatment of property ParamProductionCell-PT-3-LTLCardinality-03 finished in 5361 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(p0))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 191 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 194
Applied a total of 4 rules in 6 ms. Remains 191 /193 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 191 cols
[2023-03-14 08:02:11] [INFO ] Computed 27 place invariants in 3 ms
[2023-03-14 08:02:11] [INFO ] Implicit Places using invariants in 144 ms returned [29, 37, 60, 137, 164, 169]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 148 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/193 places, 194/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 157 ms. Remains : 185/193 places, 194/196 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s157 0) (NEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 340 ms.
Product exploration explored 100000 steps with 50000 reset in 342 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), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-3-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-3-LTLCardinality-04 finished in 1019 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(X((X(G(p1))||p0)))))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 191 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 194
Applied a total of 4 rules in 5 ms. Remains 191 /193 variables (removed 2) and now considering 194/196 (removed 2) transitions.
[2023-03-14 08:02:12] [INFO ] Invariant cache hit.
[2023-03-14 08:02:12] [INFO ] Implicit Places using invariants in 133 ms returned [29, 37, 60, 161, 164, 169]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 142 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/193 places, 194/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 152 ms. Remains : 185/193 places, 194/196 transitions.
Stuttering acceptance computed with spot in 198 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(OR (EQ s144 0) (EQ s134 1)), p1:(OR (EQ s144 0) (EQ s134 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 186 ms.
Product exploration explored 100000 steps with 25000 reset in 200 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 214 steps, including 0 resets, run visited all 2 properties in 26 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 184 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-14 08:02:13] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 08:02:13] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-14 08:02:13] [INFO ] Invariant cache hit.
[2023-03-14 08:02:14] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:02:14] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2023-03-14 08:02:14] [INFO ] Invariant cache hit.
[2023-03-14 08:02:14] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 645 ms. Remains : 185/185 places, 194/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 223 steps, including 0 resets, run visited all 2 properties in 11 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 177 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 184 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 196 ms.
Product exploration explored 100000 steps with 25000 reset in 212 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 182 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 185 transition count 194
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 37 place count 185 transition count 196
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 50 place count 185 transition count 196
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 178 transition count 188
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 178 transition count 188
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 108 place count 178 transition count 188
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 135 place count 151 transition count 161
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 162 place count 151 transition count 161
Deduced a syphon composed of 60 places in 1 ms
Applied a total of 162 rules in 31 ms. Remains 151 /185 variables (removed 34) and now considering 161/194 (removed 33) transitions.
[2023-03-14 08:02:16] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 161 rows 151 cols
[2023-03-14 08:02:16] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 08:02:16] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/185 places, 161/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 151/185 places, 161/194 transitions.
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-14 08:02:16] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 08:02:16] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-14 08:02:16] [INFO ] Invariant cache hit.
[2023-03-14 08:02:16] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:02:17] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2023-03-14 08:02:17] [INFO ] Invariant cache hit.
[2023-03-14 08:02:17] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 601 ms. Remains : 185/185 places, 194/194 transitions.
Treatment of property ParamProductionCell-PT-3-LTLCardinality-07 finished in 4911 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(p0))))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 191 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 194
Applied a total of 4 rules in 7 ms. Remains 191 /193 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 191 cols
[2023-03-14 08:02:17] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-14 08:02:17] [INFO ] Implicit Places using invariants in 178 ms returned [29, 37, 60, 137, 161, 164, 169]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 180 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/193 places, 194/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 192 ms. Remains : 184/193 places, 194/196 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (NEQ s2 0) (NEQ s102 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][false, false, false]]
Product exploration explored 100000 steps with 1142 reset in 115 ms.
Product exploration explored 100000 steps with 1141 reset in 135 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 81 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=81 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 194 rows 184 cols
[2023-03-14 08:02:18] [INFO ] Computed 20 place invariants in 7 ms
[2023-03-14 08:02:18] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2023-03-14 08:02:18] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-14 08:02:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:02:18] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2023-03-14 08:02:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:02:18] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2023-03-14 08:02:18] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-14 08:02:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:02:18] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2023-03-14 08:02:18] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:02:19] [INFO ] [Nat]Added 68 Read/Feed constraints in 18 ms returned sat
[2023-03-14 08:02:19] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2023-03-14 08:02:19] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2023-03-14 08:02:19] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2023-03-14 08:02:19] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2023-03-14 08:02:19] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2023-03-14 08:02:19] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2023-03-14 08:02:19] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2023-03-14 08:02:19] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2023-03-14 08:02:19] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 5 ms to minimize.
[2023-03-14 08:02:19] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2023-03-14 08:02:19] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2023-03-14 08:02:19] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2023-03-14 08:02:19] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2023-03-14 08:02:20] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2023-03-14 08:02:20] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2023-03-14 08:02:20] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2023-03-14 08:02:20] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2023-03-14 08:02:20] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 5 ms to minimize.
[2023-03-14 08:02:20] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1395 ms
[2023-03-14 08:02:20] [INFO ] Computed and/alt/rep : 191/309/191 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-14 08:02:21] [INFO ] Added : 159 causal constraints over 32 iterations in 716 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Applied a total of 0 rules in 4 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2023-03-14 08:02:21] [INFO ] Invariant cache hit.
[2023-03-14 08:02:21] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-14 08:02:21] [INFO ] Invariant cache hit.
[2023-03-14 08:02:21] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:02:21] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2023-03-14 08:02:21] [INFO ] Invariant cache hit.
[2023-03-14 08:02:21] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 598 ms. Remains : 184/184 places, 194/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 84 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=84 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-14 08:02:22] [INFO ] Invariant cache hit.
[2023-03-14 08:02:22] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2023-03-14 08:02:22] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-14 08:02:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:02:22] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2023-03-14 08:02:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:02:22] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2023-03-14 08:02:22] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-14 08:02:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:02:22] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2023-03-14 08:02:22] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:02:22] [INFO ] [Nat]Added 68 Read/Feed constraints in 23 ms returned sat
[2023-03-14 08:02:23] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 4 ms to minimize.
[2023-03-14 08:02:23] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2023-03-14 08:02:23] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2023-03-14 08:02:23] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2023-03-14 08:02:23] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2023-03-14 08:02:23] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2023-03-14 08:02:23] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 0 ms to minimize.
[2023-03-14 08:02:23] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2023-03-14 08:02:23] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2023-03-14 08:02:23] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2023-03-14 08:02:23] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 0 ms to minimize.
[2023-03-14 08:02:23] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2023-03-14 08:02:23] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2023-03-14 08:02:24] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 0 ms to minimize.
[2023-03-14 08:02:24] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 0 ms to minimize.
[2023-03-14 08:02:24] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
[2023-03-14 08:02:24] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 2 ms to minimize.
[2023-03-14 08:02:24] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2023-03-14 08:02:24] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2023-03-14 08:02:24] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2023-03-14 08:02:24] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
[2023-03-14 08:02:24] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2023-03-14 08:02:24] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1697 ms
[2023-03-14 08:02:24] [INFO ] Computed and/alt/rep : 191/309/191 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-14 08:02:25] [INFO ] Added : 184 causal constraints over 37 iterations in 733 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1142 reset in 109 ms.
Product exploration explored 100000 steps with 1139 reset in 127 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 184 transition count 194
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 38 place count 184 transition count 196
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 50 place count 184 transition count 196
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 59 place count 175 transition count 186
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 68 place count 175 transition count 186
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 113 place count 175 transition count 186
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 142 place count 146 transition count 157
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 171 place count 146 transition count 157
Deduced a syphon composed of 57 places in 0 ms
Applied a total of 171 rules in 21 ms. Remains 146 /184 variables (removed 38) and now considering 157/194 (removed 37) transitions.
[2023-03-14 08:02:26] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 157 rows 146 cols
[2023-03-14 08:02:26] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-14 08:02:26] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/184 places, 157/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 162 ms. Remains : 146/184 places, 157/194 transitions.
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 184 cols
[2023-03-14 08:02:26] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-14 08:02:26] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-14 08:02:26] [INFO ] Invariant cache hit.
[2023-03-14 08:02:26] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:02:26] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2023-03-14 08:02:26] [INFO ] Invariant cache hit.
[2023-03-14 08:02:26] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 576 ms. Remains : 184/184 places, 194/194 transitions.
Treatment of property ParamProductionCell-PT-3-LTLCardinality-08 finished in 9613 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((G((G(p0)||F(p1))) U p2))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 196/196 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 193 transition count 175
Reduce places removed 21 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 23 rules applied. Total rules applied 44 place count 172 transition count 173
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 170 transition count 173
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 46 place count 170 transition count 156
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 80 place count 153 transition count 156
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 82 place count 151 transition count 154
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 151 transition count 154
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 172 place count 107 transition count 110
Applied a total of 172 rules in 18 ms. Remains 107 /193 variables (removed 86) and now considering 110/196 (removed 86) transitions.
// Phase 1: matrix 110 rows 107 cols
[2023-03-14 08:02:26] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-14 08:02:26] [INFO ] Implicit Places using invariants in 99 ms returned [23, 35, 75, 89, 92, 97]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 100 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/193 places, 110/196 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 94 transition count 103
Applied a total of 14 rules in 6 ms. Remains 94 /101 variables (removed 7) and now considering 103/110 (removed 7) transitions.
// Phase 1: matrix 103 rows 94 cols
[2023-03-14 08:02:26] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 08:02:27] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-14 08:02:27] [INFO ] Invariant cache hit.
[2023-03-14 08:02:27] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:02:27] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/193 places, 103/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 400 ms. Remains : 94/193 places, 103/196 transitions.
Stuttering acceptance computed with spot in 312 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1, 2} source=1 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 2} source=1 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1, 2} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1, 2} source=4 dest: 4}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=5 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1, 2} source=5 dest: 4}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 2} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=6 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1, 2} source=6 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 2} source=6 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1, 2} source=6 dest: 6}]], initial=0, aps=[p2:(OR (EQ s57 0) (EQ s9 1)), p0:(EQ s17 1), p1:(EQ s78 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 841 reset in 192 ms.
Product exploration explored 100000 steps with 839 reset in 197 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 p2 p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p2), (X (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), true, (X (X p2)), (X (X (OR (AND p2 (NOT p1)) (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p2 p0 (NOT p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p2 (NOT p0) (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p2 p0 (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1)))))]
Knowledge based reduction with 10 factoid took 921 ms. Reduced automaton from 7 states, 31 edges and 3 AP (stutter insensitive) to 7 states, 31 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 289 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 159 steps, including 0 resets, run visited all 8 properties in 7 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p2), (X (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), true, (X (X p2)), (X (X (OR (AND p2 (NOT p1)) (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p2 p0 (NOT p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p2 (NOT p0) (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p2 p0 (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT p2)), (F (NOT (AND p0 (NOT p1) p2)))]
Knowledge based reduction with 10 factoid took 1146 ms. Reduced automaton from 7 states, 31 edges and 3 AP (stutter insensitive) to 7 states, 31 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 482 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 271 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 94 /94 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-14 08:02:31] [INFO ] Invariant cache hit.
[2023-03-14 08:02:31] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-14 08:02:31] [INFO ] Invariant cache hit.
[2023-03-14 08:02:31] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:02:31] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2023-03-14 08:02:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 08:02:31] [INFO ] Invariant cache hit.
[2023-03-14 08:02:31] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 370 ms. Remains : 94/94 places, 103/103 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 10 factoid took 910 ms. Reduced automaton from 7 states, 31 edges and 3 AP (stutter insensitive) to 7 states, 31 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 289 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 296 steps, including 0 resets, run visited all 8 properties in 6 ms. (steps per millisecond=49 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT p2)), (F (NOT (AND p0 (NOT p1) p2)))]
Knowledge based reduction with 10 factoid took 1112 ms. Reduced automaton from 7 states, 31 edges and 3 AP (stutter insensitive) to 7 states, 31 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 279 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 277 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 271 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 840 reset in 155 ms.
Product exploration explored 100000 steps with 852 reset in 175 ms.
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 94 /94 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-14 08:02:34] [INFO ] Invariant cache hit.
[2023-03-14 08:02:35] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-14 08:02:35] [INFO ] Invariant cache hit.
[2023-03-14 08:02:35] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:02:35] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2023-03-14 08:02:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 08:02:35] [INFO ] Invariant cache hit.
[2023-03-14 08:02:35] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 383 ms. Remains : 94/94 places, 103/103 transitions.
Treatment of property ParamProductionCell-PT-3-LTLCardinality-11 finished in 8545 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(p0))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 196/196 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 192 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 192 transition count 195
Applied a total of 2 rules in 4 ms. Remains 192 /193 variables (removed 1) and now considering 195/196 (removed 1) transitions.
// Phase 1: matrix 195 rows 192 cols
[2023-03-14 08:02:35] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-14 08:02:35] [INFO ] Implicit Places using invariants in 141 ms returned [29, 37, 60, 138, 162, 165, 170]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 142 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/193 places, 195/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 195/195 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 185/193 places, 195/196 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s87 0) (EQ s175 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-3-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-LTLCardinality-13 finished in 326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||((p1 U F(X(X(p1)))) U (X(p2) U p3))))'
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 191 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 194
Applied a total of 4 rules in 4 ms. Remains 191 /193 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 191 cols
[2023-03-14 08:02:35] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-14 08:02:35] [INFO ] Implicit Places using invariants in 140 ms returned [29, 60, 137, 161, 169]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 142 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/193 places, 194/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 186 /186 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 186/193 places, 194/196 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p3:(OR (EQ s160 0) (EQ s53 1)), p0:(EQ s137 1), p2:(OR (EQ s177 0) (EQ s12 1)), p1:(EQ s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 35064 reset in 249 ms.
Product exploration explored 100000 steps with 35177 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 : [(AND (NOT p3) (NOT p0) p2 p1), (X (NOT (AND (NOT p3) p0))), (X (NOT p3)), (X p2), (X (AND (NOT p3) (NOT p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0)))))]
Knowledge based reduction with 9 factoid took 421 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 194 rows 186 cols
[2023-03-14 08:02:37] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-14 08:02:37] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-14 08:02:37] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 12 ms returned sat
[2023-03-14 08:02:37] [INFO ] After 65ms 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 p3) (NOT p0) p2 p1), (X (NOT (AND (NOT p3) p0))), (X (NOT p3)), (X p2), (X (AND (NOT p3) (NOT p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (F (NOT p2)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p3) p0)), (F p3), (F (NOT (AND (NOT p3) (NOT p0))))]
Knowledge based reduction with 10 factoid took 634 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p1)), (NOT p1)]
[2023-03-14 08:02:38] [INFO ] Invariant cache hit.
[2023-03-14 08:02:38] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-14 08:02:38] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-14 08:02:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:02:38] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2023-03-14 08:02:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:02:38] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2023-03-14 08:02:38] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-14 08:02:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:02:38] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2023-03-14 08:02:38] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:02:38] [INFO ] [Nat]Added 68 Read/Feed constraints in 22 ms returned sat
[2023-03-14 08:02:38] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 3 ms to minimize.
[2023-03-14 08:02:38] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 0 ms to minimize.
[2023-03-14 08:02:39] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2023-03-14 08:02:39] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2023-03-14 08:02:39] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2023-03-14 08:02:39] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2023-03-14 08:02:39] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2023-03-14 08:02:39] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 0 ms to minimize.
[2023-03-14 08:02:39] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2023-03-14 08:02:39] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 3 ms to minimize.
[2023-03-14 08:02:39] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2023-03-14 08:02:39] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2023-03-14 08:02:39] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2023-03-14 08:02:39] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2023-03-14 08:02:39] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 0 ms to minimize.
[2023-03-14 08:02:40] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2023-03-14 08:02:40] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2023-03-14 08:02:40] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2023-03-14 08:02:40] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2023-03-14 08:02:40] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2023-03-14 08:02:40] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2023-03-14 08:02:40] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2023-03-14 08:02:40] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1683 ms
[2023-03-14 08:02:40] [INFO ] Computed and/alt/rep : 191/309/191 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-14 08:02:41] [INFO ] Added : 186 causal constraints over 38 iterations in 760 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Support contains 6 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 194/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 186 /186 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2023-03-14 08:02:41] [INFO ] Invariant cache hit.
[2023-03-14 08:02:41] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-14 08:02:41] [INFO ] Invariant cache hit.
[2023-03-14 08:02:41] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:02:41] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2023-03-14 08:02:41] [INFO ] Invariant cache hit.
[2023-03-14 08:02:41] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 608 ms. Remains : 186/186 places, 194/194 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 p3) (NOT p0) p2 p1), (X (NOT (AND (NOT p3) p0))), (X (NOT p3)), (X p2), (X (AND (NOT p3) (NOT p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0)))))]
Knowledge based reduction with 8 factoid took 391 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p1)), (NOT p1)]
Finished random walk after 41 steps, including 0 resets, run visited all 5 properties in 4 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p3) (NOT p0) p2 p1), (X (NOT (AND (NOT p3) p0))), (X (NOT p3)), (X p2), (X (AND (NOT p3) (NOT p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (F (NOT p1)), (F (NOT p2)), (F (AND p0 (NOT p3))), (F p3), (F (NOT (AND (NOT p0) (NOT p3))))]
Knowledge based reduction with 8 factoid took 466 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p1)), (NOT p1)]
[2023-03-14 08:02:43] [INFO ] Invariant cache hit.
[2023-03-14 08:02:43] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-14 08:02:43] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-14 08:02:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:02:43] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2023-03-14 08:02:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:02:43] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-14 08:02:43] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-14 08:02:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:02:43] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2023-03-14 08:02:43] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:02:43] [INFO ] [Nat]Added 68 Read/Feed constraints in 24 ms returned sat
[2023-03-14 08:02:43] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2023-03-14 08:02:43] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2023-03-14 08:02:44] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2023-03-14 08:02:44] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2023-03-14 08:02:44] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2023-03-14 08:02:44] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2023-03-14 08:02:44] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2023-03-14 08:02:44] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2023-03-14 08:02:44] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 0 ms to minimize.
[2023-03-14 08:02:44] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2023-03-14 08:02:44] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2023-03-14 08:02:44] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2023-03-14 08:02:44] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2023-03-14 08:02:44] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2023-03-14 08:02:44] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2023-03-14 08:02:44] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2023-03-14 08:02:45] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2023-03-14 08:02:45] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2023-03-14 08:02:45] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2023-03-14 08:02:45] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2023-03-14 08:02:45] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2023-03-14 08:02:45] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2023-03-14 08:02:45] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1553 ms
[2023-03-14 08:02:45] [INFO ] Computed and/alt/rep : 191/309/191 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-14 08:02:46] [INFO ] Added : 186 causal constraints over 38 iterations in 746 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 35164 reset in 259 ms.
Product exploration explored 100000 steps with 35065 reset in 264 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p1)), (NOT p1)]
Support contains 6 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 194/194 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 186 transition count 194
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 18 Pre rules applied. Total rules applied 24 place count 186 transition count 195
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 42 place count 186 transition count 195
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 181 transition count 190
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 181 transition count 190
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 74 places in 1 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 89 place count 181 transition count 190
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 107 place count 163 transition count 172
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 125 place count 163 transition count 172
Deduced a syphon composed of 56 places in 0 ms
Applied a total of 125 rules in 20 ms. Remains 163 /186 variables (removed 23) and now considering 172/194 (removed 22) transitions.
[2023-03-14 08:02:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 172 rows 163 cols
[2023-03-14 08:02:47] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-14 08:02:47] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/186 places, 172/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 169 ms. Remains : 163/186 places, 172/194 transitions.
Support contains 6 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 194/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 186 /186 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 186 cols
[2023-03-14 08:02:47] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-14 08:02:47] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-14 08:02:47] [INFO ] Invariant cache hit.
[2023-03-14 08:02:47] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:02:47] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2023-03-14 08:02:47] [INFO ] Invariant cache hit.
[2023-03-14 08:02:47] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 606 ms. Remains : 186/186 places, 194/194 transitions.
Treatment of property ParamProductionCell-PT-3-LTLCardinality-14 finished in 12122 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)))'
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(X((X(G(p1))||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' '!(X(X(F(p0))))'
Found a Shortening insensitive property : ParamProductionCell-PT-3-LTLCardinality-08
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 193/193 places, 196/196 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 193 transition count 171
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 168 transition count 171
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 50 place count 168 transition count 156
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 80 place count 153 transition count 156
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 151 transition count 154
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 151 transition count 154
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 182 place count 102 transition count 105
Applied a total of 182 rules in 17 ms. Remains 102 /193 variables (removed 91) and now considering 105/196 (removed 91) transitions.
// Phase 1: matrix 105 rows 102 cols
[2023-03-14 08:02:48] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-14 08:02:48] [INFO ] Implicit Places using invariants in 121 ms returned [17, 22, 34, 70, 83, 86, 91]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 123 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 95/193 places, 105/196 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 95 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 94 transition count 104
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 16 place count 87 transition count 97
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 2 with 2 rules applied. Total rules applied 18 place count 86 transition count 96
Applied a total of 18 rules in 10 ms. Remains 86 /95 variables (removed 9) and now considering 96/105 (removed 9) transitions.
// Phase 1: matrix 96 rows 86 cols
[2023-03-14 08:02:48] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-14 08:02:48] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-14 08:02:48] [INFO ] Invariant cache hit.
[2023-03-14 08:02:48] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:02:48] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 86/193 places, 96/196 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 408 ms. Remains : 86/193 places, 96/196 transitions.
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (NEQ s2 0) (NEQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2434 reset in 131 ms.
Product exploration explored 100000 steps with 2449 reset in 144 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 47 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-14 08:02:49] [INFO ] Invariant cache hit.
[2023-03-14 08:02:49] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-14 08:02:49] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-14 08:02:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:02:49] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-14 08:02:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:02:49] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2023-03-14 08:02:49] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-14 08:02:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:02:49] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-14 08:02:49] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:02:49] [INFO ] [Nat]Added 67 Read/Feed constraints in 10 ms returned sat
[2023-03-14 08:02:49] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2023-03-14 08:02:49] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-14 08:02:49] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-14 08:02:49] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-14 08:02:49] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2023-03-14 08:02:49] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2023-03-14 08:02:49] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2023-03-14 08:02:49] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-14 08:02:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 342 ms
[2023-03-14 08:02:50] [INFO ] Computed and/alt/rep : 94/218/94 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-14 08:02:50] [INFO ] Added : 79 causal constraints over 16 iterations in 261 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2023-03-14 08:02:50] [INFO ] Invariant cache hit.
[2023-03-14 08:02:50] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-14 08:02:50] [INFO ] Invariant cache hit.
[2023-03-14 08:02:50] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:02:50] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-03-14 08:02:50] [INFO ] Invariant cache hit.
[2023-03-14 08:02:50] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 341 ms. Remains : 86/86 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 47 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=47 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-14 08:02:51] [INFO ] Invariant cache hit.
[2023-03-14 08:02:51] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-14 08:02:51] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-14 08:02:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:02:51] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-14 08:02:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:02:51] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-14 08:02:51] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-14 08:02:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:02:51] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-14 08:02:51] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:02:51] [INFO ] [Nat]Added 67 Read/Feed constraints in 9 ms returned sat
[2023-03-14 08:02:51] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2023-03-14 08:02:51] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-14 08:02:51] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-14 08:02:51] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-14 08:02:51] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-14 08:02:51] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2023-03-14 08:02:51] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2023-03-14 08:02:51] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-14 08:02:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 309 ms
[2023-03-14 08:02:51] [INFO ] Computed and/alt/rep : 94/218/94 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-14 08:02:51] [INFO ] Added : 79 causal constraints over 16 iterations in 178 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2431 reset in 116 ms.
Product exploration explored 100000 steps with 2442 reset in 140 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2023-03-14 08:02:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 08:02:52] [INFO ] Invariant cache hit.
[2023-03-14 08:02:52] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 86/86 places, 96/96 transitions.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2023-03-14 08:02:52] [INFO ] Invariant cache hit.
[2023-03-14 08:02:52] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-14 08:02:52] [INFO ] Invariant cache hit.
[2023-03-14 08:02:52] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:02:52] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2023-03-14 08:02:52] [INFO ] Invariant cache hit.
[2023-03-14 08:02:52] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 365 ms. Remains : 86/86 places, 96/96 transitions.
Treatment of property ParamProductionCell-PT-3-LTLCardinality-08 finished in 4937 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((G((G(p0)||F(p1))) U p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||((p1 U F(X(X(p1)))) U (X(p2) U p3))))'
[2023-03-14 08:02:53] [INFO ] Flatten gal took : 15 ms
[2023-03-14 08:02:53] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-14 08:02:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 193 places, 196 transitions and 612 arcs took 3 ms.
Total runtime 50775 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ParamProductionCell-PT-3
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLCardinality

FORMULA ParamProductionCell-PT-3-LTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-3-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-3-LTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-3-LTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-3-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678780983104

--------------------
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//
++ perl -pe 's/.*\.//g'
++ 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 LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 ParamProductionCell-PT-3-LTLCardinality-03
lola: time limit : 720 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ParamProductionCell-PT-3-LTLCardinality-03
lola: result : true
lola: markings : 5657
lola: fired transitions : 9458
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 13 (type EXCL) for 12 ParamProductionCell-PT-3-LTLCardinality-14
lola: time limit : 900 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-3-LTLCardinality-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-3-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-3-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-3-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 5/900 4/32 ParamProductionCell-PT-3-LTLCardinality-14 619234 m, 123846 m/sec, 2749548 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 5
lola: FINISHED task # 13 (type EXCL) for ParamProductionCell-PT-3-LTLCardinality-14
lola: result : true
lola: markings : 874527
lola: fired transitions : 4897193
lola: time used : 8.000000
lola: memory pages used : 6
lola: LAUNCH task # 7 (type EXCL) for 6 ParamProductionCell-PT-3-LTLCardinality-08
lola: time limit : 1197 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for ParamProductionCell-PT-3-LTLCardinality-08
lola: result : false
lola: markings : 45102
lola: fired transitions : 93580
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 ParamProductionCell-PT-3-LTLCardinality-07
lola: time limit : 1796 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for ParamProductionCell-PT-3-LTLCardinality-07
lola: result : true
lola: markings : 16
lola: fired transitions : 24
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 ParamProductionCell-PT-3-LTLCardinality-11
lola: time limit : 3592 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for ParamProductionCell-PT-3-LTLCardinality-11
lola: result : true
lola: markings : 41355
lola: fired transitions : 91792
lola: time used : 1.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-3-LTLCardinality-03: LTL true LTL model checker
ParamProductionCell-PT-3-LTLCardinality-07: LTL true LTL model checker
ParamProductionCell-PT-3-LTLCardinality-08: LTL false LTL model checker
ParamProductionCell-PT-3-LTLCardinality-11: LTL true LTL model checker
ParamProductionCell-PT-3-LTLCardinality-14: LTL true LTL model checker


Time elapsed: 9 secs. Pages in use: 6

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="ParamProductionCell-PT-3"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ParamProductionCell-PT-3, 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 r263-smll-167863538200387"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-3.tgz
mv ParamProductionCell-PT-3 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 ;