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.r524-tall-171679079900244.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 ltsminxred
Input is RobotManipulation-PT-05000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679079900244
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME RobotManipulation-PT-05000-LTLFireability-01
FORMULA_NAME RobotManipulation-PT-05000-LTLFireability-02
FORMULA_NAME RobotManipulation-PT-05000-LTLFireability-03
FORMULA_NAME RobotManipulation-PT-05000-LTLFireability-04
FORMULA_NAME RobotManipulation-PT-05000-LTLFireability-05
FORMULA_NAME RobotManipulation-PT-05000-LTLFireability-06
FORMULA_NAME RobotManipulation-PT-05000-LTLFireability-07
FORMULA_NAME RobotManipulation-PT-05000-LTLFireability-08
FORMULA_NAME RobotManipulation-PT-05000-LTLFireability-09
FORMULA_NAME RobotManipulation-PT-05000-LTLFireability-10
FORMULA_NAME RobotManipulation-PT-05000-LTLFireability-11
FORMULA_NAME RobotManipulation-PT-05000-LTLFireability-12
FORMULA_NAME RobotManipulation-PT-05000-LTLFireability-13
FORMULA_NAME RobotManipulation-PT-05000-LTLFireability-14
FORMULA_NAME RobotManipulation-PT-05000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717221631072

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RobotManipulation-PT-05000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:00:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:00:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:00:32] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2024-06-01 06:00:32] [INFO ] Transformed 15 places.
[2024-06-01 06:00:32] [INFO ] Transformed 11 transitions.
[2024-06-01 06:00:32] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 121 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA RobotManipulation-PT-05000-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-05000-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-05000-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 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 8 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 15 cols
[2024-06-01 06:00:32] [INFO ] Computed 6 invariants in 3 ms
[2024-06-01 06:00:32] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-01 06:00:32] [INFO ] Invariant cache hit.
[2024-06-01 06:00:32] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-06-01 06:00:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 11/26 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/26 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 21 constraints, problems are : Problem set: 0 solved, 10 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 11/26 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/26 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 31 constraints, problems are : Problem set: 0 solved, 10 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 287ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 295ms
Finished structural reductions in LTL mode , in 1 iterations and 520 ms. Remains : 15/15 places, 11/11 transitions.
Support contains 13 out of 15 places after structural reductions.
[2024-06-01 06:00:33] [INFO ] Flatten gal took : 17 ms
[2024-06-01 06:00:33] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:00:33] [INFO ] Input system was already deterministic with 11 transitions.
RANDOM walk for 40008 steps (0 resets) in 130 ms. (305 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 311 ms. (128 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
[2024-06-01 06:00:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/11 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/26 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/26 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 21 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/11 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/26 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 22 constraints, problems are : Problem set: 0 solved, 1 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 243ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 48668 steps, including 0 resets, run visited all 1 properties in 115 ms. (steps per millisecond=423 )
Parikh walk visited 1 properties in 121 ms.
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.202405141337/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 (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 11 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 10 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 9 transition count 7
Applied a total of 10 rules in 18 ms. Remains 9 /15 variables (removed 6) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-06-01 06:00:34] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 06:00:34] [INFO ] Implicit Places using invariants in 28 ms returned [4, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 29 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/15 places, 7/11 transitions.
Graph (trivial) has 5 edges and 6 vertex of which 3 / 6 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 3 transition count 4
Applied a total of 3 rules in 7 ms. Remains 3 /6 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-06-01 06:00:34] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 06:00:34] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 06:00:34] [INFO ] Invariant cache hit.
[2024-06-01 06:00:34] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3/15 places, 4/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 90 ms. Remains : 3/15 places, 4/11 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-05000-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA RobotManipulation-PT-05000-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-LTLFireability-00 finished in 331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 (Trivial Post-Agglo cleanup.) 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 5 ms. Remains 8 /15 variables (removed 7) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-06-01 06:00:34] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 06:00:34] [INFO ] Implicit Places using invariants in 26 ms returned [4, 6]
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 : 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 2 ms. Remains 4 /6 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-06-01 06:00:34] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 06:00:34] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 06:00:34] [INFO ] Invariant cache hit.
[2024-06-01 06:00:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:00:34] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 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 78 ms. Remains : 4/15 places, 4/11 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-05000-LTLFireability-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-05000-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-LTLFireability-01 finished in 144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&X((F(p1)||G(!p0))))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 2 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2024-06-01 06:00:34] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 06:00:34] [INFO ] Implicit Places using invariants in 26 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 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 30 ms. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 264 ms :[true, (NOT p1), p0, p0, (AND (NOT p1) p0)]
Running random walk in product with property : RobotManipulation-PT-05000-LTLFireability-02
Product exploration explored 100000 steps with 33333 reset in 162 ms.
Product exploration explored 100000 steps with 33333 reset in 97 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-05000-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-05000-LTLFireability-02 finished in 597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(p1 U (p2||G(p1)))))'
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-06-01 06:00:35] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 06:00:35] [INFO ] Implicit Places using invariants in 18 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 13/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 12 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 10
Applied a total of 2 rules in 2 ms. Remains 12 /13 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 12 cols
[2024-06-01 06:00:35] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 06:00:35] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 06:00:35] [INFO ] Invariant cache hit.
[2024-06-01 06:00:35] [INFO ] Implicit Places using invariants and state equation in 23 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 : 12/15 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 12/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-05000-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 96 ms.
Stack based approach found an accepted trace after 673 steps with 0 reset with depth 674 and stack size 674 in 1 ms.
FORMULA RobotManipulation-PT-05000-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-05000-LTLFireability-03 finished in 340 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 0 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-06-01 06:00:35] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 06:00:35] [INFO ] Implicit Places using invariants in 25 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.
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-06-01 06:00:35] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 06:00:35] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 06:00:35] [INFO ] Invariant cache hit.
[2024-06-01 06:00:35] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 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 66 ms. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-05000-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 99 ms.
Product exploration explored 100000 steps with 50000 reset in 97 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 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 22 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-05000-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-05000-LTLFireability-04 finished in 361 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(!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-06-01 06:00:35] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 06:00:35] [INFO ] Implicit Places using invariants in 43 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 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 47 ms. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 123 ms :[p0, p0, p0, p0]
Running random walk in product with property : RobotManipulation-PT-05000-LTLFireability-05
Product exploration explored 100000 steps with 25000 reset in 45 ms.
Product exploration explored 100000 steps with 25000 reset in 48 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[p0, p0, p0, p0]
RANDOM walk for 40008 steps (0 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
BEST_FIRST walk for 541 steps (0 resets) in 5 ms. (90 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 143 ms :[p0, p0, p0, p0]
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 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.
// Phase 1: matrix 11 rows 11 cols
[2024-06-01 06:00:36] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 06:00:36] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 06:00:36] [INFO ] Invariant cache hit.
[2024-06-01 06:00:36] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-06-01 06:00:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 11/22 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 13 constraints, problems are : Problem set: 0 solved, 10 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 11/22 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 23 constraints, problems are : Problem set: 0 solved, 10 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 132ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 132ms
Finished structural reductions in LTL mode , in 1 iterations and 192 ms. Remains : 11/11 places, 11/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 60 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[p0, p0, p0, p0]
RANDOM walk for 40008 steps (0 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
BEST_FIRST walk for 501 steps (0 resets) in 5 ms. (83 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 178 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 158 ms :[p0, p0, p0, p0]
Product exploration explored 100000 steps with 25000 reset in 54 ms.
Product exploration explored 100000 steps with 25000 reset in 40 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 147 ms :[p0, p0, p0, p0]
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 11 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 11 transition count 11
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 11 transition count 11
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 10 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 10 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 10 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 10 transition count 14
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 9 transition count 12
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 9 transition count 12
Deduced a syphon composed of 5 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 9 transition count 9
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 14 rules in 7 ms. Remains 9 /11 variables (removed 2) and now considering 9/11 (removed 2) transitions.
[2024-06-01 06:00:38] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
// Phase 1: matrix 9 rows 9 cols
[2024-06-01 06:00:38] [INFO ] Computed 2 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
At refinement iteration 4 (OVERLAPS) 8/17 variables, 9/11 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/11 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/17 variables, 0/11 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/18 variables, and 11 constraints, problems are : Problem set: 5 solved, 2 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/17 variables, 9/11 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 2/13 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/17 variables, 0/13 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/18 variables, and 13 constraints, problems are : Problem set: 5 solved, 2 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 2/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 77ms problems are : Problem set: 5 solved, 2 unsolved
Search for dead transitions found 5 dead transitions in 77ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 9/11 places, 4/11 transitions.
Graph (complete) has 9 edges and 9 vertex of which 4 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 3 ms. Remains 3 /9 variables (removed 6) and now considering 4/4 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 3/11 places, 4/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 95 ms. Remains : 3/11 places, 4/11 transitions.
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 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.
// Phase 1: matrix 11 rows 11 cols
[2024-06-01 06:00:38] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 06:00:38] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 06:00:38] [INFO ] Invariant cache hit.
[2024-06-01 06:00:38] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-06-01 06:00:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 11/22 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 13 constraints, problems are : Problem set: 0 solved, 10 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 11/22 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 23 constraints, problems are : Problem set: 0 solved, 10 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 133ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 134ms
Finished structural reductions in LTL mode , in 1 iterations and 181 ms. Remains : 11/11 places, 11/11 transitions.
Treatment of property RobotManipulation-PT-05000-LTLFireability-05 finished in 2700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((p0&&X(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 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-06-01 06:00:38] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 06:00:38] [INFO ] Implicit Places using invariants in 23 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 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-06-01 06:00:38] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 06:00:38] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 06:00:38] [INFO ] Invariant cache hit.
[2024-06-01 06:00:38] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 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 77 ms. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 338 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : RobotManipulation-PT-05000-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 91 ms.
Stack based approach found an accepted trace after 121 steps with 0 reset with depth 122 and stack size 122 in 0 ms.
FORMULA RobotManipulation-PT-05000-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-05000-LTLFireability-06 finished in 523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&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 (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 11 transition count 8
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 10 transition count 8
Performed 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 5 ms. Remains 9 /15 variables (removed 6) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-06-01 06:00:39] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 06:00:39] [INFO ] Implicit Places using invariants in 26 ms returned [4, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 27 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/15 places, 7/11 transitions.
Graph (trivial) has 5 edges and 6 vertex of which 3 / 6 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.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 3 transition count 4
Applied a total of 3 rules in 1 ms. Remains 3 /6 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-06-01 06:00:39] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 06:00:39] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 06:00:39] [INFO ] Invariant cache hit.
[2024-06-01 06:00:39] [INFO ] Implicit Places using invariants and state equation in 18 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 : 3/15 places, 4/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 69 ms. Remains : 3/15 places, 4/11 transitions.
Stuttering acceptance computed with spot in 66 ms :[p0, p0]
Running random walk in product with property : RobotManipulation-PT-05000-LTLFireability-07
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-05000-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-LTLFireability-07 finished in 159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) 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 6 ms. Remains 8 /15 variables (removed 7) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-06-01 06:00:39] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 06:00:39] [INFO ] Implicit Places using invariants in 25 ms returned [4, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/15 places, 6/11 transitions.
Graph (trivial) has 2 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.
Applied a total of 1 rules in 1 ms. Remains 5 /6 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-06-01 06:00:39] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 06:00:39] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 06:00:39] [INFO ] Invariant cache hit.
[2024-06-01 06:00:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:00:39] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 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 77 ms. Remains : 5/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-05000-LTLFireability-08
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-05000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-LTLFireability-08 finished in 133 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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 0 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-06-01 06:00:39] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 06:00:39] [INFO ] Implicit Places using invariants in 26 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 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-06-01 06:00:39] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 06:00:39] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 06:00:39] [INFO ] Invariant cache hit.
[2024-06-01 06:00:39] [INFO ] Implicit Places using invariants and state equation in 20 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 : 10/15 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72 ms. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-05000-LTLFireability-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-05000-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-LTLFireability-10 finished in 200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(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 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. 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.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 12 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 11 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 10 transition count 8
Applied a total of 8 rules in 4 ms. Remains 10 /15 variables (removed 5) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 10 cols
[2024-06-01 06:00:39] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 06:00:39] [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 : 8/15 places, 8/11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 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 2 with 2 rules applied. Total rules applied 6 place count 5 transition count 5
Applied a total of 6 rules in 2 ms. Remains 5 /8 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-06-01 06:00:39] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 06:00:39] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 06:00:39] [INFO ] Invariant cache hit.
[2024-06-01 06:00:39] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 37 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 73 ms. Remains : 5/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-05000-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 54 ms.
Product exploration explored 100000 steps with 50000 reset in 49 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 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 17 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-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-05000-LTLFireability-12 finished in 259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U G((p1 U X(X(!p2))))))'
Support contains 6 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2024-06-01 06:00:39] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 06:00:39] [INFO ] Implicit Places using invariants in 29 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 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 32 ms. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 632 ms :[p2, p2, p2, p2, p2, p2, p2, true, p2, p2, p2, p2, p2, p0]
Running random walk in product with property : RobotManipulation-PT-05000-LTLFireability-13
Entered a terminal (fully accepting) state of product in 228 steps with 60 reset in 0 ms.
FORMULA RobotManipulation-PT-05000-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-LTLFireability-13 finished in 687 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0 U p1))))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 12 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 12 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 11 transition count 8
Applied a total of 7 rules in 2 ms. Remains 11 /15 variables (removed 4) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 11 cols
[2024-06-01 06:00:40] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 06:00:40] [INFO ] Implicit Places using invariants in 32 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/15 places, 8/11 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 10 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 9 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 2 with 2 rules applied. Total rules applied 4 place count 8 transition count 6
Applied a total of 4 rules in 1 ms. Remains 8 /10 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-06-01 06:00:40] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 06:00:40] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 06:00:40] [INFO ] Invariant cache hit.
[2024-06-01 06:00:40] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/15 places, 6/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 98 ms. Remains : 8/15 places, 6/11 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-05000-LTLFireability-14
Product exploration explored 100000 steps with 332 reset in 87 ms.
Stack based approach found an accepted trace after 38 steps with 9 reset with depth 5 and stack size 5 in 0 ms.
FORMULA RobotManipulation-PT-05000-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-05000-LTLFireability-14 finished in 270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(!p0)))))'
Found a Shortening insensitive property : RobotManipulation-PT-05000-LTLFireability-05
Stuttering acceptance computed with spot in 155 ms :[p0, p0, p0, p0]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 11 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 10 transition count 8
Performed 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 4 ms. Remains 9 /15 variables (removed 6) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-06-01 06:00:41] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 06:00:41] [INFO ] Implicit Places using invariants in 33 ms returned [4, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 39 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 6/15 places, 7/11 transitions.
Graph (trivial) has 5 edges and 6 vertex of which 3 / 6 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.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 3 transition count 4
Applied a total of 3 rules in 1 ms. Remains 3 /6 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-06-01 06:00:41] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 06:00:41] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 06:00:41] [INFO ] Invariant cache hit.
[2024-06-01 06:00:41] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 3/15 places, 4/11 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 83 ms. Remains : 3/15 places, 4/11 transitions.
Running random walk in product with property : RobotManipulation-PT-05000-LTLFireability-05
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
Treatment of property RobotManipulation-PT-05000-LTLFireability-05 finished in 340 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-06-01 06:00:41] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:00:41] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-06-01 06:00:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 15 places, 11 transitions and 34 arcs took 2 ms.
Total runtime 8952 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA RobotManipulation-PT-05000-LTLFireability-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717221641305

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name RobotManipulation-PT-05000-LTLFireability-05
ltl formula formula --ltl=/tmp/1096/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 15 places, 11 transitions and 34 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1096/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1096/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1096/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1096/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 17 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 16, there are 15 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7
pnml2lts-mc( 0/ 4): unique states count: 7
pnml2lts-mc( 0/ 4): unique transitions count: 7
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 2
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 15
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 15 states 24 transitions, fanout: 1.600
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 60.6 B/state, compr.: 91.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 11 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is RobotManipulation-PT-05000, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r524-tall-171679079900244"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;