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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 652K
-rw-r--r-- 1 mcc users 9.3K Feb 26 17:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 17:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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.8K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 17:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 17:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 17:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K 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-4-LTLCardinality-00
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-01
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-02
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-03
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-04
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-05
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-06
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-07
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-08
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-09
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678781313472

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-4
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 08:08:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 08:08:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 08:08:37] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2023-03-14 08:08:37] [INFO ] Transformed 231 places.
[2023-03-14 08:08:37] [INFO ] Transformed 202 transitions.
[2023-03-14 08:08:37] [INFO ] Found NUPN structural information;
[2023-03-14 08:08:37] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 245 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ParamProductionCell-PT-4-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 228 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 228 transition count 199
Applied a total of 6 rules in 48 ms. Remains 228 /231 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 228 cols
[2023-03-14 08:08:37] [INFO ] Computed 59 place invariants in 27 ms
[2023-03-14 08:08:38] [INFO ] Implicit Places using invariants in 570 ms returned [15, 16, 19, 24, 31, 35, 41, 42, 64, 65, 73, 79, 99, 101, 113, 116, 118, 119, 162, 163, 165, 194, 197, 198, 203, 204, 219]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 635 ms to find 27 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/231 places, 199/202 transitions.
Applied a total of 0 rules in 24 ms. Remains 201 /201 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 707 ms. Remains : 201/231 places, 199/202 transitions.
Support contains 41 out of 201 places after structural reductions.
[2023-03-14 08:08:38] [INFO ] Flatten gal took : 93 ms
[2023-03-14 08:08:38] [INFO ] Flatten gal took : 35 ms
[2023-03-14 08:08:38] [INFO ] Input system was already deterministic with 199 transitions.
Support contains 38 out of 201 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 25) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 199 rows 201 cols
[2023-03-14 08:08:39] [INFO ] Computed 32 place invariants in 6 ms
[2023-03-14 08:08:39] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 08:08:39] [INFO ] [Nat]Absence check using 24 positive place invariants in 18 ms returned sat
[2023-03-14 08:08:39] [INFO ] [Nat]Absence check using 24 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-14 08:08:39] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-14 08:08:39] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:08:39] [INFO ] After 69ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-14 08:08:39] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 11 ms to minimize.
[2023-03-14 08:08:40] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2023-03-14 08:08:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 271 ms
[2023-03-14 08:08:40] [INFO ] After 360ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2023-03-14 08:08:40] [INFO ] After 677ms 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 2 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA ParamProductionCell-PT-4-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F((p1&&F(p2))))||p0)))'
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 199/199 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 198 transition count 196
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 198 transition count 196
Applied a total of 6 rules in 12 ms. Remains 198 /201 variables (removed 3) and now considering 196/199 (removed 3) transitions.
// Phase 1: matrix 196 rows 198 cols
[2023-03-14 08:08:40] [INFO ] Computed 32 place invariants in 3 ms
[2023-03-14 08:08:40] [INFO ] Implicit Places using invariants in 205 ms returned [16, 30, 38, 39, 51, 67, 86, 143, 144, 169, 179]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 207 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/201 places, 196/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 9 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-14 08:08:40] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-14 08:08:40] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-14 08:08:40] [INFO ] Invariant cache hit.
[2023-03-14 08:08:41] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:08:41] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/201 places, 194/199 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 690 ms. Remains : 185/201 places, 194/199 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s91 0) (EQ s35 1)), p1:(OR (EQ s91 0) (EQ s35 1)), p2:(OR (EQ s36 0) (EQ s153 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4352 reset in 420 ms.
Product exploration explored 100000 steps with 4356 reset in 282 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 286 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 08:08:43] [INFO ] Invariant cache hit.
[2023-03-14 08:08:43] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-14 08:08:43] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-14 08:08:43] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-14 08:08:43] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-14 08:08:43] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:08:43] [INFO ] After 34ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-14 08:08:43] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 2 ms to minimize.
[2023-03-14 08:08:43] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2023-03-14 08:08:43] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2023-03-14 08:08:43] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2023-03-14 08:08:43] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2023-03-14 08:08:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 501 ms
[2023-03-14 08:08:43] [INFO ] After 552ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2023-03-14 08:08:43] [INFO ] After 764ms 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 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND p1 (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 8 factoid took 359 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-14 08:08:44] [INFO ] Invariant cache hit.
[2023-03-14 08:08:44] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned sat
[2023-03-14 08:08:44] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-14 08:08:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:08:44] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2023-03-14 08:08:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:08:45] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2023-03-14 08:08:45] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-14 08:08:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:08:45] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2023-03-14 08:08:45] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:08:45] [INFO ] [Nat]Added 68 Read/Feed constraints in 53 ms returned sat
[2023-03-14 08:08:45] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 3 ms to minimize.
[2023-03-14 08:08:45] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2023-03-14 08:08:45] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2023-03-14 08:08:45] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2023-03-14 08:08:45] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 2 ms to minimize.
[2023-03-14 08:08:45] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 0 ms to minimize.
[2023-03-14 08:08:46] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2023-03-14 08:08:46] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 691 ms
[2023-03-14 08:08:46] [INFO ] Computed and/alt/rep : 190/309/190 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-14 08:08:47] [INFO ] Added : 164 causal constraints over 33 iterations in 965 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 185 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 194/194 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 185 transition count 161
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 152 transition count 160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 151 transition count 160
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 68 place count 151 transition count 144
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 100 place count 135 transition count 144
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 176 place count 97 transition count 106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 180 place count 95 transition count 104
Applied a total of 180 rules in 85 ms. Remains 95 /185 variables (removed 90) and now considering 104/194 (removed 90) transitions.
// Phase 1: matrix 104 rows 95 cols
[2023-03-14 08:08:47] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 08:08:47] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-14 08:08:47] [INFO ] Invariant cache hit.
[2023-03-14 08:08:47] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:08:47] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2023-03-14 08:08:47] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-14 08:08:47] [INFO ] Invariant cache hit.
[2023-03-14 08:08:47] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/185 places, 104/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 570 ms. Remains : 95/185 places, 104/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 190 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-14 08:08:48] [INFO ] Invariant cache hit.
[2023-03-14 08:08:48] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-14 08:08:48] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-14 08:08:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:08:48] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2023-03-14 08:08:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:08:48] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-14 08:08:48] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-14 08:08:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:08:48] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2023-03-14 08:08:48] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:08:48] [INFO ] [Nat]Added 66 Read/Feed constraints in 19 ms returned sat
[2023-03-14 08:08:48] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
[2023-03-14 08:08:48] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2023-03-14 08:08:48] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2023-03-14 08:08:48] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2023-03-14 08:08:48] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-14 08:08:48] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2023-03-14 08:08:48] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2023-03-14 08:08:49] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2023-03-14 08:08:49] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 502 ms
[2023-03-14 08:08:49] [INFO ] Computed and/alt/rep : 101/219/101 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-14 08:08:49] [INFO ] Added : 41 causal constraints over 9 iterations in 189 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10267 reset in 270 ms.
Product exploration explored 100000 steps with 10261 reset in 315 ms.
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 104/104 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 93 transition count 102
Applied a total of 4 rules in 14 ms. Remains 93 /95 variables (removed 2) and now considering 102/104 (removed 2) transitions.
// Phase 1: matrix 102 rows 93 cols
[2023-03-14 08:08:49] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-14 08:08:50] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-14 08:08:50] [INFO ] Invariant cache hit.
[2023-03-14 08:08:50] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:08:50] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2023-03-14 08:08:50] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-14 08:08:50] [INFO ] Invariant cache hit.
[2023-03-14 08:08:50] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/95 places, 102/104 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 406 ms. Remains : 93/95 places, 102/104 transitions.
Treatment of property ParamProductionCell-PT-4-LTLCardinality-00 finished in 9920 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 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 199/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 199 transition count 197
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 199 transition count 197
Applied a total of 4 rules in 5 ms. Remains 199 /201 variables (removed 2) and now considering 197/199 (removed 2) transitions.
// Phase 1: matrix 197 rows 199 cols
[2023-03-14 08:08:50] [INFO ] Computed 32 place invariants in 6 ms
[2023-03-14 08:08:50] [INFO ] Implicit Places using invariants in 185 ms returned [16, 30, 38, 39, 51, 67, 86, 99, 144, 145, 170, 180]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 192 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/201 places, 197/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 195
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 195
Applied a total of 4 rules in 9 ms. Remains 185 /187 variables (removed 2) and now considering 195/197 (removed 2) transitions.
// Phase 1: matrix 195 rows 185 cols
[2023-03-14 08:08:50] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-14 08:08:50] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-14 08:08:50] [INFO ] Invariant cache hit.
[2023-03-14 08:08:50] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:08:51] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/201 places, 195/199 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 747 ms. Remains : 185/201 places, 195/199 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-01 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:(OR (EQ s106 0) (EQ s162 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 43 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-4-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLCardinality-01 finished in 883 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)&&(F(p1)||X(F(p2))))))'
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 199/199 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 201 transition count 185
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 187 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 186 transition count 184
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 30 place count 186 transition count 163
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 72 place count 165 transition count 163
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 75 place count 162 transition count 160
Iterating global reduction 3 with 3 rules applied. Total rules applied 78 place count 162 transition count 160
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 3 with 78 rules applied. Total rules applied 156 place count 123 transition count 121
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 3 with 2 rules applied. Total rules applied 158 place count 122 transition count 120
Applied a total of 158 rules in 48 ms. Remains 122 /201 variables (removed 79) and now considering 120/199 (removed 79) transitions.
// Phase 1: matrix 120 rows 122 cols
[2023-03-14 08:08:51] [INFO ] Computed 32 place invariants in 3 ms
[2023-03-14 08:08:51] [INFO ] Implicit Places using invariants in 210 ms returned [11, 20, 26, 27, 59, 69, 90, 91, 106, 111]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 212 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/201 places, 120/199 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 112 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 111 transition count 119
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 111 transition count 117
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 6 place count 109 transition count 117
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
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 36 place count 94 transition count 102
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 38 place count 93 transition count 101
Applied a total of 38 rules in 23 ms. Remains 93 /112 variables (removed 19) and now considering 101/120 (removed 19) transitions.
// Phase 1: matrix 101 rows 93 cols
[2023-03-14 08:08:51] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-14 08:08:51] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-14 08:08:51] [INFO ] Invariant cache hit.
[2023-03-14 08:08:51] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:08:52] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/201 places, 101/199 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 730 ms. Remains : 93/201 places, 101/199 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s35 0) (EQ s46 1)), p1:(AND (EQ s46 0) (EQ s35 1)), p2:(OR (EQ s24 0) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2703 reset in 146 ms.
Product exploration explored 100000 steps with 2685 reset in 260 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 245 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Finished random walk after 57 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2)))), (F p1)]
Knowledge based reduction with 5 factoid took 295 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
[2023-03-14 08:08:53] [INFO ] Invariant cache hit.
[2023-03-14 08:08:53] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-14 08:08:53] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-14 08:08:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:08:53] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2023-03-14 08:08:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:08:53] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-14 08:08:53] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-14 08:08:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:08:53] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2023-03-14 08:08:54] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:08:54] [INFO ] [Nat]Added 66 Read/Feed constraints in 23 ms returned sat
[2023-03-14 08:08:54] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2023-03-14 08:08:54] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2023-03-14 08:08:54] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2023-03-14 08:08:54] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2023-03-14 08:08:54] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2023-03-14 08:08:54] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2023-03-14 08:08:54] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2023-03-14 08:08:54] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2023-03-14 08:08:54] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2023-03-14 08:08:54] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2023-03-14 08:08:54] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2023-03-14 08:08:54] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2023-03-14 08:08:54] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 7 ms to minimize.
[2023-03-14 08:08:54] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2023-03-14 08:08:54] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2023-03-14 08:08:54] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2023-03-14 08:08:54] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2023-03-14 08:08:54] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2023-03-14 08:08:55] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2023-03-14 08:08:55] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2023-03-14 08:08:55] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-14 08:08:55] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1126 ms
[2023-03-14 08:08:55] [INFO ] Computed and/alt/rep : 98/230/98 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-14 08:08:55] [INFO ] Added : 76 causal constraints over 16 iterations in 291 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 101/101 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-14 08:08:55] [INFO ] Invariant cache hit.
[2023-03-14 08:08:55] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-14 08:08:55] [INFO ] Invariant cache hit.
[2023-03-14 08:08:55] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:08:55] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2023-03-14 08:08:55] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-14 08:08:55] [INFO ] Invariant cache hit.
[2023-03-14 08:08:55] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 529 ms. Remains : 93/93 places, 101/101 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 310 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Finished random walk after 39 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2)))), (F p1)]
Knowledge based reduction with 5 factoid took 406 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
[2023-03-14 08:08:57] [INFO ] Invariant cache hit.
[2023-03-14 08:08:57] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-14 08:08:57] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-14 08:08:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:08:57] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2023-03-14 08:08:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:08:57] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2023-03-14 08:08:57] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-14 08:08:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:08:57] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2023-03-14 08:08:57] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:08:57] [INFO ] [Nat]Added 66 Read/Feed constraints in 22 ms returned sat
[2023-03-14 08:08:57] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2023-03-14 08:08:57] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2023-03-14 08:08:58] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2023-03-14 08:08:58] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2023-03-14 08:08:58] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2023-03-14 08:08:58] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2023-03-14 08:08:58] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2023-03-14 08:08:58] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
[2023-03-14 08:08:58] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2023-03-14 08:08:58] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2023-03-14 08:08:58] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2023-03-14 08:08:58] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2023-03-14 08:08:58] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2023-03-14 08:08:58] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 14 ms to minimize.
[2023-03-14 08:08:58] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2023-03-14 08:08:58] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2023-03-14 08:08:58] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2023-03-14 08:08:58] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2023-03-14 08:08:58] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2023-03-14 08:08:59] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2023-03-14 08:08:59] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-14 08:08:59] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1312 ms
[2023-03-14 08:08:59] [INFO ] Computed and/alt/rep : 98/230/98 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-14 08:08:59] [INFO ] Added : 76 causal constraints over 16 iterations in 307 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2690 reset in 251 ms.
Product exploration explored 100000 steps with 2676 reset in 289 ms.
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 101/101 transitions.
Applied a total of 0 rules in 7 ms. Remains 93 /93 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-14 08:09:00] [INFO ] Invariant cache hit.
[2023-03-14 08:09:00] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-14 08:09:00] [INFO ] Invariant cache hit.
[2023-03-14 08:09:00] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:09:00] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2023-03-14 08:09:00] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-14 08:09:00] [INFO ] Invariant cache hit.
[2023-03-14 08:09:00] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 661 ms. Remains : 93/93 places, 101/101 transitions.
Treatment of property ParamProductionCell-PT-4-LTLCardinality-02 finished in 9552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1)) U (p2 U (p0&&G(p3)))))'
Support contains 8 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 199/199 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 201 transition count 181
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 183 transition count 181
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 36 place count 183 transition count 162
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 74 place count 164 transition count 162
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 162 transition count 160
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 162 transition count 160
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 150 place count 126 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 125 transition count 123
Applied a total of 152 rules in 37 ms. Remains 125 /201 variables (removed 76) and now considering 123/199 (removed 76) transitions.
// Phase 1: matrix 123 rows 125 cols
[2023-03-14 08:09:00] [INFO ] Computed 32 place invariants in 2 ms
[2023-03-14 08:09:01] [INFO ] Implicit Places using invariants in 249 ms returned [11, 21, 28, 37, 45, 67, 91, 92, 109, 114]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 251 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/201 places, 123/199 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 115 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 114 transition count 122
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 26 place count 102 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 101 transition count 109
Applied a total of 28 rules in 17 ms. Remains 101 /115 variables (removed 14) and now considering 109/123 (removed 14) transitions.
// Phase 1: matrix 109 rows 101 cols
[2023-03-14 08:09:01] [INFO ] Computed 22 place invariants in 4 ms
[2023-03-14 08:09:01] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-14 08:09:01] [INFO ] Invariant cache hit.
[2023-03-14 08:09:01] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:09:01] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/201 places, 109/199 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 825 ms. Remains : 101/201 places, 109/199 transitions.
Stuttering acceptance computed with spot in 685 ms :[(OR (NOT p0) (NOT p3)), true, (NOT p1), (NOT p1), (OR (NOT p0) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3)))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p1) (AND p0 (NOT p3))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=0 dest: 5}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=0 dest: 6}, { cond=(AND p0 p3), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p2))), acceptance={} source=4 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p3) p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=4 dest: 8}, { cond=(AND p0 p3 p2), acceptance={} source=4 dest: 9}], [{ cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2 p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 p3 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 8}, { cond=(AND p0 p3 p2 (NOT p1)), acceptance={} source=5 dest: 9}, { cond=(AND p0 p3 (NOT p2) p1), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2 p1), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=6 dest: 3}, { cond=(AND p0 p3 p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p3 p2 (NOT p1)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p0) p3 p2 p1), acceptance={} source=6 dest: 10}], [{ cond=(OR (AND p0 (NOT p3)) (AND (NOT p3) p1)), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={} source=7 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=7 dest: 5}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(OR (AND p0 p3) (AND p3 p1)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) p3 (NOT p2) (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p0) p3 p2 (NOT p1)), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p0) p3 (NOT p2) p1), acceptance={} source=7 dest: 10}], [{ cond=(NOT p3), acceptance={} source=8 dest: 1}, { cond=p3, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=9 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={} source=9 dest: 8}, { cond=(AND p3 p2), acceptance={} source=9 dest: 9}], [{ cond=(OR (AND p0 (NOT p3) (NOT p1)) (AND (NOT p3) p2 (NOT p1))), acceptance={} source=10 dest: 1}, { cond=(OR (AND p0 (NOT p3) p1) (AND (NOT p3) p2 p1)), acceptance={} source=10 dest: 2}, { cond=(OR (AND p0 p3 (NOT p1)) (AND p3 p2 (NOT p1))), acceptance={} source=10 dest: 8}, { cond=(OR (AND p0 p3 p1) (AND p3 p2 p1)), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(OR (EQ s78 0) (EQ s44 1)), p1:(OR (EQ s68 0) (EQ s58 1)), p3:(OR (EQ s11 0) (EQ s21 1)), p2:(OR (EQ s74 0) (EQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 99 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-4-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLCardinality-04 finished in 1566 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)&&(X(X(p1)) U ((!p1&&X(X(p1)))||X(X(G(p1)))))))'
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 199/199 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 198 transition count 196
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 198 transition count 196
Applied a total of 6 rules in 8 ms. Remains 198 /201 variables (removed 3) and now considering 196/199 (removed 3) transitions.
// Phase 1: matrix 196 rows 198 cols
[2023-03-14 08:09:02] [INFO ] Computed 32 place invariants in 2 ms
[2023-03-14 08:09:02] [INFO ] Implicit Places using invariants in 229 ms returned [16, 30, 38, 39, 51, 67, 86, 99, 143, 144, 169, 179]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 232 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/201 places, 196/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 7 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2023-03-14 08:09:02] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-14 08:09:02] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-14 08:09:02] [INFO ] Invariant cache hit.
[2023-03-14 08:09:03] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:09:03] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/201 places, 194/199 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 917 ms. Remains : 184/201 places, 194/199 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}]], initial=0, aps=[p1:(EQ s35 1), p0:(EQ s73 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-4-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLCardinality-05 finished in 1233 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 199/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 199 transition count 197
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 199 transition count 197
Applied a total of 4 rules in 8 ms. Remains 199 /201 variables (removed 2) and now considering 197/199 (removed 2) transitions.
// Phase 1: matrix 197 rows 199 cols
[2023-03-14 08:09:03] [INFO ] Computed 32 place invariants in 2 ms
[2023-03-14 08:09:03] [INFO ] Implicit Places using invariants in 310 ms returned [16, 30, 38, 39, 51, 67, 86, 99, 144, 145, 170, 180]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 312 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/201 places, 197/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 195
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 195
Applied a total of 4 rules in 8 ms. Remains 185 /187 variables (removed 2) and now considering 195/197 (removed 2) transitions.
// Phase 1: matrix 195 rows 185 cols
[2023-03-14 08:09:03] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-14 08:09:04] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-14 08:09:04] [INFO ] Invariant cache hit.
[2023-03-14 08:09:04] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:09:04] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/201 places, 195/199 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1000 ms. Remains : 185/201 places, 195/199 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(AND (NEQ s131 0) (NEQ s105 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-4-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLCardinality-08 finished in 1189 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 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 199/199 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 201 transition count 181
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 183 transition count 181
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 36 place count 183 transition count 162
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 74 place count 164 transition count 162
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 161 transition count 159
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 161 transition count 159
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 162 place count 120 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 164 place count 119 transition count 117
Applied a total of 164 rules in 23 ms. Remains 119 /201 variables (removed 82) and now considering 117/199 (removed 82) transitions.
// Phase 1: matrix 117 rows 119 cols
[2023-03-14 08:09:04] [INFO ] Computed 32 place invariants in 1 ms
[2023-03-14 08:09:05] [INFO ] Implicit Places using invariants in 194 ms returned [12, 22, 28, 29, 38, 46, 57, 66, 87, 88, 103, 108]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 196 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/201 places, 117/199 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 106 transition count 116
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 106 transition count 115
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 105 transition count 115
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
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 38 place count 88 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 87 transition count 97
Applied a total of 40 rules in 19 ms. Remains 87 /107 variables (removed 20) and now considering 97/117 (removed 20) transitions.
// Phase 1: matrix 97 rows 87 cols
[2023-03-14 08:09:05] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-14 08:09:05] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-14 08:09:05] [INFO ] Invariant cache hit.
[2023-03-14 08:09:05] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:09:05] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/201 places, 97/199 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 612 ms. Remains : 87/201 places, 97/199 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s22 0) (EQ s7 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 6430 reset in 217 ms.
Stack based approach found an accepted trace after 13356 steps with 854 reset with depth 89 and stack size 89 in 33 ms.
FORMULA ParamProductionCell-PT-4-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLCardinality-09 finished in 920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((p0||X(G(p1)))))))))'
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 199/199 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 198 transition count 196
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 198 transition count 196
Applied a total of 6 rules in 6 ms. Remains 198 /201 variables (removed 3) and now considering 196/199 (removed 3) transitions.
// Phase 1: matrix 196 rows 198 cols
[2023-03-14 08:09:05] [INFO ] Computed 32 place invariants in 7 ms
[2023-03-14 08:09:06] [INFO ] Implicit Places using invariants in 304 ms returned [30, 38, 39, 51, 67, 86, 99, 143, 144, 169, 179]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 306 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/201 places, 196/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 6 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-14 08:09:06] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-14 08:09:06] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-14 08:09:06] [INFO ] Invariant cache hit.
[2023-03-14 08:09:06] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:09:06] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/201 places, 194/199 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 975 ms. Remains : 185/201 places, 194/199 transitions.
Stuttering acceptance computed with spot in 321 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(OR (EQ s16 0) (EQ s17 1)), p0:(AND (EQ s17 0) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-4-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLCardinality-10 finished in 1320 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)&&F(p1))))'
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 199/199 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 201 transition count 184
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 186 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 184 transition count 182
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 34 place count 184 transition count 161
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 76 place count 163 transition count 161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 79 place count 160 transition count 158
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 160 transition count 158
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 3 with 80 rules applied. Total rules applied 162 place count 120 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 164 place count 119 transition count 117
Applied a total of 164 rules in 18 ms. Remains 119 /201 variables (removed 82) and now considering 117/199 (removed 82) transitions.
// Phase 1: matrix 117 rows 119 cols
[2023-03-14 08:09:07] [INFO ] Computed 32 place invariants in 1 ms
[2023-03-14 08:09:07] [INFO ] Implicit Places using invariants in 187 ms returned [11, 26, 37, 45, 56, 65, 86, 87, 102, 107]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 189 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/201 places, 117/199 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 109 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 108 transition count 116
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 30 place count 94 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 93 transition count 101
Applied a total of 32 rules in 9 ms. Remains 93 /109 variables (removed 16) and now considering 101/117 (removed 16) transitions.
// Phase 1: matrix 101 rows 93 cols
[2023-03-14 08:09:07] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-14 08:09:07] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-14 08:09:07] [INFO ] Invariant cache hit.
[2023-03-14 08:09:07] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:09:07] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/201 places, 101/199 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 648 ms. Remains : 93/201 places, 101/199 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s29 0) (EQ s16 1)), p1:(AND (EQ s22 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1744 reset in 234 ms.
Stack based approach found an accepted trace after 623 steps with 12 reset with depth 113 and stack size 113 in 5 ms.
FORMULA ParamProductionCell-PT-4-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLCardinality-12 finished in 1077 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(X(F(p1))))))'
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 199/199 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 198 transition count 196
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 198 transition count 196
Applied a total of 6 rules in 7 ms. Remains 198 /201 variables (removed 3) and now considering 196/199 (removed 3) transitions.
// Phase 1: matrix 196 rows 198 cols
[2023-03-14 08:09:08] [INFO ] Computed 32 place invariants in 1 ms
[2023-03-14 08:09:08] [INFO ] Implicit Places using invariants in 295 ms returned [16, 30, 38, 39, 51, 67, 86, 99, 143, 169, 179]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 298 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/201 places, 196/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 7 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-14 08:09:08] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-14 08:09:08] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-03-14 08:09:08] [INFO ] Invariant cache hit.
[2023-03-14 08:09:08] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:09:09] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/201 places, 194/199 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1053 ms. Remains : 185/201 places, 194/199 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (EQ s35 0) (EQ s134 1)), p0:(OR (EQ s27 0) (EQ s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 336 ms.
Product exploration explored 100000 steps with 33333 reset in 326 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 5 factoid took 146 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-4-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-4-LTLCardinality-13 finished in 2049 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 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 199/199 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 201 transition count 182
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 184 transition count 182
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 34 place count 184 transition count 162
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 74 place count 164 transition count 162
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 161 transition count 159
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 161 transition count 159
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 164 place count 119 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 166 place count 118 transition count 116
Applied a total of 166 rules in 15 ms. Remains 118 /201 variables (removed 83) and now considering 116/199 (removed 83) transitions.
// Phase 1: matrix 116 rows 118 cols
[2023-03-14 08:09:10] [INFO ] Computed 32 place invariants in 1 ms
[2023-03-14 08:09:10] [INFO ] Implicit Places using invariants in 148 ms returned [11, 20, 26, 27, 36, 44, 55, 64, 85, 86, 101, 107]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 150 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/201 places, 116/199 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 105 transition count 115
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 105 transition count 113
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 6 place count 103 transition count 113
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
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 40 place count 86 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 85 transition count 95
Applied a total of 42 rules in 10 ms. Remains 85 /106 variables (removed 21) and now considering 95/116 (removed 21) transitions.
// Phase 1: matrix 95 rows 85 cols
[2023-03-14 08:09:10] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-14 08:09:10] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-14 08:09:10] [INFO ] Invariant cache hit.
[2023-03-14 08:09:10] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:09:10] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/201 places, 95/199 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 582 ms. Remains : 85/201 places, 95/199 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s77 0)], 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 203 ms.
Stack based approach found an accepted trace after 94 steps with 0 reset with depth 95 and stack size 95 in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLCardinality-15 finished in 863 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((X(F((p1&&F(p2))))||p0)))'
Found a Shortening insensitive property : ParamProductionCell-PT-4-LTLCardinality-00
Stuttering acceptance computed with spot in 203 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 201/201 places, 199/199 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 201 transition count 181
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 183 transition count 181
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 36 place count 183 transition count 162
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 74 place count 164 transition count 162
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 161 transition count 159
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 161 transition count 159
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 2 with 74 rules applied. Total rules applied 154 place count 124 transition count 122
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 156 place count 123 transition count 121
Applied a total of 156 rules in 23 ms. Remains 123 /201 variables (removed 78) and now considering 121/199 (removed 78) transitions.
// Phase 1: matrix 121 rows 123 cols
[2023-03-14 08:09:11] [INFO ] Computed 32 place invariants in 1 ms
[2023-03-14 08:09:11] [INFO ] Implicit Places using invariants in 230 ms returned [11, 20, 27, 28, 37, 45, 56, 90, 91, 107, 112]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 247 ms to find 11 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 112/201 places, 121/199 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 112 transition count 120
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 111 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 110 transition count 119
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 4 place count 110 transition count 117
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 8 place count 108 transition count 117
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 32 place count 96 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 95 transition count 104
Applied a total of 34 rules in 13 ms. Remains 95 /112 variables (removed 17) and now considering 104/121 (removed 17) transitions.
// Phase 1: matrix 104 rows 95 cols
[2023-03-14 08:09:11] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 08:09:11] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-14 08:09:11] [INFO ] Invariant cache hit.
[2023-03-14 08:09:12] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:09:12] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 95/201 places, 104/199 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 764 ms. Remains : 95/201 places, 104/199 transitions.
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s47 0) (EQ s17 1)), p1:(OR (EQ s47 0) (EQ s17 1)), p2:(OR (EQ s18 0) (EQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 10280 reset in 283 ms.
Product exploration explored 100000 steps with 10248 reset in 307 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 329 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 08:09:13] [INFO ] Invariant cache hit.
[2023-03-14 08:09:13] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-14 08:09:13] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-03-14 08:09:13] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-14 08:09:14] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-14 08:09:14] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:09:14] [INFO ] After 28ms SMT Verify possible using 66 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-14 08:09:14] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2023-03-14 08:09:14] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2023-03-14 08:09:14] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2023-03-14 08:09:14] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2023-03-14 08:09:14] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2023-03-14 08:09:14] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2023-03-14 08:09:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 378 ms
[2023-03-14 08:09:14] [INFO ] After 417ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2023-03-14 08:09:14] [INFO ] After 563ms 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 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND p1 (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 8 factoid took 475 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-14 08:09:15] [INFO ] Invariant cache hit.
[2023-03-14 08:09:15] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-14 08:09:15] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-14 08:09:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:09:15] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2023-03-14 08:09:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:09:15] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-14 08:09:15] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-14 08:09:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:09:15] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-14 08:09:15] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:09:15] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2023-03-14 08:09:15] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2023-03-14 08:09:15] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2023-03-14 08:09:15] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2023-03-14 08:09:15] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2023-03-14 08:09:15] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2023-03-14 08:09:15] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2023-03-14 08:09:16] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2023-03-14 08:09:16] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2023-03-14 08:09:16] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2023-03-14 08:09:16] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2023-03-14 08:09:16] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2023-03-14 08:09:16] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2023-03-14 08:09:16] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2023-03-14 08:09:16] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-14 08:09:16] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 2 ms to minimize.
[2023-03-14 08:09:16] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
[2023-03-14 08:09:16] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1063 ms
[2023-03-14 08:09:16] [INFO ] Computed and/alt/rep : 101/219/101 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-14 08:09:16] [INFO ] Added : 90 causal constraints over 18 iterations in 246 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 95 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 104/104 transitions.
Applied a total of 0 rules in 4 ms. Remains 95 /95 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2023-03-14 08:09:16] [INFO ] Invariant cache hit.
[2023-03-14 08:09:16] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-14 08:09:16] [INFO ] Invariant cache hit.
[2023-03-14 08:09:17] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:09:17] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2023-03-14 08:09:17] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-14 08:09:17] [INFO ] Invariant cache hit.
[2023-03-14 08:09:17] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 575 ms. Remains : 95/95 places, 104/104 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 230 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-14 08:09:17] [INFO ] Invariant cache hit.
[2023-03-14 08:09:18] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-14 08:09:18] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-14 08:09:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:09:18] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2023-03-14 08:09:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:09:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-14 08:09:18] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-14 08:09:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:09:18] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2023-03-14 08:09:18] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:09:18] [INFO ] [Nat]Added 66 Read/Feed constraints in 16 ms returned sat
[2023-03-14 08:09:18] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2023-03-14 08:09:18] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2023-03-14 08:09:18] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2023-03-14 08:09:18] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2023-03-14 08:09:18] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2023-03-14 08:09:18] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2023-03-14 08:09:18] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2023-03-14 08:09:18] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2023-03-14 08:09:19] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2023-03-14 08:09:19] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2023-03-14 08:09:19] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2023-03-14 08:09:19] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2023-03-14 08:09:19] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2023-03-14 08:09:19] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2023-03-14 08:09:19] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 0 ms to minimize.
[2023-03-14 08:09:19] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2023-03-14 08:09:19] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1077 ms
[2023-03-14 08:09:19] [INFO ] Computed and/alt/rep : 101/219/101 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-14 08:09:19] [INFO ] Added : 90 causal constraints over 18 iterations in 350 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10275 reset in 248 ms.
Product exploration explored 100000 steps with 10230 reset in 281 ms.
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 104/104 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 93 transition count 102
Applied a total of 4 rules in 6 ms. Remains 93 /95 variables (removed 2) and now considering 102/104 (removed 2) transitions.
// Phase 1: matrix 102 rows 93 cols
[2023-03-14 08:09:20] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 08:09:20] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-14 08:09:20] [INFO ] Invariant cache hit.
[2023-03-14 08:09:20] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:09:20] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2023-03-14 08:09:20] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-14 08:09:20] [INFO ] Invariant cache hit.
[2023-03-14 08:09:21] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/95 places, 102/104 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 643 ms. Remains : 93/95 places, 102/104 transitions.
Treatment of property ParamProductionCell-PT-4-LTLCardinality-00 finished in 10059 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)&&(F(p1)||X(F(p2))))))'
[2023-03-14 08:09:21] [INFO ] Flatten gal took : 28 ms
[2023-03-14 08:09:21] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-14 08:09:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 201 places, 199 transitions and 660 arcs took 6 ms.
Total runtime 44431 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ParamProductionCell-PT-4
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLCardinality

FORMULA ParamProductionCell-PT-4-LTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-4-LTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678781406491

--------------------
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/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 6 (type EXCL) for 3 ParamProductionCell-PT-4-LTLCardinality-02
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 6 (type EXCL) for ParamProductionCell-PT-4-LTLCardinality-02
lola: result : true
lola: markings : 6248
lola: fired transitions : 8890
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 8 (type EXCL) for 3 ParamProductionCell-PT-4-LTLCardinality-02
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-4-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-4-LTLCardinality-02: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 5/1800 6/32 ParamProductionCell-PT-4-LTLCardinality-02 814983 m, 162996 m/sec, 2546567 t fired, .

Time elapsed: 5 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-4-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-4-LTLCardinality-02: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 10/1800 12/32 ParamProductionCell-PT-4-LTLCardinality-02 1580958 m, 153195 m/sec, 5222595 t fired, .

Time elapsed: 10 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-4-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-4-LTLCardinality-02: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 15/1800 16/32 ParamProductionCell-PT-4-LTLCardinality-02 2215265 m, 126861 m/sec, 7865461 t fired, .

Time elapsed: 15 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-4-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-4-LTLCardinality-02: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 20/1800 19/32 ParamProductionCell-PT-4-LTLCardinality-02 2760354 m, 109017 m/sec, 10579096 t fired, .

Time elapsed: 20 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-4-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-4-LTLCardinality-02: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 25/1800 23/32 ParamProductionCell-PT-4-LTLCardinality-02 3373358 m, 122600 m/sec, 13369982 t fired, .

Time elapsed: 25 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-4-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-4-LTLCardinality-02: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 30/1800 26/32 ParamProductionCell-PT-4-LTLCardinality-02 3921281 m, 109584 m/sec, 16308455 t fired, .

Time elapsed: 30 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-4-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-4-LTLCardinality-02: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 35/1800 29/32 ParamProductionCell-PT-4-LTLCardinality-02 4365589 m, 88861 m/sec, 19214443 t fired, .

Time elapsed: 35 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-4-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-4-LTLCardinality-02: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 40/1800 31/32 ParamProductionCell-PT-4-LTLCardinality-02 4699902 m, 66862 m/sec, 21941206 t fired, .

Time elapsed: 40 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
lola: FINISHED task # 8 (type EXCL) for ParamProductionCell-PT-4-LTLCardinality-02
lola: result : true
lola: markings : 4715344
lola: fired transitions : 23781711
lola: time used : 44.000000
lola: memory pages used : 31
lola: LAUNCH task # 1 (type EXCL) for 0 ParamProductionCell-PT-4-LTLCardinality-00
lola: time limit : 3556 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ParamProductionCell-PT-4-LTLCardinality-00
lola: result : true
lola: markings : 4832
lola: fired transitions : 13860
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-4-LTLCardinality-00: LTL true LTL model checker
ParamProductionCell-PT-4-LTLCardinality-02: CONJ true CONJ


Time elapsed: 44 secs. Pages in use: 31

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

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