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.r512-smll-171654406900099.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Parking-PT-864, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654406900099
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 884K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.6K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:42 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 12K Apr 11 20:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 20:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 19:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 19:34 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 427K 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-864-LTLCardinality-00
FORMULA_NAME Parking-PT-864-LTLCardinality-01
FORMULA_NAME Parking-PT-864-LTLCardinality-02
FORMULA_NAME Parking-PT-864-LTLCardinality-03
FORMULA_NAME Parking-PT-864-LTLCardinality-04
FORMULA_NAME Parking-PT-864-LTLCardinality-05
FORMULA_NAME Parking-PT-864-LTLCardinality-06
FORMULA_NAME Parking-PT-864-LTLCardinality-07
FORMULA_NAME Parking-PT-864-LTLCardinality-08
FORMULA_NAME Parking-PT-864-LTLCardinality-09
FORMULA_NAME Parking-PT-864-LTLCardinality-10
FORMULA_NAME Parking-PT-864-LTLCardinality-11
FORMULA_NAME Parking-PT-864-LTLCardinality-12
FORMULA_NAME Parking-PT-864-LTLCardinality-13
FORMULA_NAME Parking-PT-864-LTLCardinality-14
FORMULA_NAME Parking-PT-864-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717248947936

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-864
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:35:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:35:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:35:51] [INFO ] Load time of PNML (sax parser for PT used): 454 ms
[2024-06-01 13:35:51] [INFO ] Transformed 1185 places.
[2024-06-01 13:35:51] [INFO ] Transformed 1697 transitions.
[2024-06-01 13:35:51] [INFO ] Found NUPN structural information;
[2024-06-01 13:35:51] [INFO ] Parsed PT model containing 1185 places and 1697 transitions and 5073 arcs in 765 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 59 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Parking-PT-864-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1177 transition count 1001
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1177 transition count 1001
Applied a total of 16 rules in 481 ms. Remains 1177 /1185 variables (removed 8) and now considering 1001/1009 (removed 8) transitions.
// Phase 1: matrix 1001 rows 1177 cols
[2024-06-01 13:35:52] [INFO ] Computed 280 invariants in 79 ms
[2024-06-01 13:35:54] [INFO ] Implicit Places using invariants in 2413 ms returned [152, 160, 168, 176, 184, 192, 200, 208, 240, 242, 285, 293, 301, 309, 317, 325, 333, 341, 373, 375, 418, 426, 434, 442, 450, 458, 466, 474, 506, 508, 551, 559, 567, 575, 583, 591, 599, 607, 639, 641, 684, 700, 708, 716, 724, 732, 740, 772, 774, 825, 833, 841, 849, 857, 865, 873, 905, 907, 950, 958, 966, 974, 982, 990, 998, 1006, 1038, 1040, 1083, 1091, 1099, 1107, 1115, 1123, 1131, 1139, 1171, 1173]
Discarding 78 places :
Implicit Place search using SMT only with invariants took 2507 ms to find 78 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1099/1185 places, 1001/1009 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 1037 transition count 939
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 1037 transition count 939
Applied a total of 124 rules in 295 ms. Remains 1037 /1099 variables (removed 62) and now considering 939/1001 (removed 62) transitions.
// Phase 1: matrix 939 rows 1037 cols
[2024-06-01 13:35:54] [INFO ] Computed 202 invariants in 14 ms
[2024-06-01 13:35:56] [INFO ] Implicit Places using invariants in 1327 ms returned []
[2024-06-01 13:35:56] [INFO ] Invariant cache hit.
[2024-06-01 13:35:57] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-06-01 13:36:01] [INFO ] Implicit Places using invariants and state equation in 5068 ms returned []
Implicit Place search using SMT with State Equation took 6399 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1037/1185 places, 939/1009 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9733 ms. Remains : 1037/1185 places, 939/1009 transitions.
Support contains 30 out of 1037 places after structural reductions.
[2024-06-01 13:36:02] [INFO ] Flatten gal took : 301 ms
[2024-06-01 13:36:02] [INFO ] Flatten gal took : 140 ms
[2024-06-01 13:36:02] [INFO ] Input system was already deterministic with 939 transitions.
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 40000 steps (154 resets) in 2943 ms. (13 steps per ms) remains 3/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 760 ms. (52 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 615 ms. (64 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 450 ms. (88 steps per ms) remains 3/3 properties
[2024-06-01 13:36:03] [INFO ] Invariant cache hit.
[2024-06-01 13:36:03] [INFO ] State equation strengthened by 248 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) 317/323 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 714/1037 variables, 197/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1037 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 939/1976 variables, 1037/1239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1976 variables, 248/1487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1976 variables, 0/1487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1976 variables, 0/1487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1976/1976 variables, and 1487 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2205 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 1037/1037 constraints, ReadFeed: 248/248 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) 317/323 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 714/1037 variables, 197/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1037 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 939/1976 variables, 1037/1239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1976 variables, 248/1487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1976 variables, 3/1490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1976 variables, 0/1490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1976 variables, 0/1490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1976/1976 variables, and 1490 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2713 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 1037/1037 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 4982ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 1999 ms.
Support contains 4 out of 1037 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1037 transition count 907
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1005 transition count 907
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1005 transition count 875
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 973 transition count 875
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 228 place count 923 transition count 825
Free-agglomeration rule applied 261 times.
Iterating global reduction 2 with 261 rules applied. Total rules applied 489 place count 923 transition count 564
Reduce places removed 261 places and 0 transitions.
Graph (complete) has 1333 edges and 662 vertex of which 263 are kept as prefixes of interest. Removing 399 places using SCC suffix rule.2 ms
Discarding 399 places :
Also discarding 322 output transitions
Drop transitions (Output transitions of discarded places.) removed 322 transitions
Iterating post reduction 2 with 262 rules applied. Total rules applied 751 place count 263 transition count 242
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 781 place count 263 transition count 212
Applied a total of 781 rules in 302 ms. Remains 263 /1037 variables (removed 774) and now considering 212/939 (removed 727) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 303 ms. Remains : 263/1037 places, 212/939 transitions.
RANDOM walk for 859 steps (0 resets) in 19 ms. (42 steps per ms) remains 0/2 properties
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' '!(X(G((F(p1)&&p0))))'
Support contains 4 out of 1037 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Applied a total of 0 rules in 43 ms. Remains 1037 /1037 variables (removed 0) and now considering 939/939 (removed 0) transitions.
[2024-06-01 13:36:11] [INFO ] Invariant cache hit.
[2024-06-01 13:36:12] [INFO ] Implicit Places using invariants in 1005 ms returned [619, 729]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1014 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1037 places, 939/939 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 74 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-06-01 13:36:12] [INFO ] Computed 200 invariants in 9 ms
[2024-06-01 13:36:13] [INFO ] Implicit Places using invariants in 1045 ms returned []
[2024-06-01 13:36:13] [INFO ] Invariant cache hit.
[2024-06-01 13:36:14] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-06-01 13:36:18] [INFO ] Implicit Places using invariants and state equation in 4441 ms returned []
Implicit Place search using SMT with State Equation took 5497 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1037 places, 937/939 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6629 ms. Remains : 1033/1037 places, 937/939 transitions.
Stuttering acceptance computed with spot in 477 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Parking-PT-864-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Parking-PT-864-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLCardinality-03 finished in 7227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&G(p1))))'
Support contains 3 out of 1037 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Applied a total of 0 rules in 42 ms. Remains 1037 /1037 variables (removed 0) and now considering 939/939 (removed 0) transitions.
// Phase 1: matrix 939 rows 1037 cols
[2024-06-01 13:36:18] [INFO ] Computed 202 invariants in 7 ms
[2024-06-01 13:36:20] [INFO ] Implicit Places using invariants in 1309 ms returned [619, 729]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1313 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1037 places, 939/939 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 76 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-06-01 13:36:20] [INFO ] Computed 200 invariants in 6 ms
[2024-06-01 13:36:21] [INFO ] Implicit Places using invariants in 1117 ms returned []
[2024-06-01 13:36:21] [INFO ] Invariant cache hit.
[2024-06-01 13:36:22] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-06-01 13:36:25] [INFO ] Implicit Places using invariants and state equation in 3849 ms returned []
Implicit Place search using SMT with State Equation took 4970 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1037 places, 937/939 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6404 ms. Remains : 1033/1037 places, 937/939 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Parking-PT-864-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Parking-PT-864-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLCardinality-04 finished in 6594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(X(p0)))))'
Support contains 1 out of 1037 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Applied a total of 0 rules in 31 ms. Remains 1037 /1037 variables (removed 0) and now considering 939/939 (removed 0) transitions.
// Phase 1: matrix 939 rows 1037 cols
[2024-06-01 13:36:25] [INFO ] Computed 202 invariants in 5 ms
[2024-06-01 13:36:26] [INFO ] Implicit Places using invariants in 1052 ms returned [619, 729]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1057 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1037 places, 939/939 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 83 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-06-01 13:36:26] [INFO ] Computed 200 invariants in 6 ms
[2024-06-01 13:36:27] [INFO ] Implicit Places using invariants in 1141 ms returned []
[2024-06-01 13:36:27] [INFO ] Invariant cache hit.
[2024-06-01 13:36:28] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-06-01 13:36:31] [INFO ] Implicit Places using invariants and state equation in 3724 ms returned []
Implicit Place search using SMT with State Equation took 4870 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1037 places, 937/939 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6043 ms. Remains : 1033/1037 places, 937/939 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLCardinality-06
Stuttering criterion allowed to conclude after 284 steps with 0 reset in 12 ms.
FORMULA Parking-PT-864-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLCardinality-06 finished in 6212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p1)||p0)))'
Support contains 2 out of 1037 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1036 transition count 906
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1004 transition count 906
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1004 transition count 874
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 972 transition count 874
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 228 place count 922 transition count 824
Applied a total of 228 rules in 122 ms. Remains 922 /1037 variables (removed 115) and now considering 824/939 (removed 115) transitions.
// Phase 1: matrix 824 rows 922 cols
[2024-06-01 13:36:31] [INFO ] Computed 202 invariants in 4 ms
[2024-06-01 13:36:32] [INFO ] Implicit Places using invariants in 995 ms returned [558, 655]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 996 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 920/1037 places, 824/939 transitions.
Applied a total of 0 rules in 39 ms. Remains 920 /920 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1157 ms. Remains : 920/1037 places, 824/939 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-864-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 2166 steps with 8 reset in 46 ms.
FORMULA Parking-PT-864-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLCardinality-08 finished in 1300 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(p0))) U (F(!p0)&&(!p1||G(!p2)))))'
Support contains 6 out of 1037 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Applied a total of 0 rules in 24 ms. Remains 1037 /1037 variables (removed 0) and now considering 939/939 (removed 0) transitions.
// Phase 1: matrix 939 rows 1037 cols
[2024-06-01 13:36:32] [INFO ] Computed 202 invariants in 4 ms
[2024-06-01 13:36:34] [INFO ] Implicit Places using invariants in 1214 ms returned [619, 729]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1215 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1037 places, 939/939 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 54 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-06-01 13:36:34] [INFO ] Computed 200 invariants in 3 ms
[2024-06-01 13:36:35] [INFO ] Implicit Places using invariants in 990 ms returned []
[2024-06-01 13:36:35] [INFO ] Invariant cache hit.
[2024-06-01 13:36:36] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-06-01 13:36:38] [INFO ] Implicit Places using invariants and state equation in 3672 ms returned []
Implicit Place search using SMT with State Equation took 4674 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1037 places, 937/939 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5968 ms. Remains : 1033/1037 places, 937/939 transitions.
Stuttering acceptance computed with spot in 506 ms :[(OR p0 (AND p1 p2)), (NOT p0), p2, p0, (NOT p0), true, (AND (NOT p0) p2), (AND p0 p2), p2]
Running random walk in product with property : Parking-PT-864-LTLCardinality-12
Product exploration explored 100000 steps with 391 reset in 2113 ms.
Product exploration explored 100000 steps with 385 reset in 1657 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 p2 p0), (X (AND p1 p2)), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X p0), (X p1), (X (X (AND p1 p2))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 147 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter sensitive) to 7 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 288 ms :[(OR p0 (AND p1 p2)), (NOT p0), (OR (AND (NOT p0) p2) (AND p1 p2)), p0, true, (AND (NOT p0) p2), p2]
RANDOM walk for 40000 steps (157 resets) in 1931 ms. (20 steps per ms) remains 5/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 618 ms. (64 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 325 ms. (122 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 5/5 properties
[2024-06-01 13:36:44] [INFO ] Invariant cache hit.
[2024-06-01 13:36:44] [INFO ] State equation strengthened by 248 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, 5 unsolved
At refinement iteration 1 (OVERLAPS) 161/167 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 866/1033 variables, 195/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 937/1970 variables, 1033/1233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1970 variables, 248/1481 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1970 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1970/1970 variables, and 1481 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1740 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 161/167 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 866/1033 variables, 195/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 13:36:47] [INFO ] Deduced a trap composed of 67 places in 120 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1033 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 937/1970 variables, 1033/1234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1970 variables, 248/1482 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1970 variables, 5/1487 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1970 variables, 0/1487 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1970 variables, 0/1487 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1970/1970 variables, and 1487 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3789 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 1033/1033 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 5566ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1665 ms.
Support contains 6 out of 1033 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1033 transition count 905
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1001 transition count 905
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1001 transition count 873
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 969 transition count 873
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 224 place count 921 transition count 825
Free-agglomeration rule applied 261 times.
Iterating global reduction 2 with 261 rules applied. Total rules applied 485 place count 921 transition count 564
Reduce places removed 261 places and 0 transitions.
Graph (complete) has 1329 edges and 660 vertex of which 348 are kept as prefixes of interest. Removing 312 places using SCC suffix rule.1 ms
Discarding 312 places :
Also discarding 248 output transitions
Drop transitions (Output transitions of discarded places.) removed 248 transitions
Iterating post reduction 2 with 262 rules applied. Total rules applied 747 place count 348 transition count 316
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 779 place count 348 transition count 284
Applied a total of 779 rules in 141 ms. Remains 348 /1033 variables (removed 685) and now considering 284/937 (removed 653) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 348/1033 places, 284/937 transitions.
RANDOM walk for 40000 steps (8 resets) in 351 ms. (113 steps per ms) remains 1/5 properties
BEST_FIRST walk for 8169 steps (1 resets) in 24 ms. (326 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p2 p0), (X (AND p1 p2)), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X p0), (X p1), (X (X (AND p1 p2))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p1 p2 p0))), (F (NOT (AND (OR p1 (NOT p0)) (OR p2 (NOT p0))))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT (OR p2 p0))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p1)), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT p2)), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT p0)), (F (NOT (AND p2 p0)))]
Property proved to be false thanks to negative knowledge :(F (NOT (AND p1 p2 p0)))
Knowledge based reduction with 21 factoid took 164 ms. Reduced automaton from 7 states, 22 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-864-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-864-LTLCardinality-12 finished in 19684 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1037 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1036 transition count 906
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1004 transition count 906
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1004 transition count 874
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 972 transition count 874
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 226 place count 923 transition count 825
Applied a total of 226 rules in 98 ms. Remains 923 /1037 variables (removed 114) and now considering 825/939 (removed 114) transitions.
// Phase 1: matrix 825 rows 923 cols
[2024-06-01 13:36:52] [INFO ] Computed 202 invariants in 3 ms
[2024-06-01 13:36:53] [INFO ] Implicit Places using invariants in 1102 ms returned [559, 656]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1103 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 921/1037 places, 825/939 transitions.
Applied a total of 0 rules in 50 ms. Remains 921 /921 variables (removed 0) and now considering 825/825 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1251 ms. Remains : 921/1037 places, 825/939 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLCardinality-13
Product exploration explored 100000 steps with 396 reset in 1657 ms.
Product exploration explored 100000 steps with 394 reset in 1477 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 12577 steps (46 resets) in 161 ms. (77 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 921 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 921/921 places, 825/825 transitions.
Applied a total of 0 rules in 54 ms. Remains 921 /921 variables (removed 0) and now considering 825/825 (removed 0) transitions.
// Phase 1: matrix 825 rows 921 cols
[2024-06-01 13:36:57] [INFO ] Computed 200 invariants in 5 ms
[2024-06-01 13:36:59] [INFO ] Implicit Places using invariants in 1106 ms returned []
[2024-06-01 13:36:59] [INFO ] Invariant cache hit.
[2024-06-01 13:37:00] [INFO ] Implicit Places using invariants and state equation in 1569 ms returned []
Implicit Place search using SMT with State Equation took 2677 ms to find 0 implicit places.
[2024-06-01 13:37:00] [INFO ] Redundant transitions in 83 ms returned []
Running 561 sub problems to find dead transitions.
[2024-06-01 13:37:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/913 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/913 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 8/921 variables, 8/200 constraints. Problems are: Problem set: 0 solved, 561 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 Real declared 921/1746 variables, and 200 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/921 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/913 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/913 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 8/921 variables, 8/200 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 1)
(s5 0)
(s6 0)
(s7 1)
(s8 1)
(s9 0)
(s10 0)
(s11 1)
(s12 1)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 1)
(s18 1)
(s19 0)
(s20 0)
(s21 1)
(s22 1)
(s23 0)
(s24 0)
(s25 1)
(s26 1)
(s27 0)
(s28 0)
(s29 1)
(s30 1)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 1)
(s37 0)
(s38 0)
(s39 1)
(s40 1)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 1)
(s48 0)
(s49 1)
(s50 1)
(s51 0)
(s52 0)
(s53 1)
(s54 1)
(s55 0)
(s56 1)
(s57 0)
(s58 1)
(s59 0)
(s60 1)
(s61 0)
(s62 1)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 1)
(s68 1)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 1)
(s76 0)
(s77 1)
(s78 0)
(s79 1)
(s80 0)
(s81 1)
(s82 1)
(s83 0)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 1)
(s91 0)
(s92 1)
(s93 0)
(s94 1)
(s95 0)
(s96 1)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 1)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 1)
(s116 0)
(s117 1)
(s118 0)
(s119 1)
(s120 0)
(s121 1)
(s122 0)
(s123 1)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 1)
(s130 0)
(s131 1)
(s132 0)
(s133 1)
(s134 0)
(s135 1)
(s136 0)
(s137 1)
(s138 0)
(s139 1)
(s140 0)
(s141 1)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 1)
(s213 0)
(s214 1)
(s215 0)
(s216 1)
(s217 0)
(s218 1)
(s219 0)
(s220 1)
(s221 0)
(s222 1)
(s223 0)
(s224 1)
(s225 0)
(s226 1)
(s227 0)
(s228 1)
(s229 0)
(s230 1)
(s231 0)
(s232 1)
(s233 0)
(s234 1)
(s235 0)
(s236 1)
(s237 0)
(s238 1)
(s239 0)
(s240 1)
(s241 0)
(s242 1)
(s243 0)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 1)
(s316 0)
(s317 1)
(s318 0)
(s319 1)
(s320 0)
(s321 1)
(s322 0)
(s323 1)
(s324 0)
(s325 1)
(s326 0)
(s327 1)
(s328 0)
(s329 1)
(s330 0)
(s331 1)
(s332 0)
(s333 1)
(s334 0)
(s335 1)
(s336 0)
(s337 1)
(s338 0)
(s339 1)
(s340 0)
(s341 1)
(s342 0)
(s343 1)
(s344 0)
(s345 1)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 1)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 1)
(s415 1)
(s416 0)
(s417 0)
(s418 1)
(s419 1)
(s420 0)
(s421 0)
(s422 1)
(s423 1)
(s424 0)
(s425 0)
(s426 1)
(s427 1)
(s428 0)
(s429 0)
(s430 1)
(s431 1)
(s432 0)
(s433 0)
(s434 1)
(s435 1)
(s436 0)
(s437 0)
(s438 1)
(s439 1)
(s440 0)
(s441 0)
(s442 1)
(s443 1)
(s444 0)
(s445 0)
(s446 1)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 921/1746 variables, and 200 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/921 constraints, PredecessorRefiner: 0/561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60397ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60427ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63261 ms. Remains : 921/921 places, 825/825 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 7753 steps (27 resets) in 178 ms. (43 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 397 reset in 1528 ms.
Product exploration explored 100000 steps with 398 reset in 1294 ms.
Support contains 2 out of 921 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 921/921 places, 825/825 transitions.
Applied a total of 0 rules in 32 ms. Remains 921 /921 variables (removed 0) and now considering 825/825 (removed 0) transitions.
[2024-06-01 13:38:05] [INFO ] Invariant cache hit.
[2024-06-01 13:38:06] [INFO ] Implicit Places using invariants in 1087 ms returned []
[2024-06-01 13:38:06] [INFO ] Invariant cache hit.
[2024-06-01 13:38:08] [INFO ] Implicit Places using invariants and state equation in 1896 ms returned []
Implicit Place search using SMT with State Equation took 2991 ms to find 0 implicit places.
[2024-06-01 13:38:08] [INFO ] Redundant transitions in 233 ms returned []
Running 561 sub problems to find dead transitions.
[2024-06-01 13:38:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/913 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/913 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 561 unsolved
SMT process timed out in 30232ms, After SMT, problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 30246ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33514 ms. Remains : 921/921 places, 825/825 transitions.
Treatment of property Parking-PT-864-LTLCardinality-13 finished in 106528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1037 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1036 transition count 906
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1004 transition count 906
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1004 transition count 874
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 972 transition count 874
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 228 place count 922 transition count 824
Applied a total of 228 rules in 166 ms. Remains 922 /1037 variables (removed 115) and now considering 824/939 (removed 115) transitions.
// Phase 1: matrix 824 rows 922 cols
[2024-06-01 13:38:39] [INFO ] Computed 202 invariants in 5 ms
[2024-06-01 13:38:40] [INFO ] Implicit Places using invariants in 1004 ms returned [558, 655]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1007 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 920/1037 places, 824/939 transitions.
Applied a total of 0 rules in 27 ms. Remains 920 /920 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1202 ms. Remains : 920/1037 places, 824/939 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLCardinality-14
Product exploration explored 100000 steps with 396 reset in 1356 ms.
Product exploration explored 100000 steps with 395 reset in 1311 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 169 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
RANDOM walk for 422 steps (1 resets) in 18 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 250 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Support contains 2 out of 920 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 920/920 places, 824/824 transitions.
Applied a total of 0 rules in 46 ms. Remains 920 /920 variables (removed 0) and now considering 824/824 (removed 0) transitions.
// Phase 1: matrix 824 rows 920 cols
[2024-06-01 13:38:43] [INFO ] Computed 200 invariants in 5 ms
[2024-06-01 13:38:44] [INFO ] Implicit Places using invariants in 887 ms returned []
[2024-06-01 13:38:44] [INFO ] Invariant cache hit.
[2024-06-01 13:38:46] [INFO ] Implicit Places using invariants and state equation in 1823 ms returned []
Implicit Place search using SMT with State Equation took 2715 ms to find 0 implicit places.
[2024-06-01 13:38:46] [INFO ] Redundant transitions in 6 ms returned []
Running 560 sub problems to find dead transitions.
[2024-06-01 13:38:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/912 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 560 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 1.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 912/1744 variables, and 192 constraints, problems are : Problem set: 0 solved, 560 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 192/200 constraints, State Equation: 0/920 constraints, PredecessorRefiner: 560/560 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/912 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/912 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 2 (OVERLAPS) 8/920 variables, 8/200 constraints. Problems are: Problem set: 0 solved, 560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 920/1744 variables, and 200 constraints, problems are : Problem set: 0 solved, 560 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/920 constraints, PredecessorRefiner: 0/560 constraints, Known Traps: 0/0 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 560 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62939 ms. Remains : 920/920 places, 824/824 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 236 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 1169 steps (2 resets) in 31 ms. (36 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 252 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 394 reset in 1584 ms.
Product exploration explored 100000 steps with 393 reset in 1399 ms.
Support contains 2 out of 920 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 920/920 places, 824/824 transitions.
Applied a total of 0 rules in 27 ms. Remains 920 /920 variables (removed 0) and now considering 824/824 (removed 0) transitions.
[2024-06-01 13:39:51] [INFO ] Invariant cache hit.
[2024-06-01 13:39:51] [INFO ] Implicit Places using invariants in 941 ms returned []
[2024-06-01 13:39:51] [INFO ] Invariant cache hit.
[2024-06-01 13:39:53] [INFO ] Implicit Places using invariants and state equation in 1514 ms returned []
Implicit Place search using SMT with State Equation took 2459 ms to find 0 implicit places.
[2024-06-01 13:39:53] [INFO ] Redundant transitions in 10 ms returned []
Running 560 sub problems to find dead transitions.
[2024-06-01 13:39:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/912 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/912 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 560 unsolved
SMT process timed out in 30167ms, After SMT, problems are : Problem set: 0 solved, 560 unsolved
Search for dead transitions found 0 dead transitions in 30177ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32684 ms. Remains : 920/920 places, 824/824 transitions.
Treatment of property Parking-PT-864-LTLCardinality-14 finished in 104736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(((p2 U p3)&&p1))))||p0)))'
Support contains 10 out of 1037 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Applied a total of 0 rules in 39 ms. Remains 1037 /1037 variables (removed 0) and now considering 939/939 (removed 0) transitions.
// Phase 1: matrix 939 rows 1037 cols
[2024-06-01 13:40:23] [INFO ] Computed 202 invariants in 8 ms
[2024-06-01 13:40:25] [INFO ] Implicit Places using invariants in 1257 ms returned []
[2024-06-01 13:40:25] [INFO ] Invariant cache hit.
[2024-06-01 13:40:25] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-06-01 13:40:28] [INFO ] Implicit Places using invariants and state equation in 3835 ms returned []
Implicit Place search using SMT with State Equation took 5095 ms to find 0 implicit places.
Running 938 sub problems to find dead transitions.
[2024-06-01 13:40:28] [INFO ] Invariant cache hit.
[2024-06-01 13:40:28] [INFO ] State equation strengthened by 248 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1036 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 938 unsolved
SMT process timed out in 30286ms, After SMT, problems are : Problem set: 0 solved, 938 unsolved
Search for dead transitions found 0 dead transitions in 30297ms
Finished structural reductions in LTL mode , in 1 iterations and 35434 ms. Remains : 1037/1037 places, 939/939 transitions.
Stuttering acceptance computed with spot in 381 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), true, (NOT p3)]
Running random walk in product with property : Parking-PT-864-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 4410 ms.
Product exploration explored 100000 steps with 50000 reset in 4125 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 p0 p1 p3 p2), (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 6 states, 9 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-864-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-864-LTLCardinality-15 finished in 44411 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-06-01 13:41:08] [INFO ] Flatten gal took : 70 ms
[2024-06-01 13:41:08] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 13:41:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1037 places, 939 transitions and 3139 arcs took 17 ms.
Total runtime 318234 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA Parking-PT-864-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Parking-PT-864-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717250975457

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name Parking-PT-864-LTLCardinality-13
ltl formula formula --ltl=/tmp/1069/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1037 places, 939 transitions and 3139 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.340 real 0.040 user 0.080 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1069/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1069/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1069/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1069/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1039 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1038, there are 948 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~247 levels ~10000 states ~133528 transitions
pnml2lts-mc( 1/ 4): ~247 levels ~20000 states ~187004 transitions
pnml2lts-mc( 1/ 4): ~247 levels ~40000 states ~300068 transitions
pnml2lts-mc( 1/ 4): ~247 levels ~80000 states ~561920 transitions
pnml2lts-mc( 1/ 4): ~247 levels ~160000 states ~1116548 transitions
pnml2lts-mc( 1/ 4): ~247 levels ~320000 states ~2307088 transitions
pnml2lts-mc( 1/ 4): ~250 levels ~640000 states ~4529424 transitions
pnml2lts-mc( 3/ 4): ~260 levels ~1280000 states ~10229568 transitions
pnml2lts-mc( 3/ 4): ~260 levels ~2560000 states ~21656752 transitions
pnml2lts-mc( 3/ 4): ~260 levels ~5120000 states ~45779336 transitions
pnml2lts-mc( 1/ 4): ~250 levels ~10240000 states ~88455536 transitions
pnml2lts-mc( 1/ 4): ~250 levels ~20480000 states ~179010044 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33459002
pnml2lts-mc( 0/ 4): unique states count: 33459995
pnml2lts-mc( 0/ 4): unique transitions count: 332858766
pnml2lts-mc( 0/ 4): - self-loop count: 67
pnml2lts-mc( 0/ 4): - claim dead count: 299304306
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33460001
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1058
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33460001 states 332859564 transitions, fanout: 9.948
pnml2lts-mc( 0/ 4): Total exploration time 1704.630 sec (1704.600 sec minimum, 1704.610 sec on average)
pnml2lts-mc( 0/ 4): States per second: 19629, Transitions per second: 195268
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 260.0MB, 8.1 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/6.0%
pnml2lts-mc( 0/ 4): Stored 969 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 260.0MB (~256.0MB paged-in)
ltl formula name Parking-PT-864-LTLCardinality-14
ltl formula formula --ltl=/tmp/1069/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1037 places, 939 transitions and 3139 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.020 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1069/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1069/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1069/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1069/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 1038 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1038, there are 951 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~151!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 576
pnml2lts-mc( 0/ 4): unique transitions count: 82526
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 582
pnml2lts-mc( 0/ 4): - cum. max stack depth: 582
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 582 states 83325 transitions, fanout: 143.170
pnml2lts-mc( 0/ 4): Total exploration time 0.330 sec (0.330 sec minimum, 0.330 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1764, Transitions per second: 252500
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.3MB, 17.0 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 969 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.3MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Parking-PT-864"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Parking-PT-864, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r512-smll-171654406900099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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