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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.2K Feb 26 05:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 05:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 05:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 05:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 05:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 26 05:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 05:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 05:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.3K 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 RobotManipulation-PT-01000-LTLCardinality-00
FORMULA_NAME RobotManipulation-PT-01000-LTLCardinality-01
FORMULA_NAME RobotManipulation-PT-01000-LTLCardinality-02
FORMULA_NAME RobotManipulation-PT-01000-LTLCardinality-03
FORMULA_NAME RobotManipulation-PT-01000-LTLCardinality-04
FORMULA_NAME RobotManipulation-PT-01000-LTLCardinality-05
FORMULA_NAME RobotManipulation-PT-01000-LTLCardinality-06
FORMULA_NAME RobotManipulation-PT-01000-LTLCardinality-07
FORMULA_NAME RobotManipulation-PT-01000-LTLCardinality-08
FORMULA_NAME RobotManipulation-PT-01000-LTLCardinality-09
FORMULA_NAME RobotManipulation-PT-01000-LTLCardinality-10
FORMULA_NAME RobotManipulation-PT-01000-LTLCardinality-11
FORMULA_NAME RobotManipulation-PT-01000-LTLCardinality-12
FORMULA_NAME RobotManipulation-PT-01000-LTLCardinality-13
FORMULA_NAME RobotManipulation-PT-01000-LTLCardinality-14
FORMULA_NAME RobotManipulation-PT-01000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678995440114

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=RobotManipulation-PT-01000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-16 19:37:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 19:37:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 19:37:24] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2023-03-16 19:37:24] [INFO ] Transformed 15 places.
[2023-03-16 19:37:24] [INFO ] Transformed 11 transitions.
[2023-03-16 19:37:24] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 347 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA RobotManipulation-PT-01000-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-01000-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 18 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 15 cols
[2023-03-16 19:37:24] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-16 19:37:24] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-03-16 19:37:24] [INFO ] Invariant cache hit.
[2023-03-16 19:37:24] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-03-16 19:37:24] [INFO ] Invariant cache hit.
[2023-03-16 19:37:25] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 443 ms. Remains : 15/15 places, 11/11 transitions.
Support contains 15 out of 15 places after structural reductions.
[2023-03-16 19:37:25] [INFO ] Flatten gal took : 30 ms
[2023-03-16 19:37:25] [INFO ] Flatten gal took : 7 ms
[2023-03-16 19:37:25] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 10010 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 22) seen :11
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-16 19:37:25] [INFO ] Invariant cache hit.
[2023-03-16 19:37:26] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 19:37:26] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 19:37:26] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 19:37:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 19:37:26] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 19:37:26] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-16 19:37:26] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-16 19:37:26] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 8000 steps, including 0 resets, run visited all 2 properties in 235 ms. (steps per millisecond=34 )
Parikh walk visited 2 properties in 256 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 14 transition count 8
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 11 transition count 8
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 9 place count 10 transition count 7
Applied a total of 9 rules in 17 ms. Remains 10 /15 variables (removed 5) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-16 19:37:27] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 19:37:27] [INFO ] Implicit Places using invariants in 57 ms returned [4, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 61 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/15 places, 7/11 transitions.
Graph (trivial) has 3 edges and 8 vertex of which 2 / 8 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 7 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 5 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 4 transition count 4
Applied a total of 6 rules in 11 ms. Remains 4 /8 variables (removed 4) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-16 19:37:27] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-16 19:37:27] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-16 19:37:27] [INFO ] Invariant cache hit.
[2023-03-16 19:37:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 19:37:27] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/15 places, 4/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 159 ms. Remains : 4/15 places, 4/11 transitions.
Stuttering acceptance computed with spot in 289 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-01000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 3 ms.
FORMULA RobotManipulation-PT-01000-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-01000-LTLCardinality-00 finished in 556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(F(p1)))))))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-16 19:37:27] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 19:37:27] [INFO ] Implicit Places using invariants in 51 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 11 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 10
Applied a total of 2 rules in 3 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2023-03-16 19:37:27] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-16 19:37:27] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-16 19:37:27] [INFO ] Invariant cache hit.
[2023-03-16 19:37:27] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 11/15 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137 ms. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-01000-LTLCardinality-01 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=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(GT 1 s8), p1:(GT 2 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 471 ms.
Product exploration explored 100000 steps with 33333 reset in 340 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)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-01000-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-01000-LTLCardinality-01 finished in 1305 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((p0||(p1 U p2))))))'
Support contains 6 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-16 19:37:28] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 19:37:28] [INFO ] Implicit Places using invariants in 52 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 344 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : RobotManipulation-PT-01000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p2:(AND (GT s11 s4) (LEQ 3 s0)), p1:(LEQ s9 s11), p0:(AND (LEQ s11 s4) (LEQ s1 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 252 ms.
Product exploration explored 100000 steps with 25000 reset in 231 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 p2) (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Incomplete random walk after 10010 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1668 ) properties (out of 4) seen :3
Finished Best-First random walk after 90 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), true]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND p1 (NOT p2))), (F (AND p1 (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 2 factoid took 260 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Stuttering acceptance computed with spot in 307 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 12 cols
[2023-03-16 19:37:31] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-16 19:37:31] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-16 19:37:31] [INFO ] Invariant cache hit.
[2023-03-16 19:37:31] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-16 19:37:31] [INFO ] Invariant cache hit.
[2023-03-16 19:37:31] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 12/12 places, 11/11 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 p1) (NOT p2) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Incomplete random walk after 10010 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1668 ) properties (out of 4) seen :3
Finished Best-First random walk after 28 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), true]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND p1 (NOT p2))), (F (AND p1 (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 2 factoid took 260 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Stuttering acceptance computed with spot in 295 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Stuttering acceptance computed with spot in 298 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Product exploration explored 100000 steps with 25000 reset in 145 ms.
Product exploration explored 100000 steps with 25000 reset in 196 ms.
Applying partial POR strategy [true, true, false, false, false, true]
Stuttering acceptance computed with spot in 303 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 11/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 12 transition count 11
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 4 rules in 6 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
[2023-03-16 19:37:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2023-03-16 19:37:33] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-16 19:37:33] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/12 places, 10/11 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62 ms. Remains : 11/12 places, 10/11 transitions.
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 12 cols
[2023-03-16 19:37:33] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-16 19:37:33] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-16 19:37:33] [INFO ] Invariant cache hit.
[2023-03-16 19:37:33] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-16 19:37:33] [INFO ] Invariant cache hit.
[2023-03-16 19:37:34] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 12/12 places, 11/11 transitions.
Treatment of property RobotManipulation-PT-01000-LTLCardinality-02 finished in 5188 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||G(p1)))))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 rules applied. Total rules applied 2 place count 14 transition count 10
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 4 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 12 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 12 transition count 8
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 7 place count 11 transition count 8
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 9 place count 10 transition count 7
Applied a total of 9 rules in 6 ms. Remains 10 /15 variables (removed 5) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-16 19:37:34] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 19:37:34] [INFO ] Implicit Places using invariants in 60 ms returned [4, 8, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 62 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/15 places, 7/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 7 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 5 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 4 transition count 6
Applied a total of 5 rules in 4 ms. Remains 4 /7 variables (removed 3) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 4 cols
[2023-03-16 19:37:34] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-16 19:37:34] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-16 19:37:34] [INFO ] Invariant cache hit.
[2023-03-16 19:37:34] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/15 places, 6/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 138 ms. Remains : 4/15 places, 6/11 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RobotManipulation-PT-01000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT 1 s3), p0:(GT 3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9 reset in 177 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 21 in 1 ms.
FORMULA RobotManipulation-PT-01000-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-01000-LTLCardinality-03 finished in 475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&X(G(p1))))))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-16 19:37:34] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 19:37:34] [INFO ] Implicit Places using invariants in 43 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 11 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 10
Applied a total of 2 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2023-03-16 19:37:34] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-16 19:37:34] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-16 19:37:34] [INFO ] Invariant cache hit.
[2023-03-16 19:37:34] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 11/15 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : RobotManipulation-PT-01000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(GT 3 s6), p0:(GT 1 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 182 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-01000-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-01000-LTLCardinality-04 finished in 386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 14 transition count 8
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 11 transition count 8
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 9 place count 10 transition count 7
Applied a total of 9 rules in 6 ms. Remains 10 /15 variables (removed 5) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-16 19:37:34] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-16 19:37:34] [INFO ] Implicit Places using invariants in 41 ms returned [4, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/15 places, 7/11 transitions.
Graph (trivial) has 2 edges and 8 vertex of which 2 / 8 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 7 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 5 transition count 5
Applied a total of 4 rules in 9 ms. Remains 5 /8 variables (removed 3) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-16 19:37:34] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-16 19:37:35] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-16 19:37:35] [INFO ] Invariant cache hit.
[2023-03-16 19:37:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 19:37:35] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/15 places, 5/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 125 ms. Remains : 5/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-01000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s0 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 183 steps with 0 reset in 1 ms.
FORMULA RobotManipulation-PT-01000-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-01000-LTLCardinality-05 finished in 245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((p1||G(p2)))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 12 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 12 transition count 9
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 6 place count 11 transition count 9
Applied a total of 6 rules in 5 ms. Remains 11 /15 variables (removed 4) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 11 cols
[2023-03-16 19:37:35] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 19:37:35] [INFO ] Implicit Places using invariants in 39 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/15 places, 9/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47 ms. Remains : 9/15 places, 9/11 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RobotManipulation-PT-01000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s6), p1:(LEQ 2 s4), p2:(LEQ 2 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22991 reset in 156 ms.
Stack based approach found an accepted trace after 149 steps with 40 reset with depth 5 and stack size 5 in 1 ms.
FORMULA RobotManipulation-PT-01000-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-01000-LTLCardinality-06 finished in 331 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||X((G((p1&&X(p2))) U (p0&&G((p1&&X(p2))))))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-16 19:37:35] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 19:37:35] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-16 19:37:35] [INFO ] Invariant cache hit.
[2023-03-16 19:37:35] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-16 19:37:35] [INFO ] Invariant cache hit.
[2023-03-16 19:37:35] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/15 places, 11/11 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 14/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p0), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : RobotManipulation-PT-01000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1 p2), acceptance={0} source=4 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ s11 s9), p2:(LEQ 2 s5), p0:(LEQ 3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-01000-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-01000-LTLCardinality-07 finished in 431 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 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 12 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 12 transition count 9
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 6 place count 11 transition count 9
Applied a total of 6 rules in 2 ms. Remains 11 /15 variables (removed 4) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 11 cols
[2023-03-16 19:37:35] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-16 19:37:35] [INFO ] Implicit Places using invariants in 29 ms returned [5, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/15 places, 9/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 8
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 8
Applied a total of 2 rules in 3 ms. Remains 8 /9 variables (removed 1) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-16 19:37:35] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-16 19:37:36] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-16 19:37:36] [INFO ] Invariant cache hit.
[2023-03-16 19:37:36] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/15 places, 8/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 124 ms. Remains : 8/15 places, 8/11 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-01000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT 3 s6) (OR (GT s0 s5) (GT 3 s3)))], 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 103 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 28 in 1 ms.
FORMULA RobotManipulation-PT-01000-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-01000-LTLCardinality-09 finished in 295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((p1||(p1 U p2)))))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2023-03-16 19:37:36] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 19:37:36] [INFO ] Implicit Places using invariants in 35 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37 ms. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-01000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 3 s3), p1:(LEQ s9 s2), p2:(GT 2 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 113 ms.
Product exploration explored 100000 steps with 50000 reset in 118 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 (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p2))))
Knowledge based reduction with 8 factoid took 180 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-01000-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-01000-LTLCardinality-10 finished in 673 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(G((F(!p0)||G(p1)))))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 2 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-16 19:37:36] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-16 19:37:36] [INFO ] Implicit Places using invariants in 40 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 47 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 11 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 10
Applied a total of 2 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2023-03-16 19:37:36] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-16 19:37:36] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-16 19:37:36] [INFO ] Invariant cache hit.
[2023-03-16 19:37:37] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 11/15 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 135 ms. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 265 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : RobotManipulation-PT-01000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 2 s6), p1:(LEQ s7 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 621 reset in 166 ms.
Stack based approach found an accepted trace after 6346 steps with 45 reset with depth 160 and stack size 156 in 12 ms.
FORMULA RobotManipulation-PT-01000-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-01000-LTLCardinality-11 finished in 604 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((X(G(!p0))||(X(X(!p0))&&G(!p1)))))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2023-03-16 19:37:37] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 19:37:37] [INFO ] Implicit Places using invariants in 54 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 56 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 10 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 10
Applied a total of 2 rules in 2 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2023-03-16 19:37:37] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-16 19:37:37] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-16 19:37:37] [INFO ] Invariant cache hit.
[2023-03-16 19:37:37] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 10/15 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 128 ms. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, p0, p0, (OR p0 p1), p0]
Running random walk in product with property : RobotManipulation-PT-01000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(OR p1 p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(GT 3 s6), p0:(GT 3 s4)], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24209 steps with 0 reset in 39 ms.
FORMULA RobotManipulation-PT-01000-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-01000-LTLCardinality-12 finished in 424 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((F(p1)&&p0)))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 11 transition count 8
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 8 place count 10 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 8 transition count 6
Applied a total of 12 rules in 6 ms. Remains 8 /15 variables (removed 7) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-16 19:37:37] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 19:37:37] [INFO ] Implicit Places using invariants in 32 ms returned [6, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/15 places, 6/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 5 transition count 5
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 5
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 5 transition count 5
Applied a total of 3 rules in 3 ms. Remains 5 /6 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-16 19:37:37] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-16 19:37:38] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-16 19:37:38] [INFO ] Invariant cache hit.
[2023-03-16 19:37:38] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/15 places, 5/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 103 ms. Remains : 5/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-01000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(LEQ 3 s1), p0:(AND (LEQ 2 s3) (GT 3 s1))], 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, null][true, true]]
Product exploration explored 100000 steps with 2502 reset in 125 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA RobotManipulation-PT-01000-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-01000-LTLCardinality-13 finished in 348 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(G(p0)))))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 2 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2023-03-16 19:37:38] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-16 19:37:38] [INFO ] Implicit Places using invariants in 42 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 10 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 10
Applied a total of 2 rules in 2 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2023-03-16 19:37:38] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-16 19:37:38] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-16 19:37:38] [INFO ] Invariant cache hit.
[2023-03-16 19:37:38] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 10/15 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 115 ms. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 243 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-01000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(GT s0 s2)], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-01000-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-01000-LTLCardinality-14 finished in 378 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((p0||(p1 U p2))))))'
[2023-03-16 19:37:38] [INFO ] Flatten gal took : 6 ms
[2023-03-16 19:37:38] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-16 19:37:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 15 places, 11 transitions and 34 arcs took 0 ms.
Total runtime 14951 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT RobotManipulation-PT-01000
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

FORMULA RobotManipulation-PT-01000-LTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678995459885

--------------------
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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 RobotManipulation-PT-01000-LTLCardinality-02
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for RobotManipulation-PT-01000-LTLCardinality-02
lola: result : true
lola: markings : 7
lola: fired transitions : 7
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
RobotManipulation-PT-01000-LTLCardinality-02: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RobotManipulation-PT-01000"
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 RobotManipulation-PT-01000, 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 r359-smll-167891808400075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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