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-171679101800152.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-05000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-tall-171679101800152
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.6K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 18:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 11 18:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 18:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 18:38 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.4K 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-05000-LTLCardinality-00
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-01
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-02
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-03
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-04
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-05
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-06
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-07
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-08
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-09
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-10
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-11
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-12
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-13
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-14
FORMULA_NAME RobotManipulation-PT-05000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716858762707

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-05000
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-28 01:12:44] [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:12:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 01:12:44] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2024-05-28 01:12:44] [INFO ] Transformed 15 places.
[2024-05-28 01:12:44] [INFO ] Transformed 11 transitions.
[2024-05-28 01:12:44] [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
Support contains 15 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 12 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:12:44] [INFO ] Computed 6 invariants in 3 ms
[2024-05-28 01:12:44] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-28 01:12:44] [INFO ] Invariant cache hit.
[2024-05-28 01:12:44] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-05-28 01:12:44] [INFO ] Invariant cache hit.
[2024-05-28 01:12:44] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 15/15 places, 11/11 transitions.
Support contains 15 out of 15 places after structural reductions.
[2024-05-28 01:12:44] [INFO ] Flatten gal took : 14 ms
[2024-05-28 01:12:44] [INFO ] Flatten gal took : 3 ms
[2024-05-28 01:12:44] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 10002 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 26) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :14
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 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 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 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 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-28 01:12:45] [INFO ] Invariant cache hit.
[2024-05-28 01:12:45] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 01:12:45] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 01:12:45] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-28 01:12:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 01:12:45] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-28 01:12:45] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2024-05-28 01:12:45] [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 17 ms.
[2024-05-28 01:12:45] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 8 Parikh solutions to 6 different solutions.
Finished Parikh walk after 79773 steps, including 1 resets, run visited all 3 properties in 355 ms. (steps per millisecond=224 )
Parikh walk visited 6 properties in 2149 ms.
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 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 13 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 10 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 8 transition count 6
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 17 place count 5 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 17 place count 5 transition count 3
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 19 place count 4 transition count 3
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 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 2 transition count 2
Applied a total of 22 rules in 8 ms. Remains 2 /15 variables (removed 13) and now considering 2/11 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 2/15 places, 2/11 transitions.
Incomplete random walk after 10002 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 29999 steps, run visited all 1 properties in 47 ms. (steps per millisecond=638 )
Probabilistic random walk after 29999 steps, saw 10002 distinct states, run finished after 47 ms. (steps per millisecond=638 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
FORMULA RobotManipulation-PT-05000-LTLCardinality-09 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' '!(G(F((p0&&X((X(X(F(p1)))||G(p0)))))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 12 transition count 9
Performed 1 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 11 transition count 8
Applied a total of 7 rules in 3 ms. Remains 11 /15 variables (removed 4) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 11 cols
[2024-05-28 01:12:47] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 01:12:47] [INFO ] Implicit Places using invariants in 28 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/15 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
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 6 transition count 6
Applied a total of 5 rules in 2 ms. Remains 6 /9 variables (removed 3) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-05-28 01:12:47] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 01:12:47] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 01:12:47] [INFO ] Invariant cache hit.
[2024-05-28 01:12:47] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/15 places, 6/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 90 ms. Remains : 6/15 places, 6/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 416 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GT s4 s0), p1:(LEQ 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 18132 reset in 175 ms.
Product exploration explored 100000 steps with 18185 reset in 108 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter insensitive) to 14 states, 37 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 615 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, (AND (NOT p0) (NOT p1)), false, false, false, false, false]
Incomplete random walk after 10002 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=3334 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-28 01:12:49] [INFO ] Invariant cache hit.
[2024-05-28 01:12:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 01:12:49] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 01:12:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-28 01:12:49] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-28 01:12:49] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-28 01:12:49] [INFO ] After 57ms 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 29729 steps, including 0 resets, run visited all 1 properties in 27 ms. (steps per millisecond=1101 )
Parikh walk visited 3 properties in 283 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 273 ms. Reduced automaton from 14 states, 37 edges and 2 AP (stutter insensitive) to 14 states, 37 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1703 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, (AND (NOT p0) (NOT p1)), false, false, false, false, false]
Stuttering acceptance computed with spot in 584 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, (AND (NOT p0) (NOT p1)), false, false, false, false, false]
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 6/6 transitions.
Applied a total of 0 rules in 2 ms. Remains 6 /6 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-05-28 01:12:52] [INFO ] Invariant cache hit.
[2024-05-28 01:12:52] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-28 01:12:52] [INFO ] Invariant cache hit.
[2024-05-28 01:12:52] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-28 01:12:52] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 01:12:52] [INFO ] Invariant cache hit.
[2024-05-28 01:12:52] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 269 ms. Remains : 6/6 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 10 factoid took 279 ms. Reduced automaton from 14 states, 37 edges and 2 AP (stutter insensitive) to 14 states, 37 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 706 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, (AND (NOT p0) (NOT p1)), false, false, false, false, false]
Incomplete random walk after 10002 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-28 01:12:53] [INFO ] Invariant cache hit.
[2024-05-28 01:12:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 01:12:53] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 01:12:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 01:12:53] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-28 01:12:53] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-28 01:12:53] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 30000 steps, including 0 resets, run visited all 3 properties in 245 ms. (steps per millisecond=122 )
Parikh walk visited 3 properties in 244 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (AND p1 p0)), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 10 factoid took 512 ms. Reduced automaton from 14 states, 37 edges and 2 AP (stutter insensitive) to 14 states, 37 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 951 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, (AND (NOT p0) (NOT p1)), false, false, false, false, false]
Stuttering acceptance computed with spot in 674 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, (AND (NOT p0) (NOT p1)), false, false, false, false, false]
Stuttering acceptance computed with spot in 652 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, (AND (NOT p0) (NOT p1)), false, false, false, false, false]
Product exploration explored 100000 steps with 16286 reset in 76 ms.
Product exploration explored 100000 steps with 16246 reset in 174 ms.
Built C files in :
/tmp/ltsmin14623770278221973878
[2024-05-28 01:12:57] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2024-05-28 01:12:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:12:57] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2024-05-28 01:12:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:12:57] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2024-05-28 01:12:57] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:12:57] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14623770278221973878
Running compilation step : cd /tmp/ltsmin14623770278221973878;'/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 176 ms.
Running link step : cd /tmp/ltsmin14623770278221973878;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin14623770278221973878;'/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/stateBased4113520884918535393.hoa' '--buchi-type=spotba'
LTSmin run took 2977 ms.
FORMULA RobotManipulation-PT-05000-LTLCardinality-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-05000-LTLCardinality-00 finished in 12781 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&&X(G(!p0))))))'
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-05-28 01:13:00] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 01:13:00] [INFO ] Implicit Places using invariants in 34 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 10 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 10
Applied a total of 2 rules in 3 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2024-05-28 01:13:00] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 01:13:00] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 01:13:00] [INFO ] Invariant cache hit.
[2024-05-28 01:13:00] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 10/15 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, true, p0]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 88 ms.
Stack based approach found an accepted trace after 81 steps with 0 reset with depth 82 and stack size 82 in 1 ms.
FORMULA RobotManipulation-PT-05000-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-05000-LTLCardinality-01 finished in 585 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(G(p0)))'
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-05-28 01:13:01] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 01:13:01] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-28 01:13:01] [INFO ] Invariant cache hit.
[2024-05-28 01:13:01] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-28 01:13:01] [INFO ] Invariant cache hit.
[2024-05-28 01:13:01] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 13/15 places, 11/11 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ 1 s3) (AND (GT s10 s4) (GT s5 s8)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-05000-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-LTLCardinality-02 finished in 202 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)))'
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 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 13 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 10 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 8 transition count 6
Applied a total of 12 rules in 4 ms. Remains 8 /15 variables (removed 7) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-05-28 01:13:01] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 01:13:01] [INFO ] Implicit Places using invariants in 24 ms returned [4, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/15 places, 6/11 transitions.
Graph (trivial) has 3 edges and 6 vertex of which 2 / 6 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 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 3 place count 4 transition count 4
Applied a total of 3 rules in 7 ms. Remains 4 /6 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-28 01:13:01] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 01:13:01] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-28 01:13:01] [INFO ] Invariant cache hit.
[2024-05-28 01:13:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 01:13:01] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/15 places, 4/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 76 ms. Remains : 4/15 places, 4/11 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 265 steps with 0 reset in 1 ms.
FORMULA RobotManipulation-PT-05000-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-LTLCardinality-03 finished in 149 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(G(p0)))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 2 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-05-28 01:13:01] [INFO ] Computed 4 invariants in 4 ms
[2024-05-28 01:13:01] [INFO ] Implicit Places using invariants in 31 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 10 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 10
Applied a total of 2 rules in 1 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2024-05-28 01:13:01] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 01:13:01] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 01:13:01] [INFO ] Invariant cache hit.
[2024-05-28 01:13:01] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 10/15 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s3 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-05000-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-LTLCardinality-04 finished in 196 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 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 12 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 12 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 10 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 9 transition count 7
Applied a total of 10 rules in 3 ms. Remains 9 /15 variables (removed 6) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-05-28 01:13:01] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 01:13:01] [INFO ] Implicit Places using invariants in 28 ms returned [4, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/15 places, 7/11 transitions.
Graph (trivial) has 3 edges and 7 vertex of which 3 / 7 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 2 ms. Remains 5 /7 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-05-28 01:13:01] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 01:13:01] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-28 01:13:01] [INFO ] Invariant cache hit.
[2024-05-28 01:13:01] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/15 places, 5/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 70 ms. Remains : 5/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s4 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-05000-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-LTLCardinality-05 finished in 160 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 X(p1)) U (G((F(p0) U X(p1)))||((F(p0) U X(p1))&&(p0||F(p2))))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2024-05-28 01:13:01] [INFO ] Computed 5 invariants in 0 ms
[2024-05-28 01:13:01] [INFO ] Implicit Places using invariants in 32 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 578 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 1 s11), p2:(GT s8 s10), p1:(LEQ 3 s10)], 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, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6940 reset in 141 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA RobotManipulation-PT-05000-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-05000-LTLCardinality-06 finished in 786 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 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-05-28 01:13:02] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 01:13:02] [INFO ] Implicit Places using invariants in 24 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/15 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 28 ms. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-07 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 s10 s3)], 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 25042 reset in 72 ms.
Product exploration explored 100000 steps with 24989 reset in 88 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Incomplete random walk after 10002 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished Best-First random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
// Phase 1: matrix 11 rows 11 cols
[2024-05-28 01:13:03] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 01:13:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 01:13:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 01:13:03] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-28 01:13:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:13:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-28 01:13:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 01:13:03] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-28 01:13:03] [INFO ] Computed and/alt/rep : 10/12/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 01:13:03] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Graph (trivial) has 7 edges and 11 vertex of which 6 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 6 transition count 5
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 3 place count 5 transition count 5
Applied a total of 3 rules in 3 ms. Remains 5 /11 variables (removed 6) and now considering 5/11 (removed 6) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-05-28 01:13:03] [INFO ] Computed 2 invariants in 2 ms
[2024-05-28 01:13:03] [INFO ] Implicit Places using invariants in 31 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/11 places, 5/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 37 ms. Remains : 4/11 places, 5/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 : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-05000-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-05000-LTLCardinality-07 finished in 842 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 p1)&&G(p2))))'
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2024-05-28 01:13:03] [INFO ] Computed 5 invariants in 0 ms
[2024-05-28 01:13:03] [INFO ] Implicit Places using invariants in 27 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 11 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 10
Applied a total of 2 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2024-05-28 01:13:03] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 01:13:03] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 01:13:03] [INFO ] Invariant cache hit.
[2024-05-28 01:13:03] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 11/15 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p2), acceptance={0} source=3 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(LEQ s1 s8), p1:(LEQ 1 s6), p0:(LEQ s7 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 98 ms.
Product exploration explored 100000 steps with 0 reset in 142 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p0 p2)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 107 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10002 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-28 01:13:04] [INFO ] Invariant cache hit.
[2024-05-28 01:13:04] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 01:13:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 01:13:04] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 01:13:04] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-28 01:13:04] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-28 01:13:04] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 10006 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=1429 )
Parikh walk visited 1 properties in 105 ms.
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 10/10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10 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 2 with 2 rules applied. Total rules applied 4 place count 9 transition count 8
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 9 transition count 8
Applied a total of 5 rules in 2 ms. Remains 9 /11 variables (removed 2) and now considering 8/10 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 9/11 places, 8/10 transitions.
Incomplete random walk after 10002 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=5001 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 226640 steps, run visited all 1 properties in 233 ms. (steps per millisecond=972 )
Probabilistic random walk after 226640 steps, saw 141585 distinct states, run finished after 233 ms. (steps per millisecond=972 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p0 p2)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1) p2))), (F (AND p0 p1 p2)), (F (AND p1 p2)), (F (NOT p2)), (F (AND (NOT p0) p1 p2)), (F (OR (AND (NOT p0) (NOT p1)) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 9 factoid took 510 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-05000-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-05000-LTLCardinality-08 finished in 1876 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(G(p0)))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2024-05-28 01:13:05] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 01:13:05] [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 : 13/15 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 28 ms. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s8 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-05000-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-LTLCardinality-10 finished in 126 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 (p1||G(!p0)))) U G(p2)))'
Support contains 6 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 2 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
[2024-05-28 01:13:05] [INFO ] Invariant cache hit.
[2024-05-28 01:13:05] [INFO ] Implicit Places using invariants in 25 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 11 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 10
Applied a total of 2 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2024-05-28 01:13:05] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 01:13:05] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-28 01:13:05] [INFO ] Invariant cache hit.
[2024-05-28 01:13:05] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 11/15 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 1073 ms :[(NOT p2), (AND p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), true, (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={} source=4 dest: 3}, { cond=(OR (AND p2 p1) (AND p2 (NOT p0))), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ s7 s5), p1:(AND (GT s3 s1) (NOT (OR (AND (LEQ s7 s5) (LEQ s7 s8)) (LEQ 3 s0)))), p0:(OR (AND (LEQ s7 s5) (LEQ s7 s8)) (LEQ 3 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 173 steps with 39 reset in 2 ms.
FORMULA RobotManipulation-PT-05000-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-LTLCardinality-11 finished in 1188 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)||X(F(p1))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 3 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-05-28 01:13:06] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 01:13:06] [INFO ] Implicit Places using invariants in 30 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/15 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 35 ms. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GT s8 s3), p0:(GT s3 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2506 reset in 78 ms.
Stack based approach found an accepted trace after 137 steps with 4 reset with depth 14 and stack size 14 in 0 ms.
FORMULA RobotManipulation-PT-05000-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-05000-LTLCardinality-12 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' '!((X((F(p1)&&p0))&&F(p2)))'
Support contains 6 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
[2024-05-28 01:13:06] [INFO ] Invariant cache hit.
[2024-05-28 01:13:06] [INFO ] Implicit Places using invariants in 31 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/15 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 34 ms. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (LEQ s3 s5) (LEQ 1 s6)), p0:(AND (LEQ s2 s4) (GT 3 s8)), p1:(LEQ 3 s8)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1013 reset in 166 ms.
Stack based approach found an accepted trace after 18 steps with 2 reset with depth 8 and stack size 8 in 0 ms.
FORMULA RobotManipulation-PT-05000-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-05000-LTLCardinality-13 finished in 414 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((F(p1)&&p0))&&X(p1)))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2024-05-28 01:13:07] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 01:13:07] [INFO ] Implicit Places using invariants in 32 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 13/15 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 39 ms. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LEQ s5 s0) (GT 1 s12)), p1:(LEQ 3 s12)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-05000-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-LTLCardinality-14 finished in 234 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 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 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 13 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 10 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 8 transition count 6
Applied a total of 12 rules in 3 ms. Remains 8 /15 variables (removed 7) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-05-28 01:13:07] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 01:13:07] [INFO ] Implicit Places using invariants in 26 ms returned [4, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/15 places, 6/11 transitions.
Graph (trivial) has 3 edges and 6 vertex of which 2 / 6 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 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 3 place count 4 transition count 4
Applied a total of 3 rules in 1 ms. Remains 4 /6 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-28 01:13:07] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 01:13:07] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 01:13:07] [INFO ] Invariant cache hit.
[2024-05-28 01:13:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 01:13:07] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/15 places, 4/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 77 ms. Remains : 4/15 places, 4/11 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-05000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s3)], 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 0 reset in 49 ms.
Product exploration explored 100000 steps with 0 reset in 72 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10002 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=3334 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 101106 steps, run visited all 1 properties in 70 ms. (steps per millisecond=1444 )
Probabilistic random walk after 101106 steps, saw 33336 distinct states, run finished after 70 ms. (steps per millisecond=1444 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-28 01:13:08] [INFO ] Invariant cache hit.
[2024-05-28 01:13:08] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 01:13:08] [INFO ] Invariant cache hit.
[2024-05-28 01:13:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 01:13:08] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-28 01:13:08] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 01:13:08] [INFO ] Invariant cache hit.
[2024-05-28 01:13:08] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76 ms. Remains : 4/4 places, 4/4 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10002 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 101106 steps, run visited all 1 properties in 66 ms. (steps per millisecond=1531 )
Probabilistic random walk after 101106 steps, saw 33336 distinct states, run finished after 66 ms. (steps per millisecond=1531 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 44 ms.
Product exploration explored 100000 steps with 0 reset in 56 ms.
Built C files in :
/tmp/ltsmin5802247837736786543
[2024-05-28 01:13:09] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-28 01:13:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:13:09] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-28 01:13:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:13:09] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-28 01:13:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:13:09] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5802247837736786543
Running compilation step : cd /tmp/ltsmin5802247837736786543;'/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 72 ms.
Running link step : cd /tmp/ltsmin5802247837736786543;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5802247837736786543;'/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/stateBased8826780266399141396.hoa' '--buchi-type=spotba'
LTSmin run took 739 ms.
FORMULA RobotManipulation-PT-05000-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-05000-LTLCardinality-15 finished in 2404 ms.
All properties solved by simple procedures.
Total runtime 25675 ms.

BK_STOP 1716858791210

--------------------
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:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ sed s/.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-05000"
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-05000, 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-171679101800152"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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