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.r492-smll-171636266600324.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 FMS-PT-00200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266600324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 22:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 11 22:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 11 22:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 11 22:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 17K May 18 16:42 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 FMS-PT-00200-LTLFireability-00
FORMULA_NAME FMS-PT-00200-LTLFireability-01
FORMULA_NAME FMS-PT-00200-LTLFireability-02
FORMULA_NAME FMS-PT-00200-LTLFireability-03
FORMULA_NAME FMS-PT-00200-LTLFireability-04
FORMULA_NAME FMS-PT-00200-LTLFireability-05
FORMULA_NAME FMS-PT-00200-LTLFireability-06
FORMULA_NAME FMS-PT-00200-LTLFireability-07
FORMULA_NAME FMS-PT-00200-LTLFireability-08
FORMULA_NAME FMS-PT-00200-LTLFireability-09
FORMULA_NAME FMS-PT-00200-LTLFireability-10
FORMULA_NAME FMS-PT-00200-LTLFireability-11
FORMULA_NAME FMS-PT-00200-LTLFireability-12
FORMULA_NAME FMS-PT-00200-LTLFireability-13
FORMULA_NAME FMS-PT-00200-LTLFireability-14
FORMULA_NAME FMS-PT-00200-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717240488310

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FMS-PT-00200
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:14:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 11:14:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:14:51] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-06-01 11:14:51] [INFO ] Transformed 22 places.
[2024-06-01 11:14:51] [INFO ] Transformed 20 transitions.
[2024-06-01 11:14:51] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 392 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA FMS-PT-00200-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00200-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00200-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA FMS-PT-00200-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 26 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2024-06-01 11:14:52] [INFO ] Computed 6 invariants in 18 ms
[2024-06-01 11:14:52] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-06-01 11:14:52] [INFO ] Invariant cache hit.
[2024-06-01 11:14:52] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 11:14:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 3/22 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 28 constraints, problems are : Problem set: 0 solved, 17 unsolved in 646 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 3/22 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 17/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 45 constraints, problems are : Problem set: 0 solved, 17 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 1170ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 1191ms
Finished structural reductions in LTL mode , in 1 iterations and 1882 ms. Remains : 22/22 places, 20/20 transitions.
Support contains 18 out of 22 places after structural reductions.
[2024-06-01 11:14:54] [INFO ] Flatten gal took : 33 ms
[2024-06-01 11:14:54] [INFO ] Flatten gal took : 11 ms
[2024-06-01 11:14:54] [INFO ] Input system was already deterministic with 20 transitions.
RANDOM walk for 40080 steps (8 resets) in 419 ms. (95 steps per ms) remains 1/15 properties
BEST_FIRST walk for 40003 steps (8 resets) in 304 ms. (131 steps per ms) remains 1/1 properties
[2024-06-01 11:14:54] [INFO ] Invariant cache hit.
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Real declared 3/42 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 43ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 8 places and 0 transitions.
Graph (trivial) has 11 edges and 14 vertex of which 6 / 14 are part of one of the 2 SCC in 3 ms
Free SCC test removed 4 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 1 with 10 rules applied. Total rules applied 15 place count 10 transition count 14
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 22 place count 8 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 23 place count 7 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 23 place count 7 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 25 place count 6 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 4 with 2 rules applied. Total rules applied 27 place count 5 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 28 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 31 place count 3 transition count 5
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 32 place count 2 transition count 4
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 2 transition count 4
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 34 place count 2 transition count 3
Applied a total of 34 rules in 64 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-06-01 11:14:55] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 11:14:55] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 11:14:55] [INFO ] Invariant cache hit.
[2024-06-01 11:14:55] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-06-01 11:14:55] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 11:14:55] [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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 76ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 77ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/22 places, 3/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 207 ms. Remains : 2/22 places, 3/20 transitions.
Stuttering acceptance computed with spot in 380 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-00200-LTLFireability-00
Stuttering criterion allowed to conclude after 5702 steps with 0 reset in 63 ms.
FORMULA FMS-PT-00200-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00200-LTLFireability-00 finished in 755 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 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 9 edges and 16 vertex of which 3 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test 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 1 with 9 rules applied. Total rules applied 13 place count 14 transition count 14
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 12 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 19 place count 11 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 19 place count 11 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 23 place count 9 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 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 26 place count 7 transition count 8
Applied a total of 26 rules in 6 ms. Remains 7 /22 variables (removed 15) and now considering 8/20 (removed 12) transitions.
[2024-06-01 11:14:55] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 7 cols
[2024-06-01 11:14:55] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 11:14:55] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-06-01 11:14:55] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2024-06-01 11:14:55] [INFO ] Invariant cache hit.
[2024-06-01 11:14:55] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2024-06-01 11:14:55] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 11:14:55] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2024-06-01 11:14:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 10 constraints, problems are : Problem set: 0 solved, 4 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 14 constraints, problems are : Problem set: 0 solved, 4 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 167ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 168ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/22 places, 8/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 430 ms. Remains : 7/22 places, 8/20 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-00200-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FMS-PT-00200-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00200-LTLFireability-01 finished in 513 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)) U (X(G(p0))&&(p1 U (G(p1)||(p1&&G(p0)))))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2024-06-01 11:14:56] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 11:14:56] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 11:14:56] [INFO ] Invariant cache hit.
[2024-06-01 11:14:56] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 11:14:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 3/22 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 28 constraints, problems are : Problem set: 0 solved, 17 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 3/22 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 17/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 45 constraints, problems are : Problem set: 0 solved, 17 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 686ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 687ms
Finished structural reductions in LTL mode , in 1 iterations and 929 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FMS-PT-00200-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00200-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00200-LTLFireability-02 finished in 1130 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 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 10 edges and 16 vertex of which 6 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 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 1 with 9 rules applied. Total rules applied 13 place count 12 transition count 14
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 21 place count 9 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 8 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 22 place count 8 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 27 place count 5 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 28 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 31 place count 3 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 32 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 34 place count 2 transition count 3
Applied a total of 34 rules in 6 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-06-01 11:14:57] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 11:14:57] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 11:14:57] [INFO ] Invariant cache hit.
[2024-06-01 11:14:57] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-06-01 11:14:57] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 11:14:57] [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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 81ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/22 places, 3/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 ms. Remains : 2/22 places, 3/20 transitions.
Stuttering acceptance computed with spot in 48 ms :[p0]
Running random walk in product with property : FMS-PT-00200-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00200-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00200-LTLFireability-03 finished in 227 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&&F(p1)))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2024-06-01 11:14:57] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 11:14:57] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 11:14:57] [INFO ] Invariant cache hit.
[2024-06-01 11:14:57] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 11:14:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 3/22 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 28 constraints, problems are : Problem set: 0 solved, 17 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 3/22 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 17/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 45 constraints, problems are : Problem set: 0 solved, 17 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 650ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 652ms
Finished structural reductions in LTL mode , in 1 iterations and 767 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : FMS-PT-00200-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00200-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00200-LTLFireability-04 finished in 985 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)) U (p1 U p0)))'
Support contains 2 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
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 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 5 places and 0 transitions.
Graph (trivial) has 10 edges and 17 vertex of which 6 / 17 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 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 1 with 8 rules applied. Total rules applied 11 place count 13 transition count 15
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 20 place count 10 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 8 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 22 place count 8 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 27 place count 5 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 5 transition count 6
Applied a total of 28 rules in 5 ms. Remains 5 /22 variables (removed 17) and now considering 6/20 (removed 14) transitions.
// Phase 1: matrix 6 rows 5 cols
[2024-06-01 11:14:58] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 11:14:58] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 11:14:58] [INFO ] Invariant cache hit.
[2024-06-01 11:14:58] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-06-01 11:14:58] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 11:14:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/10 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/10 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 123ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/22 places, 6/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 197 ms. Remains : 5/22 places, 6/20 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-00200-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00200-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00200-LTLFireability-06 finished in 264 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||F(p1)))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 8 places and 0 transitions.
Graph (trivial) has 10 edges and 14 vertex of which 6 / 14 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 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 1 with 10 rules applied. Total rules applied 15 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 22 place count 9 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 24 place count 7 transition count 8
Applied a total of 24 rules in 3 ms. Remains 7 /22 variables (removed 15) and now considering 8/20 (removed 12) transitions.
[2024-06-01 11:14:58] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 7 cols
[2024-06-01 11:14:58] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 11:14:58] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 11:14:58] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2024-06-01 11:14:58] [INFO ] Invariant cache hit.
[2024-06-01 11:14:58] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-06-01 11:14:58] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 11:14:58] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2024-06-01 11:14:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 135ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 135ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/22 places, 8/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 201 ms. Remains : 7/22 places, 8/20 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-00200-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 491 ms.
Product exploration explored 100000 steps with 0 reset in 561 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 (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 235 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 4626 steps (0 resets) in 11 ms. (385 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 9 factoid took 335 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 11:15:01] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2024-06-01 11:15:01] [INFO ] Invariant cache hit.
[2024-06-01 11:15:01] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 11:15:01] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2024-06-01 11:15:01] [INFO ] Invariant cache hit.
[2024-06-01 11:15:01] [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.
[2024-06-01 11:15:01] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 11:15:01] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2024-06-01 11:15:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 90ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 90ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 7/7 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 117 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 3422 steps (0 resets) in 7 ms. (427 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 341 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 208 ms.
Product exploration explored 100000 steps with 0 reset in 247 ms.
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 11:15:02] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2024-06-01 11:15:02] [INFO ] Invariant cache hit.
[2024-06-01 11:15:02] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 11:15:02] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2024-06-01 11:15:02] [INFO ] Invariant cache hit.
[2024-06-01 11:15:02] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-06-01 11:15:02] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 11:15:02] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2024-06-01 11:15:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 130ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 130ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 208 ms. Remains : 7/7 places, 8/8 transitions.
Treatment of property FMS-PT-00200-LTLFireability-08 finished in 4008 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) U G(p1)))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2024-06-01 11:15:02] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 11:15:02] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 11:15:02] [INFO ] Invariant cache hit.
[2024-06-01 11:15:02] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 11:15:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 3/22 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 28 constraints, problems are : Problem set: 0 solved, 17 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 3/22 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 17/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 45 constraints, problems are : Problem set: 0 solved, 17 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 606ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 609ms
Finished structural reductions in LTL mode , in 1 iterations and 709 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), p0, (AND (NOT p1) p0), true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FMS-PT-00200-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00200-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00200-LTLFireability-10 finished in 953 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(F(p0)))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 9 edges and 16 vertex of which 3 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test 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 1 with 9 rules applied. Total rules applied 13 place count 14 transition count 14
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 12 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 19 place count 11 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 19 place count 11 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 23 place count 9 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 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 26 place count 7 transition count 8
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 7 transition count 8
Applied a total of 27 rules in 10 ms. Remains 7 /22 variables (removed 15) and now considering 8/20 (removed 12) transitions.
[2024-06-01 11:15:03] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 7 cols
[2024-06-01 11:15:03] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 11:15:03] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 11:15:03] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2024-06-01 11:15:03] [INFO ] Invariant cache hit.
[2024-06-01 11:15:03] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-06-01 11:15:03] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 11:15:03] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2024-06-01 11:15:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 10 constraints, problems are : Problem set: 0 solved, 4 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 14 constraints, problems are : Problem set: 0 solved, 4 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 170ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 170ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/22 places, 8/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 248 ms. Remains : 7/22 places, 8/20 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-00200-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FMS-PT-00200-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00200-LTLFireability-11 finished in 367 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) U G(p2)))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
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 1 with 9 rules applied. Total rules applied 13 place count 16 transition count 13
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 16 place count 13 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 16 place count 13 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 11 transition count 11
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 22 place count 10 transition count 10
Applied a total of 22 rules in 8 ms. Remains 10 /22 variables (removed 12) and now considering 10/20 (removed 10) transitions.
// Phase 1: matrix 10 rows 10 cols
[2024-06-01 11:15:04] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 11:15:04] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 11:15:04] [INFO ] Invariant cache hit.
[2024-06-01 11:15:04] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-06-01 11:15:04] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 11:15:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 3/10 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 10/20 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 3/10 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 10/20 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 20 constraints, problems are : Problem set: 0 solved, 6 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 249ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 249ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/22 places, 10/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 335 ms. Remains : 10/22 places, 10/20 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p2), p0, (NOT p1), (AND p0 (NOT p2) p1)]
Running random walk in product with property : FMS-PT-00200-LTLFireability-12
Product exploration explored 100000 steps with 1 reset in 316 ms.
Stack based approach found an accepted trace after 150 steps with 2 reset with depth 32 and stack size 32 in 1 ms.
FORMULA FMS-PT-00200-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00200-LTLFireability-12 finished in 912 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((p0&&(p1||G(!p2)||X(!p3))))))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2024-06-01 11:15:05] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 11:15:05] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-01 11:15:05] [INFO ] Invariant cache hit.
[2024-06-01 11:15:05] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 11:15:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 3/22 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 28 constraints, problems are : Problem set: 0 solved, 17 unsolved in 430 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 3/22 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 17/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 45 constraints, problems are : Problem set: 0 solved, 17 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 761ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 762ms
Finished structural reductions in LTL mode , in 1 iterations and 925 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 379 ms :[true, p3, (OR (NOT p0) (AND (NOT p1) p2 p3)), (AND p2 p3), p2, (OR (NOT p0) (AND (NOT p1) p2 p3)), (OR (NOT p0) (AND (NOT p1) p2 p3))]
Running random walk in product with property : FMS-PT-00200-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00200-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00200-LTLFireability-13 finished in 1349 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((G(!p0)||X(F((p0||G(p1)))))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 8 places and 0 transitions.
Graph (trivial) has 9 edges and 14 vertex of which 3 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test 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 1 with 12 rules applied. Total rules applied 17 place count 12 transition count 12
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 23 place count 9 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 24 place count 8 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 24 place count 8 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 26 place count 7 transition count 8
Applied a total of 26 rules in 7 ms. Remains 7 /22 variables (removed 15) and now considering 8/20 (removed 12) transitions.
// Phase 1: matrix 8 rows 7 cols
[2024-06-01 11:15:06] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 11:15:06] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 11:15:06] [INFO ] Invariant cache hit.
[2024-06-01 11:15:06] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-06-01 11:15:06] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 11:15:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/14 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/14 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 146ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 147ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/22 places, 8/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 226 ms. Remains : 7/22 places, 8/20 transitions.
Stuttering acceptance computed with spot in 104 ms :[false, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-00200-LTLFireability-14
Product exploration explored 100000 steps with 9860 reset in 146 ms.
Product exploration explored 100000 steps with 9716 reset in 171 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 407 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[false, (AND (NOT p0) (NOT p1))]
RANDOM walk for 3621 steps (0 resets) in 6 ms. (517 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 574 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[false, (AND (NOT p0) (NOT p1))]
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 11:15:08] [INFO ] Invariant cache hit.
[2024-06-01 11:15:08] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 11:15:08] [INFO ] Invariant cache hit.
[2024-06-01 11:15:08] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-06-01 11:15:08] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 11:15:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/14 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/14 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 137ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 137ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 216 ms. Remains : 7/7 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 407 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[false, (AND (NOT p0) (NOT p1))]
RANDOM walk for 5228 steps (0 resets) in 7 ms. (653 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 546 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[false, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 9774 reset in 130 ms.
Product exploration explored 100000 steps with 9859 reset in 150 ms.
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 11:15:10] [INFO ] Invariant cache hit.
[2024-06-01 11:15:10] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 11:15:10] [INFO ] Invariant cache hit.
[2024-06-01 11:15:10] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-06-01 11:15:10] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 11:15:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/14 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/14 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 125ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 125ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 225 ms. Remains : 7/7 places, 8/8 transitions.
Treatment of property FMS-PT-00200-LTLFireability-14 finished in 4160 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||F(p1)))))'
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((G(!p0)||X(F((p0||G(p1)))))))'
[2024-06-01 11:15:11] [INFO ] Flatten gal took : 6 ms
[2024-06-01 11:15:11] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 11:15:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 22 places, 20 transitions and 50 arcs took 7 ms.
Total runtime 20214 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA FMS-PT-00200-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FMS-PT-00200-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717240511933

--------------------
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 FMS-PT-00200-LTLFireability-08
ltl formula formula --ltl=/tmp/1216/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 22 places, 20 transitions and 50 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1216/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1216/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1216/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1216/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 23 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 23, there are 26 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( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~206!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 930
pnml2lts-mc( 0/ 4): unique transitions count: 4073
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 283
pnml2lts-mc( 0/ 4): - claim success count: 938
pnml2lts-mc( 0/ 4): - cum. max stack depth: 938
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 938 states 4106 transitions, fanout: 4.377
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.040 sec minimum, 0.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 23450, Transitions per second: 102650
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 21.0 B/state, compr.: 22.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 20 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name FMS-PT-00200-LTLFireability-14
ltl formula formula --ltl=/tmp/1216/ltl_1_
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
pnml2lts-mc( 0/ 4): Petri net has 22 places, 20 transitions and 50 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1216/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1216/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1216/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1216/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 23 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 23, there are 26 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( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~1010!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 386
pnml2lts-mc( 0/ 4): unique states count: 4998
pnml2lts-mc( 0/ 4): unique transitions count: 20491
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1996
pnml2lts-mc( 0/ 4): - claim success count: 5002
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4616
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5002 states 20508 transitions, fanout: 4.100
pnml2lts-mc( 0/ 4): Total exploration time 0.140 sec (0.140 sec minimum, 0.140 sec on average)
pnml2lts-mc( 0/ 4): States per second: 35729, Transitions per second: 146486
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 17.2 B/state, compr.: 18.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 20 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~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="FMS-PT-00200"
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 FMS-PT-00200, 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 r492-smll-171636266600324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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