Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r351-tall-171679101800157.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is RobotManipulation-PT-10000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-tall-171679101800157
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 8.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 18:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 18:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 11 18:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 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-10000-LTLCardinality-00
FORMULA_NAME RobotManipulation-PT-10000-LTLCardinality-01
FORMULA_NAME RobotManipulation-PT-10000-LTLCardinality-02
FORMULA_NAME RobotManipulation-PT-10000-LTLCardinality-03
FORMULA_NAME RobotManipulation-PT-10000-LTLCardinality-04
FORMULA_NAME RobotManipulation-PT-10000-LTLCardinality-05
FORMULA_NAME RobotManipulation-PT-10000-LTLCardinality-06
FORMULA_NAME RobotManipulation-PT-10000-LTLCardinality-07
FORMULA_NAME RobotManipulation-PT-10000-LTLCardinality-08
FORMULA_NAME RobotManipulation-PT-10000-LTLCardinality-09
FORMULA_NAME RobotManipulation-PT-10000-LTLCardinality-10
FORMULA_NAME RobotManipulation-PT-10000-LTLCardinality-11
FORMULA_NAME RobotManipulation-PT-10000-LTLCardinality-12
FORMULA_NAME RobotManipulation-PT-10000-LTLCardinality-13
FORMULA_NAME RobotManipulation-PT-10000-LTLCardinality-14
FORMULA_NAME RobotManipulation-PT-10000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716858991691

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RobotManipulation-PT-10000
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-28 01:16:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 01:16:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 01:16:33] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2024-05-28 01:16:33] [INFO ] Transformed 15 places.
[2024-05-28 01:16:33] [INFO ] Transformed 11 transitions.
[2024-05-28 01:16:33] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 78 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA RobotManipulation-PT-10000-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 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 10 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 15 cols
[2024-05-28 01:16:33] [INFO ] Computed 6 invariants in 7 ms
[2024-05-28 01:16:33] [INFO ] Implicit Places using invariants in 119 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 145 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 14/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 156 ms. Remains : 14/15 places, 11/11 transitions.
Support contains 14 out of 14 places after structural reductions.
[2024-05-28 01:16:34] [INFO ] Flatten gal took : 13 ms
[2024-05-28 01:16:34] [INFO ] Flatten gal took : 4 ms
[2024-05-28 01:16:34] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 20002 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=1000 ) properties (out of 31) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 30) seen :20
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 11 rows 14 cols
[2024-05-28 01:16:34] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 01:16:34] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-28 01:16:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-28 01:16:34] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 01:16:34] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2024-05-28 01:16:34] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-28 01:16:34] [INFO ] After 102ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 8 Parikh solutions to 7 different solutions.
Finished Parikh walk after 40003 steps, including 0 resets, run visited all 1 properties in 33 ms. (steps per millisecond=1212 )
Parikh walk visited 6 properties in 1540 ms.
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 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 5 rules applied. Total rules applied 5 place count 12 transition count 8
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 9 transition count 7
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 10 place count 8 transition count 7
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 7 transition count 6
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 7 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 7 transition count 5
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 14 place count 6 transition count 5
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 2 with 2 rules applied. Total rules applied 16 place count 5 transition count 5
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 5 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 5 transition count 3
Applied a total of 18 rules in 7 ms. Remains 5 /14 variables (removed 9) and now considering 3/11 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 5/14 places, 3/11 transitions.
Incomplete random walk after 20001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=3333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 89997 steps, run visited all 1 properties in 143 ms. (steps per millisecond=629 )
Probabilistic random walk after 89997 steps, saw 63329 distinct states, run finished after 143 ms. (steps per millisecond=629 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
FORMULA RobotManipulation-PT-10000-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 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 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
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 11 transition count 10
Applied a total of 4 rules in 1 ms. Remains 11 /14 variables (removed 3) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2024-05-28 01:16:36] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 01:16:36] [INFO ] Implicit Places using invariants in 27 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/14 places, 10/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30 ms. Remains : 10/14 places, 10/11 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 317 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLCardinality-00 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 s7 s0)], 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 3 steps with 0 reset in 1 ms.
FORMULA RobotManipulation-PT-10000-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-LTLCardinality-00 finished in 400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F((p1||G(p2)))))))'
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 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 13 transition count 11
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 12 transition count 10
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 10
Applied a total of 3 rules in 1 ms. Remains 12 /14 variables (removed 2) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 12 cols
[2024-05-28 01:16:36] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 01:16:36] [INFO ] Implicit Places using invariants in 30 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/14 places, 10/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33 ms. Remains : 11/14 places, 10/11 transitions.
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-10000-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(GT 2 s6), p2:(GT s3 s10), p1:(GT s5 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 176 ms.
Product exploration explored 100000 steps with 50000 reset in 104 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 p2) (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 18 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-10000-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-10000-LTLCardinality-01 finished in 676 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 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 13 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 12 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 11 transition count 9
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 7 place count 10 transition count 8
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 3 with 2 rules applied. Total rules applied 9 place count 9 transition count 8
Applied a total of 9 rules in 4 ms. Remains 9 /14 variables (removed 5) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 9 cols
[2024-05-28 01:16:37] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 01:16:37] [INFO ] Implicit Places using invariants in 60 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/14 places, 8/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 8 transition count 7
Deduced a syphon composed of 1 places in 2 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 6 transition count 7
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 5 place count 5 transition count 6
Applied a total of 5 rules in 4 ms. Remains 5 /8 variables (removed 3) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 5 cols
[2024-05-28 01:16:37] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 01:16:37] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 01:16:37] [INFO ] Invariant cache hit.
[2024-05-28 01:16:37] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/14 places, 6/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 136 ms. Remains : 5/14 places, 6/11 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ 2 s4) (LEQ 3 s0))], 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 11230 reset in 118 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA RobotManipulation-PT-10000-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-10000-LTLCardinality-02 finished in 325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((p1||(p2&&G(p3)))))))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 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 12 transition count 11
Applied a total of 2 rules in 2 ms. Remains 12 /14 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 12 cols
[2024-05-28 01:16:37] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 01:16:38] [INFO ] Implicit Places using invariants in 54 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 11/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 446 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p3) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : RobotManipulation-PT-10000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(OR (AND p1 p3) (AND p2 p3)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LEQ 3 s4), p2:(LEQ 2 s9), p3:(LEQ 3 s7), p0:(LEQ s8 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]]
Product exploration explored 100000 steps with 0 reset in 103 ms.
Product exploration explored 100000 steps with 0 reset in 245 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 p2 (NOT p3) p0), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1) p2 p3))), true, (X (X (NOT (OR (AND p1 p3) (AND p2 p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X p1)), (X (X (OR (AND (NOT p1) (NOT p2)) (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 97 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p3) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 20002 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=4000 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 11 rows 11 cols
[2024-05-28 01:16:39] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 01:16:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 01:16:39] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 01:16:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 01:16:39] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-28 01:16:39] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-28 01:16:39] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 119954 steps, including 1 resets, run visited all 3 properties in 573 ms. (steps per millisecond=209 )
Parikh walk visited 3 properties in 573 ms.
Knowledge obtained : [(AND p1 p2 (NOT p3) p0), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1) p2 p3))), true, (X (X (NOT (OR (AND p1 p3) (AND p2 p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X p1)), (X (X (OR (AND (NOT p1) (NOT p2)) (NOT p3))))]
False Knowledge obtained : [(F (OR (AND p1 p3) (AND p2 p3))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p3)))), (F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))), (F (AND (NOT p1) p2 p3)), (F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))
Knowledge based reduction with 10 factoid took 139 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-10000-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-10000-LTLCardinality-03 finished in 2000 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 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 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
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 11 transition count 10
Applied a total of 4 rules in 2 ms. Remains 11 /14 variables (removed 3) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2024-05-28 01:16:39] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 01:16:39] [INFO ] Implicit Places using invariants in 19 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/14 places, 10/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22 ms. Remains : 10/14 places, 10/11 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 41 ms.
Product exploration explored 100000 steps with 50000 reset in 47 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-10000-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-10000-LTLCardinality-04 finished in 212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 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 12 transition count 11
Applied a total of 2 rules in 1 ms. Remains 12 /14 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 12 cols
[2024-05-28 01:16:40] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 01:16:40] [INFO ] Implicit Places using invariants in 23 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25 ms. Remains : 11/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-10000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(LEQ 3 s3), p1:(LEQ s10 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 79 ms.
Stack based approach found an accepted trace after 95 steps with 0 reset with depth 96 and stack size 96 in 0 ms.
FORMULA RobotManipulation-PT-10000-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-10000-LTLCardinality-05 finished in 243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U X((p1 U !p0))))||G((G(p2)||X(p3)))))'
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2024-05-28 01:16:40] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 01:16:40] [INFO ] Implicit Places using invariants in 26 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 13/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29 ms. Remains : 13/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 761 ms :[true, (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p3) (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p2)), (NOT p2), p0, p0]
Running random walk in product with property : RobotManipulation-PT-10000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) p3), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p0 p3), acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p0) p3), acceptance={} source=2 dest: 6}, { cond=(AND p2 p0 p3), acceptance={} source=2 dest: 7}, { cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 13}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 14}], [{ cond=(AND (NOT p2) (NOT p0) p3), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p0 p3), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p0) p3), acceptance={} source=3 dest: 6}, { cond=(AND p2 p0 p3), acceptance={} source=3 dest: 7}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=3 dest: 8}, { cond=(AND p2 p0 (NOT p3)), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={} source=3 dest: 13}, { cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 14}], [{ cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p0 p3 p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 p0 p3 p1), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) p0 p3 (NOT p1)), acceptance={} source=4 dest: 10}, { cond=(AND p2 p0 p3 (NOT p1)), acceptance={} source=4 dest: 11}, { cond=(AND p0 (NOT p3) p1), acceptance={} source=4 dest: 14}], [{ cond=(AND (NOT p2) p0 p3), acceptance={} source=5 dest: 5}, { cond=(AND p2 p0 p3), acceptance={} source=5 dest: 7}, { cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 13}], [{ cond=(AND (NOT p2) p0 (NOT p3) (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p2) p0 p3 p1), acceptance={} source=6 dest: 4}, { cond=(AND p2 p0 p3 p1), acceptance={} source=6 dest: 6}, { cond=(AND p2 p0 (NOT p3) p1), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p2) p0 p3 (NOT p1)), acceptance={} source=6 dest: 10}, { cond=(AND p2 p0 p3 (NOT p1)), acceptance={} source=6 dest: 11}, { cond=(AND p2 p0 (NOT p3) (NOT p1)), acceptance={} source=6 dest: 12}, { cond=(AND (NOT p2) p0 (NOT p3) p1), acceptance={} source=6 dest: 14}], [{ cond=(AND (NOT p2) p0 p3), acceptance={} source=7 dest: 5}, { cond=(AND p2 p0 p3), acceptance={} source=7 dest: 7}, { cond=(AND p2 p0 (NOT p3)), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={} source=7 dest: 13}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=8 dest: 0}, { cond=(AND p2 p0 p1), acceptance={} source=8 dest: 8}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=8 dest: 12}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=8 dest: 14}], [{ cond=(AND p2 p0), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p2) p0), acceptance={} source=9 dest: 13}], [{ cond=(NOT p3), acceptance={} source=10 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=10 dest: 10}, { cond=(AND p2 p3), acceptance={} source=10 dest: 11}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=11 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=11 dest: 10}, { cond=(AND p2 p3), acceptance={} source=11 dest: 11}, { cond=(AND p2 (NOT p3)), acceptance={} source=11 dest: 12}], [{ cond=(NOT p2), acceptance={} source=12 dest: 0}, { cond=p2, acceptance={} source=12 dest: 12}], [{ cond=p0, acceptance={0} source=13 dest: 13}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=14 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=14 dest: 14}]], initial=1, aps=[p2:(LEQ 2 s0), p0:(LEQ 2 s3), p3:(LEQ s8 s12), p1:(LEQ s6 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 85 ms.
Product exploration explored 100000 steps with 33333 reset in 82 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 p0) p3 p1), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p2 p0 (NOT p3)))), (X (NOT (AND (NOT p2) p0 (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p2 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) p0 p3))), (X (NOT (AND p2 p0 p3))), (X (AND (NOT p2) (NOT p0) p3)), (X (NOT (AND p2 (NOT p0) p3))), (X (X (NOT (AND p2 p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 p3 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p3) p1)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p0 p3 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p3)))), (X (X (NOT (AND p2 p0 p3)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p0 p3 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p3) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p3 p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 35 factoid took 27 ms. Reduced automaton from 15 states, 56 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-10000-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-10000-LTLCardinality-06 finished in 1019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 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 12 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 10 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 10 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 9 transition count 8
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 8 transition count 7
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 8 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 8 transition count 6
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 12 place count 7 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 2 with 2 rules applied. Total rules applied 14 place count 6 transition count 6
Applied a total of 14 rules in 7 ms. Remains 6 /14 variables (removed 8) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-05-28 01:16:41] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 01:16:41] [INFO ] Implicit Places using invariants in 22 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/14 places, 6/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4 transition count 4
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4 transition count 4
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 3 transition count 3
Ensure Unique test removed 1 places
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 2 transition count 2
Applied a total of 6 rules in 2 ms. Remains 2 /5 variables (removed 3) and now considering 2/6 (removed 4) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-28 01:16:41] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 01:16:41] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 01:16:41] [INFO ] Invariant cache hit.
[2024-05-28 01:16:41] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/14 places, 2/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 78 ms. Remains : 2/14 places, 2/11 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLCardinality-07 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:(GT 3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 264 reset in 42 ms.
Stack based approach found an accepted trace after 31 steps with 1 reset with depth 11 and stack size 7 in 0 ms.
FORMULA RobotManipulation-PT-10000-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-10000-LTLCardinality-07 finished in 237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 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 12 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 10 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 10 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 9 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 10 place count 8 transition count 7
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 2 with 2 rules applied. Total rules applied 12 place count 7 transition count 7
Applied a total of 12 rules in 15 ms. Remains 7 /14 variables (removed 7) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 7 cols
[2024-05-28 01:16:41] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 01:16:41] [INFO ] Implicit Places using invariants in 31 ms returned [3, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/14 places, 7/11 transitions.
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 2 place count 4 transition count 6
Applied a total of 2 rules in 2 ms. Remains 4 /5 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 4 cols
[2024-05-28 01:16:41] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 01:16:41] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 01:16:41] [INFO ] Invariant cache hit.
[2024-05-28 01:16:41] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/14 places, 6/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 93 ms. Remains : 4/14 places, 6/11 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-10000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s3), p1:(GT 2 s2)], nbAcceptance=2, 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 75 ms.
Stack based approach found an accepted trace after 66 steps with 0 reset with depth 67 and stack size 27 in 2 ms.
FORMULA RobotManipulation-PT-10000-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-10000-LTLCardinality-08 finished in 244 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1)) U X(p1)))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 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 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
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 11 transition count 10
Applied a total of 4 rules in 2 ms. Remains 11 /14 variables (removed 3) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2024-05-28 01:16:41] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 01:16:41] [INFO ] Implicit Places using invariants in 19 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 20 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/14 places, 10/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23 ms. Remains : 10/14 places, 10/11 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(OR p1 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s6 s3), p0:(LEQ s2 s3)], 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 85 ms.
Product exploration explored 100000 steps with 50000 reset in 63 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 (NOT (AND (NOT p1) p0))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 19 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-10000-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-10000-LTLCardinality-10 finished in 468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(!p1)))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 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 13 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 12 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 11 transition count 9
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 7 place count 10 transition count 8
Applied a total of 7 rules in 5 ms. Remains 10 /14 variables (removed 4) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 10 cols
[2024-05-28 01:16:42] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 01:16:42] [INFO ] Implicit Places using invariants in 24 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/14 places, 8/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 9 transition count 7
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 7 transition count 7
Applied a total of 3 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 7 cols
[2024-05-28 01:16:42] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 01:16:42] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-28 01:16:42] [INFO ] Invariant cache hit.
[2024-05-28 01:16:42] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/14 places, 7/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 100 ms. Remains : 7/14 places, 7/11 transitions.
Stuttering acceptance computed with spot in 93 ms :[p1, (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT s1 s6), p0:(OR (LEQ 2 s5) (GT 1 s6))], 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 0 reset in 65 ms.
Product exploration explored 100000 steps with 0 reset in 125 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 101 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[p1, (NOT p0)]
Incomplete random walk after 20002 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=3333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2024-05-28 01:16:43] [INFO ] Invariant cache hit.
[2024-05-28 01:16:43] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 01:16:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-28 01:16:43] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 01:16:43] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-28 01:16:43] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 59630 steps, including 0 resets, run visited all 2 properties in 431 ms. (steps per millisecond=138 )
Parikh walk visited 2 properties in 430 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 7 factoid took 143 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[p1, (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[p1, (NOT p0)]
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 7/7 transitions.
Applied a total of 0 rules in 2 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-05-28 01:16:43] [INFO ] Invariant cache hit.
[2024-05-28 01:16:43] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-28 01:16:43] [INFO ] Invariant cache hit.
[2024-05-28 01:16:43] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-28 01:16:43] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 01:16:43] [INFO ] Invariant cache hit.
[2024-05-28 01:16:43] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 7/7 places, 7/7 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 p0)), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 76 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[p1, (NOT p0)]
Incomplete random walk after 20002 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=3333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2024-05-28 01:16:44] [INFO ] Invariant cache hit.
[2024-05-28 01:16:44] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 01:16:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-28 01:16:44] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 01:16:44] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-28 01:16:44] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 59698 steps, including 0 resets, run visited all 2 properties in 316 ms. (steps per millisecond=188 )
Parikh walk visited 2 properties in 316 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 7 factoid took 154 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[p1, (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[p1, (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[p1, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 68 ms.
Product exploration explored 100000 steps with 0 reset in 132 ms.
Built C files in :
/tmp/ltsmin8720556893670281199
[2024-05-28 01:16:45] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2024-05-28 01:16:45] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:16:45] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2024-05-28 01:16:45] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:16:45] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2024-05-28 01:16:45] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:16:45] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8720556893670281199
Running compilation step : cd /tmp/ltsmin8720556893670281199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 148 ms.
Running link step : cd /tmp/ltsmin8720556893670281199;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8720556893670281199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13138678941326995764.hoa' '--buchi-type=spotba'
LTSmin run took 4037 ms.
FORMULA RobotManipulation-PT-10000-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-10000-LTLCardinality-11 finished in 7120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U (X(p1)||(p2 U (p3||G(p2)))))))'
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 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 13 transition count 11
Applied a total of 1 rules in 1 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-05-28 01:16:49] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 01:16:49] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-28 01:16:49] [INFO ] Invariant cache hit.
[2024-05-28 01:16:49] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-28 01:16:49] [INFO ] Invariant cache hit.
[2024-05-28 01:16:49] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 13/14 places, 11/11 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 13/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p3) (NOT p2))]
Running random walk in product with property : RobotManipulation-PT-10000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(AND (GT s4 s12) (GT 2 s11)), p2:(GT 2 s11), p1:(GT 1 s8), p0:(LEQ 2 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 10 reset in 96 ms.
Product exploration explored 100000 steps with 1 reset in 123 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 p3 p2 p1 (NOT p0)), (X p1), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 113 ms. Reduced automaton from 6 states, 15 edges and 4 AP (stutter sensitive) to 6 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3))]
Incomplete random walk after 20002 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=2857 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-28 01:16:50] [INFO ] Invariant cache hit.
[2024-05-28 01:16:50] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 01:16:50] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 01:16:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 01:16:50] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 01:16:50] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-28 01:16:50] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 119437 steps, including 0 resets, run visited all 2 properties in 735 ms. (steps per millisecond=162 )
Parikh walk visited 2 properties in 736 ms.
Knowledge obtained : [(AND p3 p2 p1 (NOT p0)), (X p1), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F p0), (F (AND (NOT p2) (NOT p3))), (F (NOT p1)), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 10 factoid took 303 ms. Reduced automaton from 6 states, 15 edges and 4 AP (stutter sensitive) to 6 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3))]
Support contains 5 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-05-28 01:16:52] [INFO ] Invariant cache hit.
[2024-05-28 01:16:52] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-28 01:16:52] [INFO ] Invariant cache hit.
[2024-05-28 01:16:52] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-28 01:16:52] [INFO ] Invariant cache hit.
[2024-05-28 01:16:52] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 13/13 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 p2 p3 p1 (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 97 ms. Reduced automaton from 6 states, 15 edges and 4 AP (stutter sensitive) to 6 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3))]
Incomplete random walk after 20002 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=2857 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-28 01:16:52] [INFO ] Invariant cache hit.
[2024-05-28 01:16:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 01:16:52] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 01:16:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 01:16:52] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 01:16:52] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-28 01:16:52] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 119526 steps, including 0 resets, run visited all 2 properties in 726 ms. (steps per millisecond=164 )
Parikh walk visited 2 properties in 725 ms.
Knowledge obtained : [(AND p2 p3 p1 (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F p0), (F (AND (NOT p2) (NOT p3))), (F (NOT p1)), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 10 factoid took 233 ms. Reduced automaton from 6 states, 15 edges and 4 AP (stutter sensitive) to 6 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 8 reset in 95 ms.
Product exploration explored 100000 steps with 10 reset in 119 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3))]
Support contains 5 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 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 13 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 13 transition count 11
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 12 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 12 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 4 rules in 4 ms. Remains 12 /13 variables (removed 1) and now considering 10/11 (removed 1) transitions.
[2024-05-28 01:16:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2024-05-28 01:16:55] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 01:16:55] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/13 places, 10/11 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52 ms. Remains : 12/13 places, 10/11 transitions.
Built C files in :
/tmp/ltsmin13109580955011816007
[2024-05-28 01:16:55] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13109580955011816007
Running compilation step : cd /tmp/ltsmin13109580955011816007;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 71 ms.
Running link step : cd /tmp/ltsmin13109580955011816007;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin13109580955011816007;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11916419938620039647.hoa' '--buchi-type=spotba'
LTSmin run took 1616 ms.
FORMULA RobotManipulation-PT-10000-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-10000-LTLCardinality-13 finished in 7354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(!p1))))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 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 12 transition count 11
Applied a total of 2 rules in 2 ms. Remains 12 /14 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 12 cols
[2024-05-28 01:16:57] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 01:16:57] [INFO ] Implicit Places using invariants in 34 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 : 11/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40 ms. Remains : 11/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Running random walk in product with property : RobotManipulation-PT-10000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LEQ 2 s0), p0:(GT s10 s9)], 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 RobotManipulation-PT-10000-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-10000-LTLCardinality-14 finished in 1111 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&X(p1)))||F(p2)))'
Support contains 6 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 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 13 transition count 11
Applied a total of 1 rules in 1 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-05-28 01:16:57] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 01:16:57] [INFO ] Implicit Places using invariants in 25 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/14 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 28 ms. Remains : 12/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2)]
Running random walk in product with property : RobotManipulation-PT-10000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(GT 1 s4), p1:(OR (GT 1 s3) (GT 1 s9) (GT s11 s6)), p0:(GT s11 s2)], 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 56 ms.
Product exploration explored 100000 steps with 33333 reset in 70 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) p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-10000-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-10000-LTLCardinality-15 finished in 355 ms.
All properties solved by simple procedures.
Total runtime 24776 ms.

BK_STOP 1716859023540

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-10000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is RobotManipulation-PT-10000, 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 r351-tall-171679101800157"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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