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.r267-smll-171654405600084.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 Parking-PT-432, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405600084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 11 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 11 17:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 11 17:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 192K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Parking-PT-432-LTLFireability-00
FORMULA_NAME Parking-PT-432-LTLFireability-01
FORMULA_NAME Parking-PT-432-LTLFireability-02
FORMULA_NAME Parking-PT-432-LTLFireability-03
FORMULA_NAME Parking-PT-432-LTLFireability-04
FORMULA_NAME Parking-PT-432-LTLFireability-05
FORMULA_NAME Parking-PT-432-LTLFireability-06
FORMULA_NAME Parking-PT-432-LTLFireability-07
FORMULA_NAME Parking-PT-432-LTLFireability-08
FORMULA_NAME Parking-PT-432-LTLFireability-09
FORMULA_NAME Parking-PT-432-LTLFireability-10
FORMULA_NAME Parking-PT-432-LTLFireability-11
FORMULA_NAME Parking-PT-432-LTLFireability-12
FORMULA_NAME Parking-PT-432-LTLFireability-13
FORMULA_NAME Parking-PT-432-LTLFireability-14
FORMULA_NAME Parking-PT-432-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716658881596

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-432
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 17:41:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 17:41:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 17:41:24] [INFO ] Load time of PNML (sax parser for PT used): 258 ms
[2024-05-25 17:41:24] [INFO ] Transformed 529 places.
[2024-05-25 17:41:24] [INFO ] Transformed 785 transitions.
[2024-05-25 17:41:24] [INFO ] Found NUPN structural information;
[2024-05-25 17:41:24] [INFO ] Parsed PT model containing 529 places and 785 transitions and 2329 arcs in 518 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 transitions.
FORMULA Parking-PT-432-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 457/457 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 525 transition count 453
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 525 transition count 453
Applied a total of 8 rules in 197 ms. Remains 525 /529 variables (removed 4) and now considering 453/457 (removed 4) transitions.
// Phase 1: matrix 453 rows 525 cols
[2024-05-25 17:41:25] [INFO ] Computed 124 invariants in 57 ms
[2024-05-25 17:41:26] [INFO ] Implicit Places using invariants in 1100 ms returned [64, 72, 80, 88, 96, 104, 112, 120, 144, 146, 189, 197, 205, 213, 221, 237, 245, 269, 271, 314, 322, 330, 338, 346, 354, 362, 370, 394, 396, 439, 447, 455, 463, 471, 479, 487, 495, 519, 521]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 1169 ms to find 39 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 486/529 places, 453/457 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 455 transition count 422
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 455 transition count 422
Applied a total of 62 rules in 63 ms. Remains 455 /486 variables (removed 31) and now considering 422/453 (removed 31) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-25 17:41:26] [INFO ] Computed 85 invariants in 9 ms
[2024-05-25 17:41:27] [INFO ] Implicit Places using invariants in 447 ms returned []
[2024-05-25 17:41:27] [INFO ] Invariant cache hit.
[2024-05-25 17:41:27] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-25 17:41:28] [INFO ] Implicit Places using invariants and state equation in 1204 ms returned []
Implicit Place search using SMT with State Equation took 1658 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 455/529 places, 422/457 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3126 ms. Remains : 455/529 places, 422/457 transitions.
Support contains 48 out of 455 places after structural reductions.
[2024-05-25 17:41:28] [INFO ] Flatten gal took : 139 ms
[2024-05-25 17:41:28] [INFO ] Flatten gal took : 71 ms
[2024-05-25 17:41:29] [INFO ] Input system was already deterministic with 422 transitions.
Support contains 45 out of 455 places (down from 48) after GAL structural reductions.
RANDOM walk for 40000 steps (360 resets) in 3288 ms. (12 steps per ms) remains 3/30 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 3/3 properties
[2024-05-25 17:41:30] [INFO ] Invariant cache hit.
[2024-05-25 17:41:30] [INFO ] State equation strengthened by 108 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 288/294 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 161/455 variables, 79/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 422/877 variables, 455/540 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/877 variables, 108/648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/877 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/877 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 877/877 variables, and 648 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1018 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 455/455 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 288/294 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 161/455 variables, 79/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 422/877 variables, 455/540 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/877 variables, 108/648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/877 variables, 3/651 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/877 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/877 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 877/877 variables, and 651 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1108 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 455/455 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2170ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 7695 steps, including 66 resets, run visited all 3 properties in 105 ms. (steps per millisecond=73 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 118 ms.
FORMULA Parking-PT-432-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Parking-PT-432-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 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((p0||G(p1))))'
Support contains 4 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 455 transition count 407
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 440 transition count 407
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 30 place count 440 transition count 391
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 62 place count 424 transition count 391
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 108 place count 401 transition count 368
Applied a total of 108 rules in 144 ms. Remains 401 /455 variables (removed 54) and now considering 368/422 (removed 54) transitions.
// Phase 1: matrix 368 rows 401 cols
[2024-05-25 17:41:33] [INFO ] Computed 85 invariants in 6 ms
[2024-05-25 17:41:33] [INFO ] Implicit Places using invariants in 455 ms returned [178]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 460 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/455 places, 368/422 transitions.
Applied a total of 0 rules in 57 ms. Remains 400 /400 variables (removed 0) and now considering 368/368 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 663 ms. Remains : 400/455 places, 368/422 transitions.
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-432-LTLFireability-01
Stuttering criterion allowed to conclude after 190 steps with 1 reset in 9 ms.
FORMULA Parking-PT-432-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-01 finished in 1003 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 5 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 7 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-25 17:41:34] [INFO ] Computed 85 invariants in 4 ms
[2024-05-25 17:41:34] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-25 17:41:34] [INFO ] Invariant cache hit.
[2024-05-25 17:41:35] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-25 17:41:36] [INFO ] Implicit Places using invariants and state equation in 1504 ms returned []
Implicit Place search using SMT with State Equation took 1808 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2024-05-25 17:41:36] [INFO ] Invariant cache hit.
[2024-05-25 17:41:36] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/455 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-25 17:41:48] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 20 ms to minimize.
[2024-05-25 17:41:49] [INFO ] Deduced a trap composed of 59 places in 180 ms of which 13 ms to minimize.
[2024-05-25 17:41:50] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 2 ms to minimize.
[2024-05-25 17:41:50] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 421 unsolved
SMT process timed out in 30297ms, After SMT, problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 30316ms
Finished structural reductions in LTL mode , in 1 iterations and 32144 ms. Remains : 455/455 places, 422/422 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-432-LTLFireability-02
Product exploration explored 100000 steps with 2061 reset in 1335 ms.
Product exploration explored 100000 steps with 2077 reset in 891 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 378 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 9 states, 29 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 501 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 5261 steps (47 resets) in 128 ms. (40 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 649 ms. Reduced automaton from 9 states, 29 edges and 2 AP (stutter insensitive) to 9 states, 29 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 471 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 495 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 5 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 455 transition count 406
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 439 transition count 406
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 439 transition count 390
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 423 transition count 390
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 108 place count 401 transition count 368
Applied a total of 108 rules in 92 ms. Remains 401 /455 variables (removed 54) and now considering 368/422 (removed 54) transitions.
// Phase 1: matrix 368 rows 401 cols
[2024-05-25 17:42:11] [INFO ] Computed 85 invariants in 4 ms
[2024-05-25 17:42:11] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-05-25 17:42:11] [INFO ] Invariant cache hit.
[2024-05-25 17:42:12] [INFO ] State equation strengthened by 144 read => feed constraints.
[2024-05-25 17:42:13] [INFO ] Implicit Places using invariants and state equation in 1227 ms returned []
Implicit Place search using SMT with State Equation took 1614 ms to find 0 implicit places.
[2024-05-25 17:42:13] [INFO ] Redundant transitions in 35 ms returned []
Running 367 sub problems to find dead transitions.
[2024-05-25 17:42:13] [INFO ] Invariant cache hit.
[2024-05-25 17:42:13] [INFO ] State equation strengthened by 144 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-25 17:42:22] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (OVERLAPS) 368/769 variables, 401/487 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 144/631 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/769 variables, and 631 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 401/401 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (OVERLAPS) 368/769 variables, 401/487 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 144/631 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 367/998 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/769 variables, and 998 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 401/401 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 1/1 constraints]
After SMT, in 60228ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60237ms
Starting structural reductions in SI_LTL mode, iteration 1 : 401/455 places, 368/422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61991 ms. Remains : 401/455 places, 368/422 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 486 ms. Reduced automaton from 9 states, 29 edges and 2 AP (stutter insensitive) to 9 states, 29 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 334 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 2477 steps (21 resets) in 20 ms. (117 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 558 ms. Reduced automaton from 9 states, 29 edges and 2 AP (stutter insensitive) to 9 states, 29 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 325 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 322 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 324 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 2122 reset in 708 ms.
Product exploration explored 100000 steps with 2064 reset in 844 ms.
Support contains 5 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 368/368 transitions.
Applied a total of 0 rules in 16 ms. Remains 401 /401 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2024-05-25 17:43:17] [INFO ] Invariant cache hit.
[2024-05-25 17:43:17] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-05-25 17:43:17] [INFO ] Invariant cache hit.
[2024-05-25 17:43:17] [INFO ] State equation strengthened by 144 read => feed constraints.
[2024-05-25 17:43:18] [INFO ] Implicit Places using invariants and state equation in 1043 ms returned []
Implicit Place search using SMT with State Equation took 1405 ms to find 0 implicit places.
[2024-05-25 17:43:18] [INFO ] Redundant transitions in 3 ms returned []
Running 367 sub problems to find dead transitions.
[2024-05-25 17:43:18] [INFO ] Invariant cache hit.
[2024-05-25 17:43:18] [INFO ] State equation strengthened by 144 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-25 17:43:25] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (OVERLAPS) 368/769 variables, 401/487 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 144/631 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/769 variables, and 631 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 401/401 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (OVERLAPS) 368/769 variables, 401/487 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 144/631 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 367/998 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/769 variables, and 998 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 401/401 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 1/1 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61543 ms. Remains : 401/401 places, 368/368 transitions.
Treatment of property Parking-PT-432-LTLFireability-02 finished in 164786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 7 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-25 17:44:19] [INFO ] Computed 85 invariants in 3 ms
[2024-05-25 17:44:19] [INFO ] Implicit Places using invariants in 290 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 292 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 14 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-05-25 17:44:19] [INFO ] Computed 84 invariants in 2 ms
[2024-05-25 17:44:19] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-25 17:44:19] [INFO ] Invariant cache hit.
[2024-05-25 17:44:19] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-25 17:44:20] [INFO ] Implicit Places using invariants and state equation in 932 ms returned []
Implicit Place search using SMT with State Equation took 1214 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1527 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLFireability-04
Stuttering criterion allowed to conclude after 128 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-04 finished in 1624 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 U (p1||G(!p0))))))'
Support contains 3 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 454 transition count 405
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 438 transition count 405
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 438 transition count 389
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 422 transition count 389
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 112 place count 398 transition count 365
Applied a total of 112 rules in 35 ms. Remains 398 /455 variables (removed 57) and now considering 365/422 (removed 57) transitions.
// Phase 1: matrix 365 rows 398 cols
[2024-05-25 17:44:20] [INFO ] Computed 85 invariants in 5 ms
[2024-05-25 17:44:21] [INFO ] Implicit Places using invariants in 385 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 388 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 397/455 places, 365/422 transitions.
Applied a total of 0 rules in 13 ms. Remains 397 /397 variables (removed 0) and now considering 365/365 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 436 ms. Remains : 397/455 places, 365/422 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Parking-PT-432-LTLFireability-05
Product exploration explored 100000 steps with 966 reset in 577 ms.
Product exploration explored 100000 steps with 964 reset in 655 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 6 factoid took 361 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 6943 steps (62 resets) in 84 ms. (81 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 6 factoid took 355 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 397/397 places, 365/365 transitions.
Applied a total of 0 rules in 13 ms. Remains 397 /397 variables (removed 0) and now considering 365/365 (removed 0) transitions.
// Phase 1: matrix 365 rows 397 cols
[2024-05-25 17:44:23] [INFO ] Computed 84 invariants in 2 ms
[2024-05-25 17:44:23] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-05-25 17:44:23] [INFO ] Invariant cache hit.
[2024-05-25 17:44:24] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 912 ms to find 0 implicit places.
[2024-05-25 17:44:24] [INFO ] Redundant transitions in 1 ms returned []
Running 249 sub problems to find dead transitions.
[2024-05-25 17:44:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 4/397 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 365/762 variables, 397/481 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 481 constraints, problems are : Problem set: 0 solved, 249 unsolved in 16577 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 397/397 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 4/397 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 365/762 variables, 397/481 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 249/730 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/762 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 0/762 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 730 constraints, problems are : Problem set: 0 solved, 249 unsolved in 22223 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 397/397 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints]
After SMT, in 38839ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 38842ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39775 ms. Remains : 397/397 places, 365/365 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 233 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 7531 steps (67 resets) in 78 ms. (95 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 6 factoid took 339 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 970 reset in 500 ms.
Product exploration explored 100000 steps with 965 reset in 559 ms.
Support contains 3 out of 397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 397/397 places, 365/365 transitions.
Applied a total of 0 rules in 14 ms. Remains 397 /397 variables (removed 0) and now considering 365/365 (removed 0) transitions.
[2024-05-25 17:45:05] [INFO ] Invariant cache hit.
[2024-05-25 17:45:05] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-25 17:45:05] [INFO ] Invariant cache hit.
[2024-05-25 17:45:06] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 876 ms to find 0 implicit places.
[2024-05-25 17:45:06] [INFO ] Redundant transitions in 1 ms returned []
Running 249 sub problems to find dead transitions.
[2024-05-25 17:45:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 4/397 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 365/762 variables, 397/481 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 481 constraints, problems are : Problem set: 0 solved, 249 unsolved in 17900 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 397/397 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 4/397 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 365/762 variables, 397/481 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 249/730 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/762 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 0/762 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 730 constraints, problems are : Problem set: 0 solved, 249 unsolved in 22522 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 397/397 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints]
After SMT, in 40458ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 40461ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 41359 ms. Remains : 397/397 places, 365/365 transitions.
Treatment of property Parking-PT-432-LTLFireability-05 finished in 85988 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)||X((p0 U p1)))))'
Support contains 3 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 6 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-25 17:45:46] [INFO ] Computed 85 invariants in 3 ms
[2024-05-25 17:45:47] [INFO ] Implicit Places using invariants in 409 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 410 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 12 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-05-25 17:45:47] [INFO ] Computed 84 invariants in 2 ms
[2024-05-25 17:45:47] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-25 17:45:47] [INFO ] Invariant cache hit.
[2024-05-25 17:45:47] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-25 17:45:48] [INFO ] Implicit Places using invariants and state equation in 873 ms returned []
Implicit Place search using SMT with State Equation took 1210 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1639 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Parking-PT-432-LTLFireability-06
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-06 finished in 1765 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(((X(X(p0)) U p1)||F((G(p2)||p3)))))'
Support contains 5 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 6 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-25 17:45:48] [INFO ] Computed 85 invariants in 5 ms
[2024-05-25 17:45:48] [INFO ] Implicit Places using invariants in 362 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 363 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 12 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-05-25 17:45:48] [INFO ] Computed 84 invariants in 2 ms
[2024-05-25 17:45:49] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-05-25 17:45:49] [INFO ] Invariant cache hit.
[2024-05-25 17:45:49] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-25 17:45:50] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1289 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1672 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : Parking-PT-432-LTLFireability-07
Product exploration explored 100000 steps with 911 reset in 525 ms.
Product exploration explored 100000 steps with 910 reset in 584 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p3 (NOT p2) (NOT p0)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 102 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter sensitive) to 4 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (361 resets) in 631 ms. (63 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
[2024-05-25 17:45:52] [INFO ] Invariant cache hit.
[2024-05-25 17:45:52] [INFO ] State equation strengthened by 108 read => feed constraints.
Problem apf5 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 214/217 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 236/453 variables, 81/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 421/874 variables, 453/537 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/874 variables, 108/645 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/874 variables, 0/645 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/874 variables, 0/645 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 874/874 variables, and 645 constraints, problems are : Problem set: 1 solved, 1 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 143/145 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 308/453 variables, 82/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-25 17:45:52] [INFO ] Deduced a trap composed of 59 places in 127 ms of which 4 ms to minimize.
[2024-05-25 17:45:52] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 2 ms to minimize.
[2024-05-25 17:45:52] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 3/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 0/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 421/874 variables, 453/540 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/874 variables, 108/648 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/874 variables, 1/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/874 variables, 0/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/874 variables, 0/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 874/874 variables, and 649 constraints, problems are : Problem set: 1 solved, 1 unsolved in 690 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 1031ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 61 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p3 (NOT p2) (NOT p0)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p1 (NOT p2) p3))]
False Knowledge obtained : [(F (NOT (OR p1 p2 p3))), (F (NOT (OR p3 p0))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR p1 p3))), (F (NOT p3)), (F p2), (F p1), (F p0), (F (NOT (OR p2 p3)))]
Knowledge based reduction with 14 factoid took 361 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Support contains 5 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 421/421 transitions.
Applied a total of 0 rules in 6 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2024-05-25 17:45:53] [INFO ] Invariant cache hit.
[2024-05-25 17:45:54] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-25 17:45:54] [INFO ] Invariant cache hit.
[2024-05-25 17:45:54] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-25 17:45:55] [INFO ] Implicit Places using invariants and state equation in 926 ms returned []
Implicit Place search using SMT with State Equation took 1281 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2024-05-25 17:45:55] [INFO ] Invariant cache hit.
[2024-05-25 17:45:55] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-25 17:46:02] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 2 ms to minimize.
[2024-05-25 17:46:02] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
[2024-05-25 17:46:02] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
[2024-05-25 17:46:03] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 421/874 variables, 453/541 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/874 variables, 108/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/874 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 874/874 variables, and 649 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 421/874 variables, 453/541 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/874 variables, 108/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/874 variables, 420/1069 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/874 variables, 0/1069 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 874/874 variables, and 1069 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 4/4 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Finished structural reductions in LTL mode , in 1 iterations and 61413 ms. Remains : 453/453 places, 421/421 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p3 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3)))), (X p3), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 95 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
RANDOM walk for 40000 steps (364 resets) in 366 ms. (108 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
[2024-05-25 17:46:55] [INFO ] Invariant cache hit.
[2024-05-25 17:46:55] [INFO ] State equation strengthened by 108 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) 143/145 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 308/453 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 421/874 variables, 453/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/874 variables, 108/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/874 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/874 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 874/874 variables, and 645 constraints, problems are : Problem set: 0 solved, 1 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 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) 143/145 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 308/453 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 17:46:56] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 3 ms to minimize.
[2024-05-25 17:46:56] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 2 ms to minimize.
[2024-05-25 17:46:56] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 421/874 variables, 453/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/874 variables, 108/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/874 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/874 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/874 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 874/874 variables, and 649 constraints, problems are : Problem set: 0 solved, 1 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1117ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 56 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=28 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) p3 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3)))), (X p3), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p3 p2))), (F (NOT (OR p3 p0))), (F p0), (F (NOT (OR p3 (NOT p2)))), (F (NOT (OR p1 p3))), (F (NOT p3)), (F p2), (F p1)]
Knowledge based reduction with 9 factoid took 291 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 909 reset in 526 ms.
Product exploration explored 100000 steps with 914 reset in 587 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Support contains 5 out of 453 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 453/453 places, 421/421 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 453 transition count 421
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 15 place count 453 transition count 421
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 30 place count 453 transition count 421
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 45 place count 438 transition count 406
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 60 place count 438 transition count 406
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 81 place count 438 transition count 420
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 81 rules in 77 ms. Remains 438 /453 variables (removed 15) and now considering 420/421 (removed 1) transitions.
[2024-05-25 17:46:59] [INFO ] Redundant transitions in 2 ms returned []
Running 419 sub problems to find dead transitions.
// Phase 1: matrix 420 rows 438 cols
[2024-05-25 17:46:59] [INFO ] Computed 84 invariants in 2 ms
[2024-05-25 17:46:59] [INFO ] State equation strengthened by 153 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/438 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-05-25 17:47:06] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-25 17:47:06] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
[2024-05-25 17:47:06] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-25 17:47:06] [INFO ] Deduced a trap composed of 62 places in 47 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
[2024-05-25 17:47:07] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-25 17:47:07] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 2 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-25 17:47:07] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 1 ms to minimize.
[2024-05-25 17:47:07] [INFO ] Deduced a trap composed of 60 places in 46 ms of which 1 ms to minimize.
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 8/92 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 0/92 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 4 (OVERLAPS) 420/858 variables, 438/530 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/858 variables, 153/683 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/858 variables, 0/683 constraints. Problems are: Problem set: 50 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 858/858 variables, and 683 constraints, problems are : Problem set: 50 solved, 369 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 438/438 constraints, ReadFeed: 153/153 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 50 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 0/0 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 37/438 variables, 84/84 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 8/92 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 0/92 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 4 (OVERLAPS) 420/858 variables, 438/530 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/858 variables, 153/683 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/858 variables, 369/1052 constraints. Problems are: Problem set: 50 solved, 369 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/858 variables, 0/1052 constraints. Problems are: Problem set: 50 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 858/858 variables, and 1052 constraints, problems are : Problem set: 50 solved, 369 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 438/438 constraints, ReadFeed: 153/153 constraints, PredecessorRefiner: 369/419 constraints, Known Traps: 8/8 constraints]
After SMT, in 60127ms problems are : Problem set: 50 solved, 369 unsolved
Search for dead transitions found 50 dead transitions in 60133ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 438/453 places, 370/421 transitions.
Graph (complete) has 1092 edges and 438 vertex of which 402 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.3 ms
Discarding 36 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 29 ms. Remains 402 /438 variables (removed 36) and now considering 370/370 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 402/453 places, 370/421 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60264 ms. Remains : 402/453 places, 370/421 transitions.
Support contains 5 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 421/421 transitions.
Applied a total of 0 rules in 15 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-05-25 17:47:59] [INFO ] Computed 84 invariants in 2 ms
[2024-05-25 17:47:59] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-25 17:47:59] [INFO ] Invariant cache hit.
[2024-05-25 17:47:59] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-25 17:48:00] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1259 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2024-05-25 17:48:00] [INFO ] Invariant cache hit.
[2024-05-25 17:48:00] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-25 17:48:07] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
[2024-05-25 17:48:08] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 2 ms to minimize.
[2024-05-25 17:48:08] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 2 ms to minimize.
[2024-05-25 17:48:08] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 421/874 variables, 453/541 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/874 variables, 108/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 874/874 variables, and 649 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 421/874 variables, 453/541 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/874 variables, 108/649 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/874 variables, 420/1069 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/874 variables, 0/1069 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 874/874 variables, and 1069 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 453/453 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 4/4 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Finished structural reductions in LTL mode , in 1 iterations and 61395 ms. Remains : 453/453 places, 421/421 transitions.
Treatment of property Parking-PT-432-LTLFireability-07 finished in 192349 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||(p1&&X(G((p1||G(p2)))))))))'
Support contains 5 out of 455 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 454 transition count 406
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 439 transition count 406
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 30 place count 439 transition count 391
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 424 transition count 391
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 110 place count 399 transition count 366
Applied a total of 110 rules in 36 ms. Remains 399 /455 variables (removed 56) and now considering 366/422 (removed 56) transitions.
// Phase 1: matrix 366 rows 399 cols
[2024-05-25 17:49:00] [INFO ] Computed 85 invariants in 2 ms
[2024-05-25 17:49:01] [INFO ] Implicit Places using invariants in 350 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 352 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 398/455 places, 366/422 transitions.
Applied a total of 0 rules in 11 ms. Remains 398 /398 variables (removed 0) and now considering 366/366 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 402 ms. Remains : 398/455 places, 366/422 transitions.
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : Parking-PT-432-LTLFireability-09
Product exploration explored 100000 steps with 950 reset in 765 ms.
Product exploration explored 100000 steps with 950 reset in 722 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (OR (AND p1 (NOT p0)) (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (AND p1 (NOT p0) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 119 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (372 resets) in 277 ms. (143 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 1/1 properties
// Phase 1: matrix 366 rows 398 cols
[2024-05-25 17:49:03] [INFO ] Computed 84 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 178/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 217/400 variables, 183/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 174/574 variables, 116/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 58/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/574 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/764 variables, and 362 constraints, problems are : Problem set: 0 solved, 1 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 63/84 constraints, State Equation: 299/398 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 178/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 217/400 variables, 183/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 174/574 variables, 116/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 58/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/574 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 574/764 variables, and 363 constraints, problems are : Problem set: 0 solved, 1 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 63/84 constraints, State Equation: 299/398 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 423ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (OR (AND p1 (NOT p0)) (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (AND p1 (NOT p0) p2)))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p2 p1))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2 p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p1)), (F p0), (F (NOT (OR p0 (NOT p2) p1)))]
Knowledge based reduction with 19 factoid took 411 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 398/398 places, 366/366 transitions.
Applied a total of 0 rules in 9 ms. Remains 398 /398 variables (removed 0) and now considering 366/366 (removed 0) transitions.
[2024-05-25 17:49:04] [INFO ] Invariant cache hit.
[2024-05-25 17:49:04] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-25 17:49:05] [INFO ] Invariant cache hit.
[2024-05-25 17:49:05] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
[2024-05-25 17:49:05] [INFO ] Redundant transitions in 1 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-25 17:49:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 4/398 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 366/764 variables, 398/482 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (OVERLAPS) 0/764 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 764/764 variables, and 482 constraints, problems are : Problem set: 0 solved, 250 unsolved in 17707 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 4/398 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 366/764 variables, 398/482 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 250/732 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 0/764 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 764/764 variables, and 732 constraints, problems are : Problem set: 0 solved, 250 unsolved in 22500 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
After SMT, in 40250ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 40253ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 41146 ms. Remains : 398/398 places, 366/366 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (AND (NOT p0) p1)), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (AND (NOT p0) p1))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 114 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (372 resets) in 391 ms. (102 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
[2024-05-25 17:49:46] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 178/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 217/400 variables, 183/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 174/574 variables, 116/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 58/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/574 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/764 variables, and 362 constraints, problems are : Problem set: 0 solved, 1 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 63/84 constraints, State Equation: 299/398 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 178/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 217/400 variables, 183/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 174/574 variables, 116/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 58/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/574 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 574/764 variables, and 363 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 63/84 constraints, State Equation: 299/398 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 523ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (AND (NOT p0) p1)), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (AND (NOT p0) p1))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p2 p1))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2 p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p1)), (F p0), (F (NOT (OR p0 (NOT p2) p1)))]
Knowledge based reduction with 19 factoid took 579 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 956 reset in 949 ms.
Product exploration explored 100000 steps with 950 reset in 610 ms.
Support contains 5 out of 398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 398/398 places, 366/366 transitions.
Applied a total of 0 rules in 22 ms. Remains 398 /398 variables (removed 0) and now considering 366/366 (removed 0) transitions.
[2024-05-25 17:49:49] [INFO ] Invariant cache hit.
[2024-05-25 17:49:49] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-05-25 17:49:49] [INFO ] Invariant cache hit.
[2024-05-25 17:49:50] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 859 ms to find 0 implicit places.
[2024-05-25 17:49:50] [INFO ] Redundant transitions in 2 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-25 17:49:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 4/398 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 366/764 variables, 398/482 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (OVERLAPS) 0/764 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 764/764 variables, and 482 constraints, problems are : Problem set: 0 solved, 250 unsolved in 25079 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 4/398 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 366/764 variables, 398/482 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 250/732 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 0/764 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 764/764 variables, and 732 constraints, problems are : Problem set: 0 solved, 250 unsolved in 23363 ms.
Refiners :[Positive P Invariants (semi-flows): 84/84 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
After SMT, in 48500ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 48504ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49393 ms. Remains : 398/398 places, 366/366 transitions.
Treatment of property Parking-PT-432-LTLFireability-09 finished in 98321 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p1||X(p1)))))'
Support contains 3 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 12 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-25 17:50:39] [INFO ] Computed 85 invariants in 3 ms
[2024-05-25 17:50:39] [INFO ] Implicit Places using invariants in 506 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 508 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 15 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-05-25 17:50:39] [INFO ] Computed 84 invariants in 3 ms
[2024-05-25 17:50:39] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-05-25 17:50:39] [INFO ] Invariant cache hit.
[2024-05-25 17:50:40] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-25 17:50:40] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1331 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1866 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 278 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : Parking-PT-432-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-11 finished in 2177 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' '!(((p0 U X(p1)) U p0))'
Support contains 3 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 13 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-25 17:50:41] [INFO ] Computed 85 invariants in 3 ms
[2024-05-25 17:50:41] [INFO ] Implicit Places using invariants in 438 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 440 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 17 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-05-25 17:50:41] [INFO ] Computed 84 invariants in 7 ms
[2024-05-25 17:50:42] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-25 17:50:42] [INFO ] Invariant cache hit.
[2024-05-25 17:50:42] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-25 17:50:43] [INFO ] Implicit Places using invariants and state equation in 1168 ms returned []
Implicit Place search using SMT with State Equation took 1505 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1976 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-432-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-12 finished in 2078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((((!X(F(p1)) U p2)&&G(p3))||p0))))'
Support contains 7 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 8 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-25 17:50:43] [INFO ] Computed 85 invariants in 2 ms
[2024-05-25 17:50:43] [INFO ] Implicit Places using invariants in 414 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 415 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 15 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-05-25 17:50:43] [INFO ] Computed 84 invariants in 3 ms
[2024-05-25 17:50:44] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-25 17:50:44] [INFO ] Invariant cache hit.
[2024-05-25 17:50:44] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-25 17:50:44] [INFO ] Implicit Places using invariants and state equation in 842 ms returned []
Implicit Place search using SMT with State Equation took 1202 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1640 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 296 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : Parking-PT-432-LTLFireability-13
Stuttering criterion allowed to conclude after 102 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-13 finished in 1959 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p1))||p0)))'
Support contains 4 out of 455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 455/455 places, 422/422 transitions.
Applied a total of 0 rules in 7 ms. Remains 455 /455 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 455 cols
[2024-05-25 17:50:45] [INFO ] Computed 85 invariants in 3 ms
[2024-05-25 17:50:45] [INFO ] Implicit Places using invariants in 353 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 355 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/455 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 453 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 421
Applied a total of 2 rules in 15 ms. Remains 453 /454 variables (removed 1) and now considering 421/422 (removed 1) transitions.
// Phase 1: matrix 421 rows 453 cols
[2024-05-25 17:50:45] [INFO ] Computed 84 invariants in 1 ms
[2024-05-25 17:50:46] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-05-25 17:50:46] [INFO ] Invariant cache hit.
[2024-05-25 17:50:46] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-25 17:50:46] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1321 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 453/455 places, 421/422 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1699 ms. Remains : 453/455 places, 421/422 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Parking-PT-432-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-LTLFireability-15 finished in 1845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
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 U (p1||G(!p0))))))'
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(((X(X(p0)) U p1)||F((G(p2)||p3)))))'
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||(p1&&X(G((p1||G(p2)))))))))'
[2024-05-25 17:50:47] [INFO ] Flatten gal took : 117 ms
[2024-05-25 17:50:47] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-05-25 17:50:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 455 places, 422 transitions and 1394 arcs took 11 ms.
Total runtime 563669 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Parking-PT-432

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 455
TRANSITIONS: 422
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.010s, Sys 0.009s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.003s, 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: 2077
MODEL NAME: /home/mcc/execution/414/model
455 places, 422 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 Parking-PT-432-LTLFireability-02 CANNOT_COMPUTE
FORMULA Parking-PT-432-LTLFireability-05 CANNOT_COMPUTE
FORMULA Parking-PT-432-LTLFireability-07 CANNOT_COMPUTE
FORMULA Parking-PT-432-LTLFireability-09 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716660099423

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="Parking-PT-432"
export BK_EXAMINATION="LTLFireability"
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 Parking-PT-432, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r267-smll-171654405600084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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