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.r025-smll-171620166400331.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 greatspnxred
Input is AutonomousCar-PT-08a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166400331
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 448K 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 AutonomousCar-PT-08a-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716353157499

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-08a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 04:45:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 04:45:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 04:45:59] [INFO ] Load time of PNML (sax parser for PT used): 350 ms
[2024-05-22 04:45:59] [INFO ] Transformed 81 places.
[2024-05-22 04:45:59] [INFO ] Transformed 849 transitions.
[2024-05-22 04:45:59] [INFO ] Found NUPN structural information;
[2024-05-22 04:45:59] [INFO ] Parsed PT model containing 81 places and 849 transitions and 8894 arcs in 580 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 275 transitions
Reduce redundant transitions removed 275 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-08a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-08a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 574/574 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 75 transition count 528
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 75 transition count 528
Applied a total of 12 rules in 54 ms. Remains 75 /81 variables (removed 6) and now considering 528/574 (removed 46) transitions.
// Phase 1: matrix 528 rows 75 cols
[2024-05-22 04:46:00] [INFO ] Computed 12 invariants in 33 ms
[2024-05-22 04:46:01] [INFO ] Implicit Places using invariants in 1158 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1221 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/81 places, 528/574 transitions.
Applied a total of 0 rules in 16 ms. Remains 74 /74 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1331 ms. Remains : 74/81 places, 528/574 transitions.
Support contains 17 out of 74 places after structural reductions.
[2024-05-22 04:46:02] [INFO ] Flatten gal took : 525 ms
[2024-05-22 04:46:02] [INFO ] Flatten gal took : 188 ms
[2024-05-22 04:46:03] [INFO ] Input system was already deterministic with 528 transitions.
RANDOM walk for 40000 steps (2042 resets) in 3620 ms. (11 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40004 steps (184 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
// Phase 1: matrix 528 rows 74 cols
[2024-05-22 04:46:04] [INFO ] Computed 11 invariants in 6 ms
[2024-05-22 04:46:04] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/74 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 527/601 variables, 74/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/602 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/602 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 86 constraints, problems are : Problem set: 0 solved, 1 unsolved in 535 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 04:46:05] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 57/74 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 04:46:05] [INFO ] Deduced a trap composed of 14 places in 318 ms of which 6 ms to minimize.
[2024-05-22 04:46:05] [INFO ] Deduced a trap composed of 7 places in 284 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 527/601 variables, 74/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/601 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/601 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/602 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/602 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/602 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 602/602 variables, and 90 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1129 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1732ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 206 ms.
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 528/528 transitions.
Graph (complete) has 774 edges and 74 vertex of which 73 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 73 transition count 517
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 20 place count 65 transition count 516
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 64 transition count 516
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 21 place count 64 transition count 515
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 63 transition count 515
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 26 place count 60 transition count 488
Iterating global reduction 3 with 3 rules applied. Total rules applied 29 place count 60 transition count 488
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 33 place count 58 transition count 486
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 40 place count 58 transition count 479
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 103 place count 51 transition count 423
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 51 transition count 423
Applied a total of 104 rules in 318 ms. Remains 51 /74 variables (removed 23) and now considering 423/528 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 318 ms. Remains : 51/74 places, 423/528 transitions.
RANDOM walk for 40000 steps (24 resets) in 542 ms. (73 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (17 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 425127 steps, run visited all 1 properties in 877 ms. (steps per millisecond=484 )
Probabilistic random walk after 425127 steps, saw 58474 distinct states, run finished after 883 ms. (steps per millisecond=481 ) properties seen :1
Computed a total of 2 stabilizing places and 2 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 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 528/528 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 73 transition count 519
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 65 transition count 519
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 63 transition count 501
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 63 transition count 501
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 61 transition count 499
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 60 transition count 499
Applied a total of 26 rules in 163 ms. Remains 60 /74 variables (removed 14) and now considering 499/528 (removed 29) transitions.
// Phase 1: matrix 499 rows 60 cols
[2024-05-22 04:46:08] [INFO ] Computed 11 invariants in 6 ms
[2024-05-22 04:46:08] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-22 04:46:08] [INFO ] Invariant cache hit.
[2024-05-22 04:46:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:46:08] [INFO ] Implicit Places using invariants and state equation in 429 ms returned [56, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 682 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/74 places, 499/528 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 58 transition count 498
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 57 transition count 498
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 56 transition count 497
Applied a total of 4 rules in 52 ms. Remains 56 /58 variables (removed 2) and now considering 497/499 (removed 2) transitions.
// Phase 1: matrix 497 rows 56 cols
[2024-05-22 04:46:08] [INFO ] Computed 9 invariants in 8 ms
[2024-05-22 04:46:09] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-22 04:46:09] [INFO ] Invariant cache hit.
[2024-05-22 04:46:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 04:46:09] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/74 places, 497/528 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1616 ms. Remains : 56/74 places, 497/528 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLCardinality-00
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 3 ms.
FORMULA AutonomousCar-PT-08a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLCardinality-00 finished in 1915 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 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 528/528 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 73 transition count 519
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 65 transition count 519
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 62 transition count 492
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 62 transition count 492
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 60 transition count 490
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 59 transition count 490
Applied a total of 28 rules in 65 ms. Remains 59 /74 variables (removed 15) and now considering 490/528 (removed 38) transitions.
// Phase 1: matrix 490 rows 59 cols
[2024-05-22 04:46:09] [INFO ] Computed 11 invariants in 6 ms
[2024-05-22 04:46:10] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-22 04:46:10] [INFO ] Invariant cache hit.
[2024-05-22 04:46:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:46:10] [INFO ] Implicit Places using invariants and state equation in 342 ms returned [55, 57]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 559 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/74 places, 490/528 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 57 transition count 489
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 56 transition count 489
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 55 transition count 488
Applied a total of 4 rules in 50 ms. Remains 55 /57 variables (removed 2) and now considering 488/490 (removed 2) transitions.
// Phase 1: matrix 488 rows 55 cols
[2024-05-22 04:46:10] [INFO ] Computed 9 invariants in 4 ms
[2024-05-22 04:46:10] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-22 04:46:10] [INFO ] Invariant cache hit.
[2024-05-22 04:46:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 04:46:11] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/74 places, 488/528 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1229 ms. Remains : 55/74 places, 488/528 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLCardinality-02
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 4 ms.
FORMULA AutonomousCar-PT-08a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLCardinality-02 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' '!(X((G(p0) U G(p1))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 528/528 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 72 transition count 510
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 72 transition count 510
Applied a total of 4 rules in 6 ms. Remains 72 /74 variables (removed 2) and now considering 510/528 (removed 18) transitions.
// Phase 1: matrix 510 rows 72 cols
[2024-05-22 04:46:11] [INFO ] Computed 11 invariants in 5 ms
[2024-05-22 04:46:11] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-22 04:46:11] [INFO ] Invariant cache hit.
[2024-05-22 04:46:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:46:11] [INFO ] Implicit Places using invariants and state equation in 361 ms returned [68, 70]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 551 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/74 places, 510/528 transitions.
Applied a total of 0 rules in 3 ms. Remains 70 /70 variables (removed 0) and now considering 510/510 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 562 ms. Remains : 70/74 places, 510/528 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLCardinality-06
Product exploration explored 100000 steps with 171 reset in 298 ms.
Product exploration explored 100000 steps with 370 reset in 203 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 202 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
RANDOM walk for 40000 steps (2098 resets) in 1354 ms. (29 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (178 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
// Phase 1: matrix 510 rows 70 cols
[2024-05-22 04:46:13] [INFO ] Computed 9 invariants in 19 ms
[2024-05-22 04:46:13] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/61 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 503/564 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/577 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/579 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/579 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/580 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/580 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/580 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 580/580 variables, and 80 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/61 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 503/564 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/577 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/577 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/579 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/579 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/580 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/580 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/580 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 580/580 variables, and 81 constraints, problems are : Problem set: 0 solved, 1 unsolved in 501 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1570ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 145 ms.
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 510/510 transitions.
Graph (complete) has 744 edges and 70 vertex of which 69 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 69 transition count 498
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 21 place count 61 transition count 497
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 60 transition count 497
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 22 place count 60 transition count 496
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 24 place count 59 transition count 496
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 25 place count 58 transition count 495
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 58 transition count 495
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 56 transition count 493
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 37 place count 56 transition count 486
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 100 place count 49 transition count 430
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 101 place count 48 transition count 429
Applied a total of 101 rules in 123 ms. Remains 48 /70 variables (removed 22) and now considering 429/510 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 48/70 places, 429/510 transitions.
RANDOM walk for 40000 steps (38 resets) in 541 ms. (73 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (164 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 86233 steps, run visited all 1 properties in 252 ms. (steps per millisecond=342 )
Probabilistic random walk after 86233 steps, saw 13556 distinct states, run finished after 257 ms. (steps per millisecond=335 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 13 factoid took 218 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-08a-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-08a-LTLCardinality-06 finished in 4944 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(((X(X(p1))||p0)&&(X(X(p1))||F(p2))))))'
Support contains 6 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 528/528 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 71 transition count 501
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 71 transition count 501
Applied a total of 6 rules in 5 ms. Remains 71 /74 variables (removed 3) and now considering 501/528 (removed 27) transitions.
// Phase 1: matrix 501 rows 71 cols
[2024-05-22 04:46:16] [INFO ] Computed 11 invariants in 4 ms
[2024-05-22 04:46:16] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-22 04:46:16] [INFO ] Invariant cache hit.
[2024-05-22 04:46:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:46:16] [INFO ] Implicit Places using invariants and state equation in 363 ms returned [67, 69]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 556 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/74 places, 501/528 transitions.
Applied a total of 0 rules in 3 ms. Remains 69 /69 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 565 ms. Remains : 69/74 places, 501/528 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
Running random walk in product with property : AutonomousCar-PT-08a-LTLCardinality-11
Product exploration explored 100000 steps with 5605 reset in 1039 ms.
Product exploration explored 100000 steps with 5613 reset in 689 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 167 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 343 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
RANDOM walk for 40000 steps (2034 resets) in 682 ms. (58 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40004 steps (172 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (160 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (174 resets) in 288 ms. (138 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (175 resets) in 59 ms. (666 steps per ms) remains 4/4 properties
// Phase 1: matrix 501 rows 69 cols
[2024-05-22 04:46:19] [INFO ] Computed 9 invariants in 4 ms
[2024-05-22 04:46:19] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 16/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/62 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 496/558 variables, 62/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/568 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/569 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/569 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/570 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/570 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/570 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 79 constraints, problems are : Problem set: 0 solved, 4 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 16/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/62 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 496/558 variables, 62/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/568 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/569 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 04:46:21] [INFO ] Deduced a trap composed of 14 places in 315 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/569 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/569 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/570 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/570 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/570 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 570/570 variables, and 84 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1851 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 2341ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1180 ms.
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 501/501 transitions.
Graph (complete) has 734 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 68 transition count 492
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 62 transition count 490
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 60 transition count 490
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 60 transition count 489
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 21 place count 59 transition count 489
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 23 place count 58 transition count 488
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 58 transition count 482
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 54 rules applied. Total rules applied 83 place count 52 transition count 434
Applied a total of 83 rules in 113 ms. Remains 52 /69 variables (removed 17) and now considering 434/501 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 52/69 places, 434/501 transitions.
RANDOM walk for 40000 steps (512 resets) in 544 ms. (73 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (92 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (46 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (54 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (67 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 583896 steps, run visited all 4 properties in 2849 ms. (steps per millisecond=204 )
Probabilistic random walk after 583896 steps, saw 87980 distinct states, run finished after 2849 ms. (steps per millisecond=204 ) properties seen :4
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 466 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 347 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
Stuttering acceptance computed with spot in 342 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 501/501 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2024-05-22 04:46:27] [INFO ] Invariant cache hit.
[2024-05-22 04:46:28] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-22 04:46:28] [INFO ] Invariant cache hit.
[2024-05-22 04:46:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:46:28] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-05-22 04:46:28] [INFO ] Invariant cache hit.
[2024-05-22 04:46:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (OVERLAPS) 500/569 variables, 69/78 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-22 04:46:43] [INFO ] Deduced a trap composed of 22 places in 370 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-22 04:46:48] [INFO ] Deduced a trap composed of 14 places in 369 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/570 variables, and 81 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (OVERLAPS) 500/569 variables, 69/80 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 500/580 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 569/570 variables, and 580 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 2/2 constraints]
After SMT, in 65566ms problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 65579ms
Finished structural reductions in LTL mode , in 1 iterations and 66225 ms. Remains : 69/69 places, 501/501 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p2) p0))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 176 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
RANDOM walk for 40000 steps (2050 resets) in 429 ms. (93 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40004 steps (178 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (178 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (177 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (176 resets) in 72 ms. (547 steps per ms) remains 4/4 properties
[2024-05-22 04:47:34] [INFO ] Invariant cache hit.
[2024-05-22 04:47:34] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 16/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/62 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 496/558 variables, 62/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/568 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/569 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/569 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/570 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/570 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/570 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 79 constraints, problems are : Problem set: 0 solved, 4 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 16/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/62 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 496/558 variables, 62/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/568 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 04:47:35] [INFO ] Deduced a trap composed of 14 places in 225 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/569 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/569 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/570 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/570 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/570 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 570/570 variables, and 84 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2198 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 2571ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 686 ms.
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 501/501 transitions.
Graph (complete) has 734 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 68 transition count 492
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 62 transition count 490
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 60 transition count 490
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 60 transition count 489
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 21 place count 59 transition count 489
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 23 place count 58 transition count 488
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 58 transition count 482
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 54 rules applied. Total rules applied 83 place count 52 transition count 434
Applied a total of 83 rules in 73 ms. Remains 52 /69 variables (removed 17) and now considering 434/501 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 52/69 places, 434/501 transitions.
RANDOM walk for 40000 steps (613 resets) in 394 ms. (101 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (114 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (60 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (39 resets) in 74 ms. (533 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (68 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 583896 steps, run visited all 4 properties in 2670 ms. (steps per millisecond=218 )
Probabilistic random walk after 583896 steps, saw 87980 distinct states, run finished after 2670 ms. (steps per millisecond=218 ) properties seen :4
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p2) p0))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 512 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
Stuttering acceptance computed with spot in 349 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
Stuttering acceptance computed with spot in 326 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
Product exploration explored 100000 steps with 5613 reset in 658 ms.
Product exploration explored 100000 steps with 5595 reset in 728 ms.
Applying partial POR strategy [false, false, true, false, false, true, true, true]
Stuttering acceptance computed with spot in 389 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 501/501 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 69 transition count 501
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 8 place count 69 transition count 503
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 69 transition count 503
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 69 transition count 503
Deduced a syphon composed of 10 places in 1 ms
Applied a total of 10 rules in 76 ms. Remains 69 /69 variables (removed 0) and now considering 503/501 (removed -2) transitions.
[2024-05-22 04:47:44] [INFO ] Redundant transitions in 60 ms returned []
Running 502 sub problems to find dead transitions.
// Phase 1: matrix 503 rows 69 cols
[2024-05-22 04:47:44] [INFO ] Computed 9 invariants in 5 ms
[2024-05-22 04:47:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-22 04:47:53] [INFO ] Deduced a trap composed of 6 places in 416 ms of which 3 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-22 04:47:53] [INFO ] Deduced a trap composed of 6 places in 375 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-22 04:47:54] [INFO ] Deduced a trap composed of 6 places in 371 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-22 04:47:54] [INFO ] Deduced a trap composed of 6 places in 353 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-22 04:47:55] [INFO ] Deduced a trap composed of 6 places in 358 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-22 04:47:55] [INFO ] Deduced a trap composed of 6 places in 346 ms of which 2 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-22 04:47:55] [INFO ] Deduced a trap composed of 6 places in 337 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-22 04:47:57] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 1 ms to minimize.
Problem TDEAD221 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 8/17 constraints. Problems are: Problem set: 8 solved, 494 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/17 constraints. Problems are: Problem set: 8 solved, 494 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD500 is UNSAT
At refinement iteration 4 (OVERLAPS) 502/571 variables, 69/86 constraints. Problems are: Problem set: 12 solved, 490 unsolved
[2024-05-22 04:48:04] [INFO ] Deduced a trap composed of 21 places in 476 ms of which 2 ms to minimize.
[2024-05-22 04:48:09] [INFO ] Deduced a trap composed of 19 places in 381 ms of which 2 ms to minimize.
[2024-05-22 04:48:10] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 3/89 constraints. Problems are: Problem set: 12 solved, 490 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/571 variables, 0/89 constraints. Problems are: Problem set: 12 solved, 490 unsolved
SMT process timed out in 35010ms, After SMT, problems are : Problem set: 12 solved, 490 unsolved
Search for dead transitions found 12 dead transitions in 35023ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 69/69 places, 491/501 transitions.
Graph (complete) has 725 edges and 69 vertex of which 59 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 23 ms. Remains 59 /69 variables (removed 10) and now considering 491/491 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/69 places, 491/501 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 35197 ms. Remains : 59/69 places, 491/501 transitions.
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 501/501 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 69 cols
[2024-05-22 04:48:19] [INFO ] Computed 9 invariants in 7 ms
[2024-05-22 04:48:20] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-22 04:48:20] [INFO ] Invariant cache hit.
[2024-05-22 04:48:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:48:20] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-05-22 04:48:20] [INFO ] Invariant cache hit.
[2024-05-22 04:48:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (OVERLAPS) 500/569 variables, 69/78 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-22 04:48:33] [INFO ] Deduced a trap composed of 22 places in 289 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-22 04:48:39] [INFO ] Deduced a trap composed of 14 places in 421 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 500 unsolved
SMT process timed out in 34573ms, After SMT, problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 34580ms
Finished structural reductions in LTL mode , in 1 iterations and 35127 ms. Remains : 69/69 places, 501/501 transitions.
Treatment of property AutonomousCar-PT-08a-LTLCardinality-11 finished in 159198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 528/528 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 73 transition count 519
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 65 transition count 518
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 64 transition count 518
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 63 transition count 509
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 63 transition count 509
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 61 transition count 507
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 60 transition count 507
Applied a total of 26 rules in 77 ms. Remains 60 /74 variables (removed 14) and now considering 507/528 (removed 21) transitions.
// Phase 1: matrix 507 rows 60 cols
[2024-05-22 04:48:55] [INFO ] Computed 11 invariants in 4 ms
[2024-05-22 04:48:55] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-22 04:48:55] [INFO ] Invariant cache hit.
[2024-05-22 04:48:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:48:56] [INFO ] Implicit Places using invariants and state equation in 509 ms returned [56, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 798 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/74 places, 507/528 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 58 transition count 506
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 57 transition count 506
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 56 transition count 505
Applied a total of 4 rules in 55 ms. Remains 56 /58 variables (removed 2) and now considering 505/507 (removed 2) transitions.
// Phase 1: matrix 505 rows 56 cols
[2024-05-22 04:48:56] [INFO ] Computed 9 invariants in 4 ms
[2024-05-22 04:48:56] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-22 04:48:56] [INFO ] Invariant cache hit.
[2024-05-22 04:48:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 04:48:57] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/74 places, 505/528 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1709 ms. Remains : 56/74 places, 505/528 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-08a-LTLCardinality-15
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLCardinality-15 finished in 1781 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(((X(X(p1))||p0)&&(X(X(p1))||F(p2))))))'
[2024-05-22 04:48:57] [INFO ] Flatten gal took : 65 ms
[2024-05-22 04:48:57] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-05-22 04:48:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 74 places, 528 transitions and 6039 arcs took 24 ms.
Total runtime 178225 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-08a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 74
TRANSITIONS: 528
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.064s, Sys 0.004s]


SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.006s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1222
MODEL NAME: /home/mcc/execution/416/model
74 places, 528 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA AutonomousCar-PT-08a-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716353356383

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML

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="AutonomousCar-PT-08a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is AutonomousCar-PT-08a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r025-smll-171620166400331"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-08a.tgz
mv AutonomousCar-PT-08a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;