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

About the Execution of LoLa+red for ParamProductionCell-PT-5

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
437.063 33214.00 59260.00 631.90 FTFTFFFFTFTFTTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r263-smll-167863538200403.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-5, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538200403
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 7.2K Feb 26 17:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 17:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 17:16 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.2K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 26 17:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 17:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 17:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:30 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-5-LTLCardinality-00
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-01
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-02
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-03
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-04
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-05
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-06
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-07
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-08
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-09
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678781509906

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-5
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 08:11:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 08:11:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 08:11:52] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2023-03-14 08:11:52] [INFO ] Transformed 231 places.
[2023-03-14 08:11:52] [INFO ] Transformed 202 transitions.
[2023-03-14 08:11:52] [INFO ] Found NUPN structural information;
[2023-03-14 08:11:52] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 260 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ParamProductionCell-PT-5-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 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 59 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:11:53] [INFO ] Computed 59 place invariants in 26 ms
[2023-03-14 08:11:54] [INFO ] Implicit Places using invariants in 799 ms returned [15, 16, 18, 19, 24, 31, 35, 36, 41, 42, 59, 64, 65, 73, 79, 98, 99, 101, 114, 115, 117, 119, 120, 160, 161, 163, 165, 166, 191, 192, 195, 196, 201, 206, 217]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 857 ms to find 35 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 191/231 places, 197/202 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 189 transition count 195
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 189 transition count 195
Applied a total of 4 rules in 33 ms. Remains 189 /191 variables (removed 2) and now considering 195/197 (removed 2) transitions.
// Phase 1: matrix 195 rows 189 cols
[2023-03-14 08:11:54] [INFO ] Computed 24 place invariants in 5 ms
[2023-03-14 08:11:54] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-14 08:11:54] [INFO ] Invariant cache hit.
[2023-03-14 08:11:54] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:11:54] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 189/231 places, 195/202 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1737 ms. Remains : 189/231 places, 195/202 transitions.
Support contains 27 out of 189 places after structural reductions.
[2023-03-14 08:11:55] [INFO ] Flatten gal took : 80 ms
[2023-03-14 08:11:55] [INFO ] Flatten gal took : 33 ms
[2023-03-14 08:11:55] [INFO ] Input system was already deterministic with 195 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 543 ms. (steps per millisecond=18 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 08:11:56] [INFO ] Invariant cache hit.
[2023-03-14 08:11:56] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 08:11:56] [INFO ] [Nat]Absence check using 20 positive place invariants in 18 ms returned sat
[2023-03-14 08:11:56] [INFO ] [Nat]Absence check using 20 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-14 08:11:56] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 195/195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 188 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 188 transition count 194
Applied a total of 2 rules in 17 ms. Remains 188 /189 variables (removed 1) and now considering 194/195 (removed 1) transitions.
// Phase 1: matrix 194 rows 188 cols
[2023-03-14 08:11:56] [INFO ] Computed 24 place invariants in 5 ms
[2023-03-14 08:11:56] [INFO ] Implicit Places using invariants in 172 ms returned [37, 64, 166]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 176 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/189 places, 194/195 transitions.
Applied a total of 0 rules in 8 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 201 ms. Remains : 185/189 places, 194/195 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s36 0) (EQ s53 1) (NEQ s113 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 748 ms.
Product exploration explored 100000 steps with 50000 reset in 480 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-5-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-5-LTLCardinality-01 finished in 1891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 195/195 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 161
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 155 transition count 161
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 68 place count 155 transition count 145
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 100 place count 139 transition count 145
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 180 place count 99 transition count 105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 184 place count 97 transition count 103
Applied a total of 184 rules in 46 ms. Remains 97 /189 variables (removed 92) and now considering 103/195 (removed 92) transitions.
// Phase 1: matrix 103 rows 97 cols
[2023-03-14 08:11:58] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-14 08:11:58] [INFO ] Implicit Places using invariants in 120 ms returned [18, 19, 37, 87]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 122 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/189 places, 103/195 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 93 transition count 101
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 91 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 16 place count 85 transition count 95
Applied a total of 16 rules in 14 ms. Remains 85 /93 variables (removed 8) and now considering 95/103 (removed 8) transitions.
// Phase 1: matrix 95 rows 85 cols
[2023-03-14 08:11:58] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-14 08:11:58] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-14 08:11:58] [INFO ] Invariant cache hit.
[2023-03-14 08:11:58] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:11:59] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/189 places, 95/195 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 497 ms. Remains : 85/189 places, 95/195 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-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 s25 0) (EQ s40 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 246 ms.
Stack based approach found an accepted trace after 142 steps with 0 reset with depth 143 and stack size 143 in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLCardinality-02 finished in 801 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 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 195/195 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 161
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 155 transition count 161
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 68 place count 155 transition count 144
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 102 place count 138 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 137 transition count 143
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 137 transition count 143
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 176 place count 101 transition count 107
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 180 place count 99 transition count 105
Applied a total of 180 rules in 30 ms. Remains 99 /189 variables (removed 90) and now considering 105/195 (removed 90) transitions.
// Phase 1: matrix 105 rows 99 cols
[2023-03-14 08:11:59] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-14 08:11:59] [INFO ] Implicit Places using invariants in 106 ms returned [18, 19, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 109 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/189 places, 105/195 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 96 transition count 103
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 94 transition count 103
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 12 place count 90 transition count 99
Applied a total of 12 rules in 10 ms. Remains 90 /96 variables (removed 6) and now considering 99/105 (removed 6) transitions.
// Phase 1: matrix 99 rows 90 cols
[2023-03-14 08:11:59] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 08:11:59] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-14 08:11:59] [INFO ] Invariant cache hit.
[2023-03-14 08:11:59] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:11:59] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/189 places, 99/195 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 440 ms. Remains : 90/189 places, 99/195 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-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:(OR (EQ s78 0) (EQ s42 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 5679 reset in 152 ms.
Product exploration explored 100000 steps with 5709 reset in 275 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 81 ms :[(NOT p0), (NOT p0)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 180 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 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
[2023-03-14 08:12:00] [INFO ] Invariant cache hit.
[2023-03-14 08:12:01] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-03-14 08:12:01] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-14 08:12:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:12:01] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2023-03-14 08:12:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:12:01] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-14 08:12:01] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-14 08:12:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:12:01] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-14 08:12:01] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:12:01] [INFO ] [Nat]Added 66 Read/Feed constraints in 18 ms returned sat
[2023-03-14 08:12:01] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 4 ms to minimize.
[2023-03-14 08:12:01] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
[2023-03-14 08:12:01] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2023-03-14 08:12:01] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2023-03-14 08:12:01] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2023-03-14 08:12:01] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2023-03-14 08:12:01] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2023-03-14 08:12:01] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2023-03-14 08:12:01] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2023-03-14 08:12:01] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2023-03-14 08:12:02] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2023-03-14 08:12:02] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2023-03-14 08:12:02] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2023-03-14 08:12:02] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2023-03-14 08:12:02] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2023-03-14 08:12:02] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2023-03-14 08:12:02] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
[2023-03-14 08:12:02] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2023-03-14 08:12:02] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2023-03-14 08:12:02] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2023-03-14 08:12:02] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1316 ms
[2023-03-14 08:12:02] [INFO ] Computed and/alt/rep : 96/220/96 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-14 08:12:02] [INFO ] Added : 63 causal constraints over 13 iterations in 360 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 99/99 transitions.
Applied a total of 0 rules in 7 ms. Remains 90 /90 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-14 08:12:02] [INFO ] Invariant cache hit.
[2023-03-14 08:12:03] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-14 08:12:03] [INFO ] Invariant cache hit.
[2023-03-14 08:12:03] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:12:03] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2023-03-14 08:12:03] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-14 08:12:03] [INFO ] Invariant cache hit.
[2023-03-14 08:12:03] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 504 ms. Remains : 90/90 places, 99/99 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 252 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 95 ms :[(NOT p0), (NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 192 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 104 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
[2023-03-14 08:12:04] [INFO ] Invariant cache hit.
[2023-03-14 08:12:04] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-14 08:12:04] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-14 08:12:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:12:04] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-14 08:12:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:12:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-14 08:12:04] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-14 08:12:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:12:04] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-14 08:12:04] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:12:04] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2023-03-14 08:12:04] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 2 ms to minimize.
[2023-03-14 08:12:04] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2023-03-14 08:12:04] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 0 ms to minimize.
[2023-03-14 08:12:05] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2023-03-14 08:12:05] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2023-03-14 08:12:05] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 0 ms to minimize.
[2023-03-14 08:12:05] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2023-03-14 08:12:05] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2023-03-14 08:12:05] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2023-03-14 08:12:05] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2023-03-14 08:12:05] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2023-03-14 08:12:05] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2023-03-14 08:12:05] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2023-03-14 08:12:05] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2023-03-14 08:12:05] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2023-03-14 08:12:05] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2023-03-14 08:12:06] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2023-03-14 08:12:06] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-14 08:12:06] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2023-03-14 08:12:06] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2023-03-14 08:12:06] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1590 ms
[2023-03-14 08:12:06] [INFO ] Computed and/alt/rep : 96/220/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-14 08:12:06] [INFO ] Added : 63 causal constraints over 13 iterations in 192 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5707 reset in 159 ms.
Product exploration explored 100000 steps with 5672 reset in 246 ms.
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 99/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 90 /90 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-14 08:12:06] [INFO ] Invariant cache hit.
[2023-03-14 08:12:07] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-14 08:12:07] [INFO ] Invariant cache hit.
[2023-03-14 08:12:07] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:12:07] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2023-03-14 08:12:07] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-14 08:12:07] [INFO ] Invariant cache hit.
[2023-03-14 08:12:07] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 366 ms. Remains : 90/90 places, 99/99 transitions.
Treatment of property ParamProductionCell-PT-5-LTLCardinality-03 finished in 7998 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 195/195 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 161
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 155 transition count 161
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 68 place count 155 transition count 146
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 98 place count 140 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 139 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 139 transition count 145
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 176 place count 101 transition count 107
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 180 place count 99 transition count 105
Applied a total of 180 rules in 43 ms. Remains 99 /189 variables (removed 90) and now considering 105/195 (removed 90) transitions.
// Phase 1: matrix 105 rows 99 cols
[2023-03-14 08:12:07] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-14 08:12:07] [INFO ] Implicit Places using invariants in 163 ms returned [19, 20, 38, 89]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 165 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/189 places, 105/195 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 95 transition count 103
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 93 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 16 place count 87 transition count 97
Applied a total of 16 rules in 15 ms. Remains 87 /95 variables (removed 8) and now considering 97/105 (removed 8) transitions.
// Phase 1: matrix 97 rows 87 cols
[2023-03-14 08:12:07] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-14 08:12:07] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-14 08:12:07] [INFO ] Invariant cache hit.
[2023-03-14 08:12:07] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:12:07] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/189 places, 97/195 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 597 ms. Remains : 87/189 places, 97/195 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-04 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 s3 0) (EQ s55 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 217 ms.
Stack based approach found an accepted trace after 164 steps with 0 reset with depth 165 and stack size 163 in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLCardinality-04 finished in 887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 195/195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 188 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 188 transition count 194
Applied a total of 2 rules in 10 ms. Remains 188 /189 variables (removed 1) and now considering 194/195 (removed 1) transitions.
// Phase 1: matrix 194 rows 188 cols
[2023-03-14 08:12:08] [INFO ] Computed 24 place invariants in 3 ms
[2023-03-14 08:12:08] [INFO ] Implicit Places using invariants in 128 ms returned [36, 37, 64, 166]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 130 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/189 places, 194/195 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 145 ms. Remains : 184/189 places, 194/195 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s180 0) (EQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 44 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLCardinality-06 finished in 250 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(F(p0)))))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 195/195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 188 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 188 transition count 194
Applied a total of 2 rules in 7 ms. Remains 188 /189 variables (removed 1) and now considering 194/195 (removed 1) transitions.
[2023-03-14 08:12:08] [INFO ] Invariant cache hit.
[2023-03-14 08:12:08] [INFO ] Implicit Places using invariants in 139 ms returned [36, 37, 64, 166]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 141 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/189 places, 194/195 transitions.
Applied a total of 0 rules in 4 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 152 ms. Remains : 184/189 places, 194/195 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-07 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s43 0) (EQ s127 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 406 reset in 222 ms.
Stack based approach found an accepted trace after 211 steps with 0 reset with depth 212 and stack size 212 in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLCardinality-07 finished in 607 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 195/195 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 189 transition count 163
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 157 transition count 163
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 64 place count 157 transition count 146
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 98 place count 140 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 139 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 139 transition count 145
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 176 place count 101 transition count 107
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 2 with 2 rules applied. Total rules applied 178 place count 100 transition count 106
Applied a total of 178 rules in 45 ms. Remains 100 /189 variables (removed 89) and now considering 106/195 (removed 89) transitions.
// Phase 1: matrix 106 rows 100 cols
[2023-03-14 08:12:09] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-14 08:12:09] [INFO ] Implicit Places using invariants in 419 ms returned [20, 21, 41, 90]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 420 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/189 places, 106/195 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 96 transition count 104
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 94 transition count 104
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 16 place count 88 transition count 98
Applied a total of 16 rules in 12 ms. Remains 88 /96 variables (removed 8) and now considering 98/106 (removed 8) transitions.
// Phase 1: matrix 98 rows 88 cols
[2023-03-14 08:12:09] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-14 08:12:09] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-14 08:12:09] [INFO ] Invariant cache hit.
[2023-03-14 08:12:09] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:12:09] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 88/189 places, 98/195 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 797 ms. Remains : 88/189 places, 98/195 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s26 0) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 25116 reset in 263 ms.
Product exploration explored 100000 steps with 24933 reset in 160 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)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 232 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 227 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-14 08:12:11] [INFO ] Invariant cache hit.
[2023-03-14 08:12:11] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-14 08:12:11] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-14 08:12:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:12:11] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-03-14 08:12:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:12:11] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2023-03-14 08:12:11] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-14 08:12:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:12:11] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-14 08:12:11] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:12:11] [INFO ] [Nat]Added 67 Read/Feed constraints in 12 ms returned sat
[2023-03-14 08:12:11] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-14 08:12:11] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2023-03-14 08:12:11] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2023-03-14 08:12:11] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2023-03-14 08:12:11] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2023-03-14 08:12:11] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2023-03-14 08:12:11] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2023-03-14 08:12:11] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2023-03-14 08:12:11] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 408 ms
[2023-03-14 08:12:11] [INFO ] Computed and/alt/rep : 95/220/95 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-14 08:12:11] [INFO ] Added : 82 causal constraints over 17 iterations in 262 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 98/98 transitions.
Applied a total of 0 rules in 5 ms. Remains 88 /88 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-14 08:12:12] [INFO ] Invariant cache hit.
[2023-03-14 08:12:12] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-14 08:12:12] [INFO ] Invariant cache hit.
[2023-03-14 08:12:12] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:12:12] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2023-03-14 08:12:12] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-14 08:12:12] [INFO ] Invariant cache hit.
[2023-03-14 08:12:12] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 569 ms. Remains : 88/88 places, 98/98 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)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 172 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 215 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
[2023-03-14 08:12:13] [INFO ] Invariant cache hit.
[2023-03-14 08:12:13] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2023-03-14 08:12:13] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-14 08:12:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:12:13] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2023-03-14 08:12:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:12:13] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-14 08:12:13] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-14 08:12:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:12:13] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-14 08:12:13] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:12:13] [INFO ] [Nat]Added 67 Read/Feed constraints in 13 ms returned sat
[2023-03-14 08:12:13] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-14 08:12:13] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2023-03-14 08:12:13] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2023-03-14 08:12:13] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2023-03-14 08:12:13] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2023-03-14 08:12:13] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2023-03-14 08:12:13] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2023-03-14 08:12:13] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2023-03-14 08:12:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 405 ms
[2023-03-14 08:12:13] [INFO ] Computed and/alt/rep : 95/220/95 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-14 08:12:14] [INFO ] Added : 82 causal constraints over 17 iterations in 280 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
Product exploration explored 100000 steps with 24968 reset in 137 ms.
Product exploration explored 100000 steps with 24891 reset in 152 ms.
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 88 /88 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-14 08:12:14] [INFO ] Invariant cache hit.
[2023-03-14 08:12:14] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-14 08:12:14] [INFO ] Invariant cache hit.
[2023-03-14 08:12:14] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:12:14] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2023-03-14 08:12:14] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-14 08:12:14] [INFO ] Invariant cache hit.
[2023-03-14 08:12:15] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 507 ms. Remains : 88/88 places, 98/98 transitions.
Treatment of property ParamProductionCell-PT-5-LTLCardinality-09 finished in 6053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 195/195 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 189 transition count 162
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 156 transition count 162
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 66 place count 156 transition count 145
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 100 place count 139 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 138 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 138 transition count 144
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 180 place count 99 transition count 105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 184 place count 97 transition count 103
Applied a total of 184 rules in 22 ms. Remains 97 /189 variables (removed 92) and now considering 103/195 (removed 92) transitions.
// Phase 1: matrix 103 rows 97 cols
[2023-03-14 08:12:15] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-14 08:12:15] [INFO ] Implicit Places using invariants in 111 ms returned [18, 19, 38, 87]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 113 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/189 places, 103/195 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 93 transition count 101
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 91 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 16 place count 85 transition count 95
Applied a total of 16 rules in 8 ms. Remains 85 /93 variables (removed 8) and now considering 95/103 (removed 8) transitions.
// Phase 1: matrix 95 rows 85 cols
[2023-03-14 08:12:15] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-14 08:12:15] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-14 08:12:15] [INFO ] Invariant cache hit.
[2023-03-14 08:12:15] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:12:15] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/189 places, 95/195 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 473 ms. Remains : 85/189 places, 95/195 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-10 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:(NEQ s26 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 1807 reset in 232 ms.
Product exploration explored 100000 steps with 1867 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 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 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 154 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 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-14 08:12:16] [INFO ] Invariant cache hit.
[2023-03-14 08:12:16] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-14 08:12:16] [INFO ] Invariant cache hit.
[2023-03-14 08:12:17] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:12:17] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2023-03-14 08:12:17] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-14 08:12:17] [INFO ] Invariant cache hit.
[2023-03-14 08:12:17] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 560 ms. Remains : 85/85 places, 95/95 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 144 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 79 ms :[(NOT p0), (NOT p0)]
Finished random walk after 29 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=5 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 175 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 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1782 reset in 212 ms.
Product exploration explored 100000 steps with 1807 reset in 249 ms.
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-14 08:12:18] [INFO ] Invariant cache hit.
[2023-03-14 08:12:18] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-14 08:12:18] [INFO ] Invariant cache hit.
[2023-03-14 08:12:18] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:12:18] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2023-03-14 08:12:18] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-14 08:12:18] [INFO ] Invariant cache hit.
[2023-03-14 08:12:18] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 470 ms. Remains : 85/85 places, 95/95 transitions.
Treatment of property ParamProductionCell-PT-5-LTLCardinality-10 finished in 3794 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||F(p1)||(X((!p3 U (p4||G(!p3))))&&p2))))'
Support contains 5 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 195/195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 188 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 188 transition count 194
Applied a total of 2 rules in 7 ms. Remains 188 /189 variables (removed 1) and now considering 194/195 (removed 1) transitions.
// Phase 1: matrix 194 rows 188 cols
[2023-03-14 08:12:19] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-14 08:12:19] [INFO ] Implicit Places using invariants in 324 ms returned [36, 37, 166]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 325 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/189 places, 194/195 transitions.
Applied a total of 0 rules in 2 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 334 ms. Remains : 185/189 places, 194/195 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p1) p3 (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) p3 (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p4) p3)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p4) p3), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s160 0) (EQ s173 1)), p0:(EQ s77 0), p2:(AND (NEQ s62 0) (NEQ s6 1)), p4:(NEQ s77 1), p3:(OR (EQ s62 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 250 ms.
Product exploration explored 100000 steps with 50000 reset in 397 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) p4 p3), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p4) p3)))), (X (X (NOT (AND (NOT p1) (NOT p4) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1) p2)))
Knowledge based reduction with 6 factoid took 177 ms. Reduced automaton from 4 states, 6 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-5-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-5-LTLCardinality-12 finished in 1558 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 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 195/195 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 189 transition count 164
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 158 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 157 transition count 163
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 64 place count 157 transition count 145
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 100 place count 139 transition count 145
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 138 transition count 144
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 138 transition count 144
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 176 place count 101 transition count 107
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 180 place count 99 transition count 105
Applied a total of 180 rules in 22 ms. Remains 99 /189 variables (removed 90) and now considering 105/195 (removed 90) transitions.
// Phase 1: matrix 105 rows 99 cols
[2023-03-14 08:12:20] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-14 08:12:20] [INFO ] Implicit Places using invariants in 160 ms returned [19, 20, 38, 87]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 161 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/189 places, 105/195 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 95 transition count 103
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 93 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 16 place count 87 transition count 97
Applied a total of 16 rules in 9 ms. Remains 87 /95 variables (removed 8) and now considering 97/105 (removed 8) transitions.
// Phase 1: matrix 97 rows 87 cols
[2023-03-14 08:12:20] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-14 08:12:20] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-14 08:12:20] [INFO ] Invariant cache hit.
[2023-03-14 08:12:21] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:12:21] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/189 places, 97/195 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 649 ms. Remains : 87/189 places, 97/195 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-15 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 s9 0) (EQ s82 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 3695 reset in 217 ms.
Stack based approach found an accepted trace after 5470 steps with 212 reset with depth 95 and stack size 95 in 14 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLCardinality-15 finished in 1001 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' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-14 08:12:21] [INFO ] Flatten gal took : 15 ms
[2023-03-14 08:12:21] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-14 08:12:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 189 places, 195 transitions and 610 arcs took 3 ms.
Total runtime 29401 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ParamProductionCell-PT-5
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLCardinality

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

FORMULA ParamProductionCell-PT-5-LTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-5-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678781543120

--------------------
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: 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: LAUNCH task # 1 (type EXCL) for 0 ParamProductionCell-PT-5-LTLCardinality-03
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 1 (type EXCL) for ParamProductionCell-PT-5-LTLCardinality-03
lola: result : true
lola: markings : 12155
lola: fired transitions : 20828
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 9 (type EXCL) for 3 ParamProductionCell-PT-5-LTLCardinality-09
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 9 (type EXCL) for ParamProductionCell-PT-5-LTLCardinality-09
lola: result : true
lola: markings : 125
lola: fired transitions : 126
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 ParamProductionCell-PT-5-LTLCardinality-10
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for ParamProductionCell-PT-5-LTLCardinality-10
lola: result : true
lola: markings : 4241
lola: fired transitions : 5723
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-5-LTLCardinality-03: LTL true LTL model checker
ParamProductionCell-PT-5-LTLCardinality-09: F false state space / EG
ParamProductionCell-PT-5-LTLCardinality-10: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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-5"
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-5, 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-167863538200403"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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