Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089127900437.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r140-tall-162089127900437
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 06:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 06:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 08:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 08:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 192K May 5 16:51 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-00
FORMULA_NAME Parking-PT-432-01
FORMULA_NAME Parking-PT-432-02
FORMULA_NAME Parking-PT-432-03
FORMULA_NAME Parking-PT-432-04
FORMULA_NAME Parking-PT-432-05
FORMULA_NAME Parking-PT-432-06
FORMULA_NAME Parking-PT-432-07
FORMULA_NAME Parking-PT-432-08
FORMULA_NAME Parking-PT-432-09
FORMULA_NAME Parking-PT-432-10
FORMULA_NAME Parking-PT-432-11
FORMULA_NAME Parking-PT-432-12
FORMULA_NAME Parking-PT-432-13
FORMULA_NAME Parking-PT-432-14
FORMULA_NAME Parking-PT-432-15

=== Now, execution of the tool begins

BK_START 1620980705256

Running Version 0
[2021-05-14 08:25:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 08:25:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 08:25:07] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2021-05-14 08:25:07] [INFO ] Transformed 529 places.
[2021-05-14 08:25:07] [INFO ] Transformed 785 transitions.
[2021-05-14 08:25:07] [INFO ] Found NUPN structural information;
[2021-05-14 08:25:07] [INFO ] Parsed PT model containing 529 places and 785 transitions in 132 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 08:25:07] [INFO ] Initial state test concluded for 3 properties.
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 transitions.
FORMULA Parking-PT-432-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 529 places. Attempting structural reductions.
Starting structural reductions, 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 90 ms. Remains 525 /529 variables (removed 4) and now considering 453/457 (removed 4) transitions.
// Phase 1: matrix 453 rows 525 cols
[2021-05-14 08:25:07] [INFO ] Computed 124 place invariants in 28 ms
[2021-05-14 08:25:08] [INFO ] Implicit Places using invariants in 472 ms returned [64, 72, 80, 88, 96, 104, 112, 120, 144, 189, 197, 205, 213, 221, 229, 237, 271, 314, 322, 330, 338, 346, 354, 362, 370, 394, 396, 439, 447, 455, 463, 471, 479, 487, 495, 519]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 499 ms to find 36 implicit places.
// Phase 1: matrix 453 rows 489 cols
[2021-05-14 08:25:08] [INFO ] Computed 88 place invariants in 16 ms
[2021-05-14 08:25:08] [INFO ] Dead Transitions using invariants and state equation in 259 ms returned []
Starting structural reductions, iteration 1 : 489/529 places, 453/457 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 461 transition count 425
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 461 transition count 425
Applied a total of 56 rules in 36 ms. Remains 461 /489 variables (removed 28) and now considering 425/453 (removed 28) transitions.
// Phase 1: matrix 425 rows 461 cols
[2021-05-14 08:25:08] [INFO ] Computed 88 place invariants in 6 ms
[2021-05-14 08:25:08] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 425 rows 461 cols
[2021-05-14 08:25:08] [INFO ] Computed 88 place invariants in 3 ms
[2021-05-14 08:25:08] [INFO ] State equation strengthened by 108 read => feed constraints.
[2021-05-14 08:25:09] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 461/529 places, 425/457 transitions.
[2021-05-14 08:25:09] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-14 08:25:09] [INFO ] Flatten gal took : 65 ms
FORMULA Parking-PT-432-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 08:25:09] [INFO ] Flatten gal took : 32 ms
[2021-05-14 08:25:09] [INFO ] Input system was already deterministic with 425 transitions.
Incomplete random walk after 100000 steps, including 911 resets, run finished after 702 ms. (steps per millisecond=142 ) properties (out of 35) seen :28
Running SMT prover for 7 properties.
// Phase 1: matrix 425 rows 461 cols
[2021-05-14 08:25:10] [INFO ] Computed 88 place invariants in 2 ms
[2021-05-14 08:25:10] [INFO ] [Real]Absence check using 88 positive place invariants in 15 ms returned sat
[2021-05-14 08:25:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:25:10] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2021-05-14 08:25:10] [INFO ] State equation strengthened by 108 read => feed constraints.
[2021-05-14 08:25:10] [INFO ] [Real]Added 108 Read/Feed constraints in 11 ms returned sat
[2021-05-14 08:25:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:25:10] [INFO ] [Nat]Absence check using 88 positive place invariants in 15 ms returned sat
[2021-05-14 08:25:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:25:10] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2021-05-14 08:25:10] [INFO ] [Nat]Added 108 Read/Feed constraints in 13 ms returned sat
[2021-05-14 08:25:10] [INFO ] Computed and/alt/rep : 420/1214/420 causal constraints (skipped 4 transitions) in 26 ms.
[2021-05-14 08:25:12] [INFO ] Added : 318 causal constraints over 64 iterations in 1769 ms. Result :sat
[2021-05-14 08:25:12] [INFO ] [Real]Absence check using 88 positive place invariants in 20 ms returned sat
[2021-05-14 08:25:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:25:13] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2021-05-14 08:25:13] [INFO ] [Real]Added 108 Read/Feed constraints in 9 ms returned sat
[2021-05-14 08:25:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:25:13] [INFO ] [Nat]Absence check using 88 positive place invariants in 16 ms returned sat
[2021-05-14 08:25:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:25:13] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2021-05-14 08:25:13] [INFO ] [Nat]Added 108 Read/Feed constraints in 11 ms returned sat
[2021-05-14 08:25:13] [INFO ] Computed and/alt/rep : 420/1214/420 causal constraints (skipped 4 transitions) in 23 ms.
[2021-05-14 08:25:15] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 3 ms to minimize.
[2021-05-14 08:25:15] [INFO ] Deduced a trap composed of 60 places in 42 ms of which 1 ms to minimize.
[2021-05-14 08:25:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 221 ms
[2021-05-14 08:25:15] [INFO ] Added : 323 causal constraints over 65 iterations in 1937 ms. Result :sat
[2021-05-14 08:25:15] [INFO ] [Real]Absence check using 88 positive place invariants in 15 ms returned sat
[2021-05-14 08:25:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:25:15] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2021-05-14 08:25:15] [INFO ] [Real]Added 108 Read/Feed constraints in 10 ms returned sat
[2021-05-14 08:25:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:25:15] [INFO ] [Nat]Absence check using 88 positive place invariants in 15 ms returned sat
[2021-05-14 08:25:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:25:15] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2021-05-14 08:25:15] [INFO ] [Nat]Added 108 Read/Feed constraints in 11 ms returned sat
[2021-05-14 08:25:15] [INFO ] Computed and/alt/rep : 420/1214/420 causal constraints (skipped 4 transitions) in 21 ms.
[2021-05-14 08:25:17] [INFO ] Added : 318 causal constraints over 64 iterations in 1673 ms. Result :sat
[2021-05-14 08:25:17] [INFO ] [Real]Absence check using 88 positive place invariants in 15 ms returned sat
[2021-05-14 08:25:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:25:17] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2021-05-14 08:25:17] [INFO ] [Real]Added 108 Read/Feed constraints in 11 ms returned sat
[2021-05-14 08:25:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:25:17] [INFO ] [Nat]Absence check using 88 positive place invariants in 18 ms returned sat
[2021-05-14 08:25:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:25:17] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2021-05-14 08:25:17] [INFO ] [Nat]Added 108 Read/Feed constraints in 11 ms returned sat
[2021-05-14 08:25:17] [INFO ] Computed and/alt/rep : 420/1214/420 causal constraints (skipped 4 transitions) in 26 ms.
[2021-05-14 08:25:19] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 1 ms to minimize.
[2021-05-14 08:25:19] [INFO ] Deduced a trap composed of 59 places in 38 ms of which 1 ms to minimize.
[2021-05-14 08:25:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2021-05-14 08:25:19] [INFO ] Added : 252 causal constraints over 51 iterations in 1512 ms. Result :sat
[2021-05-14 08:25:19] [INFO ] [Real]Absence check using 88 positive place invariants in 14 ms returned sat
[2021-05-14 08:25:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:25:19] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2021-05-14 08:25:19] [INFO ] [Real]Added 108 Read/Feed constraints in 10 ms returned sat
[2021-05-14 08:25:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:25:19] [INFO ] [Nat]Absence check using 88 positive place invariants in 15 ms returned sat
[2021-05-14 08:25:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:25:19] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2021-05-14 08:25:19] [INFO ] [Nat]Added 108 Read/Feed constraints in 10 ms returned sat
[2021-05-14 08:25:19] [INFO ] Computed and/alt/rep : 420/1214/420 causal constraints (skipped 4 transitions) in 23 ms.
[2021-05-14 08:25:21] [INFO ] Deduced a trap composed of 59 places in 34 ms of which 1 ms to minimize.
[2021-05-14 08:25:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2021-05-14 08:25:21] [INFO ] Added : 307 causal constraints over 62 iterations in 1753 ms. Result :sat
[2021-05-14 08:25:21] [INFO ] [Real]Absence check using 88 positive place invariants in 14 ms returned sat
[2021-05-14 08:25:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:25:21] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2021-05-14 08:25:21] [INFO ] [Real]Added 108 Read/Feed constraints in 9 ms returned sat
[2021-05-14 08:25:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:25:21] [INFO ] [Nat]Absence check using 88 positive place invariants in 16 ms returned sat
[2021-05-14 08:25:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:25:21] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2021-05-14 08:25:22] [INFO ] [Nat]Added 108 Read/Feed constraints in 11 ms returned sat
[2021-05-14 08:25:22] [INFO ] Computed and/alt/rep : 420/1214/420 causal constraints (skipped 4 transitions) in 22 ms.
[2021-05-14 08:25:23] [INFO ] Deduced a trap composed of 59 places in 23 ms of which 1 ms to minimize.
[2021-05-14 08:25:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2021-05-14 08:25:23] [INFO ] Added : 309 causal constraints over 63 iterations in 1666 ms. Result :sat
[2021-05-14 08:25:23] [INFO ] [Real]Absence check using 88 positive place invariants in 13 ms returned sat
[2021-05-14 08:25:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:25:23] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2021-05-14 08:25:23] [INFO ] [Real]Added 108 Read/Feed constraints in 10 ms returned sat
[2021-05-14 08:25:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:25:23] [INFO ] [Nat]Absence check using 88 positive place invariants in 15 ms returned sat
[2021-05-14 08:25:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:25:24] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2021-05-14 08:25:24] [INFO ] [Nat]Added 108 Read/Feed constraints in 11 ms returned sat
[2021-05-14 08:25:24] [INFO ] Computed and/alt/rep : 420/1214/420 causal constraints (skipped 4 transitions) in 21 ms.
[2021-05-14 08:25:25] [INFO ] Deduced a trap composed of 60 places in 38 ms of which 0 ms to minimize.
[2021-05-14 08:25:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2021-05-14 08:25:25] [INFO ] Added : 321 causal constraints over 65 iterations in 1762 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&F(G(p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 425/425 transitions.
Drop transitions 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 461 transition count 410
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 446 transition count 410
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 446 transition count 395
Deduced a syphon composed of 15 places in 10 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 431 transition count 395
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 429 transition count 393
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 429 transition count 393
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 110 place count 406 transition count 370
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 405 transition count 377
Applied a total of 112 rules in 104 ms. Remains 405 /461 variables (removed 56) and now considering 377/425 (removed 48) transitions.
// Phase 1: matrix 377 rows 405 cols
[2021-05-14 08:25:26] [INFO ] Computed 88 place invariants in 2 ms
[2021-05-14 08:25:26] [INFO ] Implicit Places using invariants in 189 ms returned [116, 187, 210, 402]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 191 ms to find 4 implicit places.
[2021-05-14 08:25:26] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 377 rows 401 cols
[2021-05-14 08:25:26] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-14 08:25:26] [INFO ] Dead Transitions using invariants and state equation in 180 ms returned []
Starting structural reductions, iteration 1 : 401/461 places, 377/425 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 400 transition count 376
Applied a total of 2 rules in 28 ms. Remains 400 /401 variables (removed 1) and now considering 376/377 (removed 1) transitions.
// Phase 1: matrix 376 rows 400 cols
[2021-05-14 08:25:26] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-14 08:25:26] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 376 rows 400 cols
[2021-05-14 08:25:26] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-14 08:25:26] [INFO ] State equation strengthened by 155 read => feed constraints.
[2021-05-14 08:25:27] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 400/461 places, 376/425 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Parking-PT-432-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s212 1), p1:(OR (AND (OR (NEQ s314 1) (NEQ s379 1)) (NEQ s274 1)) (NEQ s268 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1788 reset in 596 ms.
Product exploration explored 100000 steps with 1893 reset in 606 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1766 reset in 498 ms.
Product exploration explored 100000 steps with 1875 reset in 519 ms.
[2021-05-14 08:25:29] [INFO ] Flatten gal took : 42 ms
[2021-05-14 08:25:30] [INFO ] Flatten gal took : 43 ms
[2021-05-14 08:25:30] [INFO ] Time to serialize gal into /tmp/LTL5308357981095106174.gal : 7 ms
[2021-05-14 08:25:30] [INFO ] Time to serialize properties into /tmp/LTL16393008586087439206.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5308357981095106174.gal, -t, CGAL, -LTL, /tmp/LTL16393008586087439206.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5308357981095106174.gal -t CGAL -LTL /tmp/LTL16393008586087439206.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(p278==1)"))&&(F(G("((((p410!=1)||(p504!=1))&&(p360!=1))||(p352!=1))")))))
Formula 0 simplified : !(F"(p278==1)" & FG"((((p410!=1)||(p504!=1))&&(p360!=1))||(p352!=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.50062e+06 deadlock states
Detected timeout of ITS tools.
[2021-05-14 08:25:45] [INFO ] Flatten gal took : 33 ms
[2021-05-14 08:25:45] [INFO ] Applying decomposition
[2021-05-14 08:25:45] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4759478915035305041.txt, -o, /tmp/graph4759478915035305041.bin, -w, /tmp/graph4759478915035305041.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4759478915035305041.bin, -l, -1, -v, -w, /tmp/graph4759478915035305041.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 08:25:45] [INFO ] Decomposing Gal with order
[2021-05-14 08:25:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 08:25:45] [INFO ] Removed a total of 786 redundant transitions.
[2021-05-14 08:25:45] [INFO ] Flatten gal took : 82 ms
[2021-05-14 08:25:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 89 labels/synchronizations in 42 ms.
[2021-05-14 08:25:45] [INFO ] Time to serialize gal into /tmp/LTL2383766471831890880.gal : 9 ms
[2021-05-14 08:25:45] [INFO ] Time to serialize properties into /tmp/LTL2976727783109145328.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2383766471831890880.gal, -t, CGAL, -LTL, /tmp/LTL2976727783109145328.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2383766471831890880.gal -t CGAL -LTL /tmp/LTL2976727783109145328.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("(i10.i2.u81.p278==1)"))&&(F(G("((((i7.i1.u118.p410!=1)||(i11.i0.u141.p504!=1))&&(i10.i3.u103.p360!=1))||(i10.i1.u102.p352!=1))")))))
Formula 0 simplified : !(F"(i10.i2.u81.p278==1)" & FG"((((i7.i1.u118.p410!=1)||(i11.i0.u141.p504!=1))&&(i10.i3.u103.p360!=1))||(i10.i1.u102.p352!=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.50062e+06 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11190635268329580614
[2021-05-14 08:26:00] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11190635268329580614
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11190635268329580614]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11190635268329580614] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11190635268329580614] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property Parking-PT-432-00 finished in 35582 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0 U ((p0 U p1)||G((p2||F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 425/425 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 461 transition count 411
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 447 transition count 411
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 28 place count 447 transition count 396
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 58 place count 432 transition count 396
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 430 transition count 394
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 430 transition count 394
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 108 place count 407 transition count 371
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 406 transition count 378
Applied a total of 110 rules in 71 ms. Remains 406 /461 variables (removed 55) and now considering 378/425 (removed 47) transitions.
// Phase 1: matrix 378 rows 406 cols
[2021-05-14 08:26:01] [INFO ] Computed 88 place invariants in 2 ms
[2021-05-14 08:26:01] [INFO ] Implicit Places using invariants in 192 ms returned [118, 189, 212, 402]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 194 ms to find 4 implicit places.
[2021-05-14 08:26:01] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 378 rows 402 cols
[2021-05-14 08:26:01] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-14 08:26:01] [INFO ] Dead Transitions using invariants and state equation in 166 ms returned []
Starting structural reductions, iteration 1 : 402/461 places, 378/425 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 401 transition count 377
Applied a total of 2 rules in 23 ms. Remains 401 /402 variables (removed 1) and now considering 377/378 (removed 1) transitions.
// Phase 1: matrix 377 rows 401 cols
[2021-05-14 08:26:01] [INFO ] Computed 84 place invariants in 1 ms
[2021-05-14 08:26:02] [INFO ] Implicit Places using invariants in 155 ms returned []
// Phase 1: matrix 377 rows 401 cols
[2021-05-14 08:26:02] [INFO ] Computed 84 place invariants in 1 ms
[2021-05-14 08:26:02] [INFO ] State equation strengthened by 144 read => feed constraints.
[2021-05-14 08:26:02] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 401/461 places, 377/425 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Parking-PT-432-01 automaton TGBA [mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s236 1) (EQ s289 1)), p0:(EQ s92 1), p2:(AND (EQ s353 1) (EQ s400 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 99 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-01 finished in 1353 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 425/425 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 459 transition count 423
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 459 transition count 423
Applied a total of 4 rules in 20 ms. Remains 459 /461 variables (removed 2) and now considering 423/425 (removed 2) transitions.
// Phase 1: matrix 423 rows 459 cols
[2021-05-14 08:26:02] [INFO ] Computed 88 place invariants in 2 ms
[2021-05-14 08:26:03] [INFO ] Implicit Places using invariants in 152 ms returned [129, 215, 239, 455]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 153 ms to find 4 implicit places.
// Phase 1: matrix 423 rows 455 cols
[2021-05-14 08:26:03] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-14 08:26:03] [INFO ] Dead Transitions using invariants and state equation in 211 ms returned []
Starting structural reductions, iteration 1 : 455/461 places, 423/425 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 453 transition count 421
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 453 transition count 421
Applied a total of 4 rules in 13 ms. Remains 453 /455 variables (removed 2) and now considering 421/423 (removed 2) transitions.
// Phase 1: matrix 421 rows 453 cols
[2021-05-14 08:26:03] [INFO ] Computed 84 place invariants in 10 ms
[2021-05-14 08:26:03] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 421 rows 453 cols
[2021-05-14 08:26:03] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-14 08:26:03] [INFO ] State equation strengthened by 108 read => feed constraints.
[2021-05-14 08:26:04] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 453/461 places, 421/425 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-432-02 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (NEQ s91 1) (NEQ s131 1)), p0:(AND (EQ s148 1) (EQ s231 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1039 ms.
Product exploration explored 100000 steps with 50000 reset in 1066 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 1118 ms.
Product exploration explored 100000 steps with 50000 reset in 1210 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 453 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 453/453 places, 421/421 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 453 transition count 421
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 16 place count 453 transition count 421
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 32 place count 453 transition count 421
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 48 place count 437 transition count 405
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 64 place count 437 transition count 405
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 39 places in 1 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 87 place count 437 transition count 421
Deduced a syphon composed of 39 places in 0 ms
Applied a total of 87 rules in 57 ms. Remains 437 /453 variables (removed 16) and now considering 421/421 (removed 0) transitions.
[2021-05-14 08:26:09] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 421 rows 437 cols
[2021-05-14 08:26:09] [INFO ] Computed 84 place invariants in 1 ms
[2021-05-14 08:26:09] [INFO ] Dead Transitions using invariants and state equation in 181 ms returned []
Finished structural reductions, in 1 iterations. Remains : 437/453 places, 421/421 transitions.
Product exploration explored 100000 steps with 50000 reset in 2932 ms.
Product exploration explored 100000 steps with 50000 reset in 2794 ms.
[2021-05-14 08:26:15] [INFO ] Flatten gal took : 18 ms
[2021-05-14 08:26:15] [INFO ] Flatten gal took : 18 ms
[2021-05-14 08:26:15] [INFO ] Time to serialize gal into /tmp/LTL15638908280021679100.gal : 2 ms
[2021-05-14 08:26:15] [INFO ] Time to serialize properties into /tmp/LTL17357944342452101946.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15638908280021679100.gal, -t, CGAL, -LTL, /tmp/LTL17357944342452101946.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15638908280021679100.gal -t CGAL -LTL /tmp/LTL17357944342452101946.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((p167==1)&&(p266==1))"))||(X(F("((p101!=1)||(p150!=1))")))))
Formula 0 simplified : !(G"((p167==1)&&(p266==1))" | XF"((p101!=1)||(p150!=1))")
Detected timeout of ITS tools.
[2021-05-14 08:26:30] [INFO ] Flatten gal took : 16 ms
[2021-05-14 08:26:30] [INFO ] Applying decomposition
[2021-05-14 08:26:30] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph468643646306999106.txt, -o, /tmp/graph468643646306999106.bin, -w, /tmp/graph468643646306999106.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph468643646306999106.bin, -l, -1, -v, -w, /tmp/graph468643646306999106.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 08:26:30] [INFO ] Decomposing Gal with order
[2021-05-14 08:26:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 08:26:30] [INFO ] Removed a total of 57 redundant transitions.
[2021-05-14 08:26:30] [INFO ] Flatten gal took : 32 ms
[2021-05-14 08:26:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-14 08:26:30] [INFO ] Time to serialize gal into /tmp/LTL11633571127305034789.gal : 4 ms
[2021-05-14 08:26:30] [INFO ] Time to serialize properties into /tmp/LTL13285135989749602898.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11633571127305034789.gal, -t, CGAL, -LTL, /tmp/LTL13285135989749602898.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11633571127305034789.gal -t CGAL -LTL /tmp/LTL13285135989749602898.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("((i8.i0.i1.u56.p167==1)&&(i8.i0.i0.u80.p266==1))"))||(X(F("((i4.u47.p101!=1)||(i4.u47.p150!=1))")))))
Formula 0 simplified : !(G"((i8.i0.i1.u56.p167==1)&&(i8.i0.i0.u80.p266==1))" | XF"((i4.u47.p101!=1)||(i4.u47.p150!=1))")
Reverse transition relation is NOT exact ! Due to transitions i4.u47.t104, i8.i1.i3.u83.t70, i9.i1.i4.u119.t36, i12.i1.i3.u154.t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/417/4/421
Computing Next relation with stutter on 1.50062e+06 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
41 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.465102,30428,1,0,32258,5547,6123,44597,756,11339,46009
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Parking-PT-432-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Parking-PT-432-02 finished in 28085 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F((p0||G(p1))) U X((!p1 U (p2||G(!p1)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 425/425 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 460 transition count 424
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 460 transition count 424
Applied a total of 2 rules in 33 ms. Remains 460 /461 variables (removed 1) and now considering 424/425 (removed 1) transitions.
// Phase 1: matrix 424 rows 460 cols
[2021-05-14 08:26:30] [INFO ] Computed 88 place invariants in 2 ms
[2021-05-14 08:26:31] [INFO ] Implicit Places using invariants in 186 ms returned [129, 215, 239]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 188 ms to find 3 implicit places.
// Phase 1: matrix 424 rows 457 cols
[2021-05-14 08:26:31] [INFO ] Computed 85 place invariants in 1 ms
[2021-05-14 08:26:31] [INFO ] Dead Transitions using invariants and state equation in 215 ms returned []
Starting structural reductions, iteration 1 : 457/461 places, 424/425 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 455 transition count 422
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 455 transition count 422
Applied a total of 4 rules in 11 ms. Remains 455 /457 variables (removed 2) and now considering 422/424 (removed 2) transitions.
// Phase 1: matrix 422 rows 455 cols
[2021-05-14 08:26:31] [INFO ] Computed 85 place invariants in 2 ms
[2021-05-14 08:26:31] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 422 rows 455 cols
[2021-05-14 08:26:31] [INFO ] Computed 85 place invariants in 2 ms
[2021-05-14 08:26:31] [INFO ] State equation strengthened by 108 read => feed constraints.
[2021-05-14 08:26:32] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 455/461 places, 422/425 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-432-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s375 1) (EQ s422 1)), p1:(AND (EQ s415 1) (EQ s451 1)), p2:(AND (OR (NEQ s415 1) (NEQ s451 1)) (OR (NEQ s95 1) (NEQ s131 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 40100 reset in 1010 ms.
Product exploration explored 100000 steps with 39985 reset in 1039 ms.
Knowledge obtained : [(NOT p0), (NOT p1), p2]
Stuttering acceptance computed with spot in 131 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 40050 reset in 1022 ms.
Product exploration explored 100000 steps with 39952 reset in 1036 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 110 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, (AND (NOT p0) (NOT p1))]
Support contains 6 out of 455 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 455/455 places, 422/422 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 455 transition count 422
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 15 place count 455 transition count 422
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 31 place count 455 transition count 422
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 46 place count 440 transition count 407
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 61 place count 440 transition count 407
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 83 place count 440 transition count 423
Deduced a syphon composed of 38 places in 0 ms
Applied a total of 83 rules in 35 ms. Remains 440 /455 variables (removed 15) and now considering 423/422 (removed -1) transitions.
[2021-05-14 08:26:36] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 423 rows 440 cols
[2021-05-14 08:26:36] [INFO ] Computed 85 place invariants in 2 ms
[2021-05-14 08:26:37] [INFO ] Dead Transitions using invariants and state equation in 205 ms returned []
Finished structural reductions, in 1 iterations. Remains : 440/455 places, 423/422 transitions.
Product exploration explored 100000 steps with 39952 reset in 2106 ms.
Product exploration explored 100000 steps with 40003 reset in 2141 ms.
[2021-05-14 08:26:41] [INFO ] Flatten gal took : 14 ms
[2021-05-14 08:26:41] [INFO ] Flatten gal took : 14 ms
[2021-05-14 08:26:41] [INFO ] Time to serialize gal into /tmp/LTL15144108923276362572.gal : 2 ms
[2021-05-14 08:26:41] [INFO ] Time to serialize properties into /tmp/LTL10544474345693303906.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15144108923276362572.gal, -t, CGAL, -LTL, /tmp/LTL10544474345693303906.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15144108923276362572.gal -t CGAL -LTL /tmp/LTL10544474345693303906.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F((G("((p483==1)&&(p524==1))"))||("((p432==1)&&(p492==1))")))U(X(("((p483!=1)||(p524!=1))")U((G("((p483!=1)||(p524!=1))"))||("(((p483!=1)||(p524!=1))&&((p107!=1)||(p150!=1)))")))))))
Formula 0 simplified : !G(F("((p432==1)&&(p492==1))" | G"((p483==1)&&(p524==1))") U X("((p483!=1)||(p524!=1))" U ("(((p483!=1)||(p524!=1))&&((p107!=1)||(p150!=1)))" | G"((p483!=1)||(p524!=1))")))
Detected timeout of ITS tools.
[2021-05-14 08:26:56] [INFO ] Flatten gal took : 19 ms
[2021-05-14 08:26:56] [INFO ] Applying decomposition
[2021-05-14 08:26:56] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11293831389073497394.txt, -o, /tmp/graph11293831389073497394.bin, -w, /tmp/graph11293831389073497394.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11293831389073497394.bin, -l, -1, -v, -w, /tmp/graph11293831389073497394.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 08:26:56] [INFO ] Decomposing Gal with order
[2021-05-14 08:26:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 08:26:56] [INFO ] Removed a total of 58 redundant transitions.
[2021-05-14 08:26:56] [INFO ] Flatten gal took : 26 ms
[2021-05-14 08:26:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-14 08:26:56] [INFO ] Time to serialize gal into /tmp/LTL8908431314729172999.gal : 4 ms
[2021-05-14 08:26:56] [INFO ] Time to serialize properties into /tmp/LTL5337649283737675260.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8908431314729172999.gal, -t, CGAL, -LTL, /tmp/LTL5337649283737675260.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8908431314729172999.gal -t CGAL -LTL /tmp/LTL5337649283737675260.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((F((G("((i15.u140.p483==1)&&(i15.u153.p524==1))"))||("((i14.u131.p432==1)&&(i14.u133.p492==1))")))U(X(("((i15.u140.p483!=1)||(i15.u153.p524!=1))")U((G("((i15.u140.p483!=1)||(i15.u153.p524!=1))"))||("(((i15.u140.p483!=1)||(i15.u153.p524!=1))&&((i4.u34.p107!=1)||(i4.u46.p150!=1)))")))))))
Formula 0 simplified : !G(F("((i14.u131.p432==1)&&(i14.u133.p492==1))" | G"((i15.u140.p483==1)&&(i15.u153.p524==1))") U X("((i15.u140.p483!=1)||(i15.u153.p524!=1))" U ("(((i15.u140.p483!=1)||(i15.u153.p524!=1))&&((i4.u34.p107!=1)||(i4.u46.p150!=1)))" | G"((i15.u140.p483!=1)||(i15.u153.p524!=1))")))
Reverse transition relation is NOT exact ! Due to transitions i4.u46.t104, i6.u82.t70, i9.i0.i2.u116.t36, i15.u154.t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/418/4/422
Computing Next relation with stutter on 1.50062e+06 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
144 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.50191,71048,1,0,113617,6328,6711,266791,904,19002,137546
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-432-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Parking-PT-432-03 finished in 27514 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0&&(p0 U (p1 U X(p2)))))||X(G(p3))))], workingDir=/home/mcc/execution]
Support contains 5 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 425/425 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 459 transition count 423
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 459 transition count 423
Applied a total of 4 rules in 9 ms. Remains 459 /461 variables (removed 2) and now considering 423/425 (removed 2) transitions.
// Phase 1: matrix 423 rows 459 cols
[2021-05-14 08:26:58] [INFO ] Computed 88 place invariants in 2 ms
[2021-05-14 08:26:58] [INFO ] Implicit Places using invariants in 164 ms returned [129, 239, 455]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 166 ms to find 3 implicit places.
// Phase 1: matrix 423 rows 456 cols
[2021-05-14 08:26:58] [INFO ] Computed 85 place invariants in 2 ms
[2021-05-14 08:26:58] [INFO ] Dead Transitions using invariants and state equation in 194 ms returned []
Starting structural reductions, iteration 1 : 456/461 places, 423/425 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 455 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 455 transition count 422
Applied a total of 2 rules in 15 ms. Remains 455 /456 variables (removed 1) and now considering 422/423 (removed 1) transitions.
// Phase 1: matrix 422 rows 455 cols
[2021-05-14 08:26:58] [INFO ] Computed 85 place invariants in 2 ms
[2021-05-14 08:26:59] [INFO ] Implicit Places using invariants in 182 ms returned []
// Phase 1: matrix 422 rows 455 cols
[2021-05-14 08:26:59] [INFO ] Computed 85 place invariants in 2 ms
[2021-05-14 08:26:59] [INFO ] State equation strengthened by 108 read => feed constraints.
[2021-05-14 08:26:59] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 455/461 places, 422/425 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p2) (NOT p0)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p2)]
Running random walk in product with property : Parking-PT-432-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND p0 (NOT p2) p3) (AND p1 (NOT p2) p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={} source=2 dest: 4}, { cond=(OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p3), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 5}]], initial=1, aps=[p0:(EQ s133 1), p2:(AND (EQ s214 1) (EQ s237 1)), p3:(EQ s288 1), p1:(EQ s425 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 168 steps with 16 reset in 1 ms.
FORMULA Parking-PT-432-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-04 finished in 1405 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 425/425 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 459 transition count 423
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 459 transition count 423
Applied a total of 4 rules in 10 ms. Remains 459 /461 variables (removed 2) and now considering 423/425 (removed 2) transitions.
// Phase 1: matrix 423 rows 459 cols
[2021-05-14 08:26:59] [INFO ] Computed 88 place invariants in 2 ms
[2021-05-14 08:27:00] [INFO ] Implicit Places using invariants in 165 ms returned [129, 215, 239, 455]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 167 ms to find 4 implicit places.
// Phase 1: matrix 423 rows 455 cols
[2021-05-14 08:27:00] [INFO ] Computed 84 place invariants in 1 ms
[2021-05-14 08:27:00] [INFO ] Dead Transitions using invariants and state equation in 209 ms returned []
Starting structural reductions, iteration 1 : 455/461 places, 423/425 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 453 transition count 421
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 453 transition count 421
Applied a total of 4 rules in 9 ms. Remains 453 /455 variables (removed 2) and now considering 421/423 (removed 2) transitions.
// Phase 1: matrix 421 rows 453 cols
[2021-05-14 08:27:00] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-14 08:27:00] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 421 rows 453 cols
[2021-05-14 08:27:00] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-14 08:27:00] [INFO ] State equation strengthened by 108 read => feed constraints.
[2021-05-14 08:27:01] [INFO ] Implicit Places using invariants and state equation in 587 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 453/461 places, 421/425 transitions.
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-432-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s256 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-05 finished in 1226 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 425/425 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 459 transition count 423
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 459 transition count 423
Applied a total of 4 rules in 10 ms. Remains 459 /461 variables (removed 2) and now considering 423/425 (removed 2) transitions.
// Phase 1: matrix 423 rows 459 cols
[2021-05-14 08:27:01] [INFO ] Computed 88 place invariants in 1 ms
[2021-05-14 08:27:01] [INFO ] Implicit Places using invariants in 188 ms returned [129, 215, 239, 455]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 208 ms to find 4 implicit places.
// Phase 1: matrix 423 rows 455 cols
[2021-05-14 08:27:01] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-14 08:27:01] [INFO ] Dead Transitions using invariants and state equation in 186 ms returned []
Starting structural reductions, iteration 1 : 455/461 places, 423/425 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 453 transition count 421
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 453 transition count 421
Applied a total of 4 rules in 9 ms. Remains 453 /455 variables (removed 2) and now considering 421/423 (removed 2) transitions.
// Phase 1: matrix 421 rows 453 cols
[2021-05-14 08:27:01] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-14 08:27:01] [INFO ] Implicit Places using invariants in 191 ms returned []
// Phase 1: matrix 421 rows 453 cols
[2021-05-14 08:27:01] [INFO ] Computed 84 place invariants in 1 ms
[2021-05-14 08:27:01] [INFO ] State equation strengthened by 108 read => feed constraints.
[2021-05-14 08:27:02] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 453/461 places, 421/425 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Parking-PT-432-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s78 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-06 finished in 1287 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G((X(G(p0))||(p1 U (p2||G(p1)))))) U (X(G((X(G(p0))||(p1 U (p2||G(p1))))))&&p3))))], workingDir=/home/mcc/execution]
Support contains 7 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 425/425 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 460 transition count 424
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 460 transition count 424
Applied a total of 2 rules in 9 ms. Remains 460 /461 variables (removed 1) and now considering 424/425 (removed 1) transitions.
// Phase 1: matrix 424 rows 460 cols
[2021-05-14 08:27:02] [INFO ] Computed 88 place invariants in 2 ms
[2021-05-14 08:27:02] [INFO ] Implicit Places using invariants in 167 ms returned [216, 240, 456]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 188 ms to find 3 implicit places.
// Phase 1: matrix 424 rows 457 cols
[2021-05-14 08:27:02] [INFO ] Computed 85 place invariants in 1 ms
[2021-05-14 08:27:02] [INFO ] Dead Transitions using invariants and state equation in 196 ms returned []
Starting structural reductions, iteration 1 : 457/461 places, 424/425 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 455 transition count 422
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 455 transition count 422
Applied a total of 4 rules in 10 ms. Remains 455 /457 variables (removed 2) and now considering 422/424 (removed 2) transitions.
// Phase 1: matrix 422 rows 455 cols
[2021-05-14 08:27:02] [INFO ] Computed 85 place invariants in 2 ms
[2021-05-14 08:27:03] [INFO ] Implicit Places using invariants in 207 ms returned []
// Phase 1: matrix 422 rows 455 cols
[2021-05-14 08:27:03] [INFO ] Computed 85 place invariants in 2 ms
[2021-05-14 08:27:03] [INFO ] State equation strengthened by 108 read => feed constraints.
[2021-05-14 08:27:03] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 846 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 455/461 places, 422/425 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), true, (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : Parking-PT-432-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(OR p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(AND (EQ s290 1) (EQ s347 1)), p2:(AND (NEQ s6 1) (OR (NEQ s88 1) (NEQ s130 1))), p1:(OR (NEQ s88 1) (NEQ s130 1)), p0:(AND (EQ s151 1) (EQ s192 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 10083 reset in 789 ms.
Product exploration explored 100000 steps with 10645 reset in 971 ms.
Knowledge obtained : [(NOT p3), p2, p1, (NOT p0)]
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), true, (AND (NOT p2) (NOT p1) p0)]
Product exploration explored 100000 steps with 10159 reset in 753 ms.
Entered a terminal (fully accepting) state of product in 29525 steps with 3016 reset in 233 ms.
FORMULA Parking-PT-432-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-08 finished in 4629 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 425/425 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 459 transition count 423
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 459 transition count 423
Applied a total of 4 rules in 9 ms. Remains 459 /461 variables (removed 2) and now considering 423/425 (removed 2) transitions.
// Phase 1: matrix 423 rows 459 cols
[2021-05-14 08:27:07] [INFO ] Computed 88 place invariants in 1 ms
[2021-05-14 08:27:07] [INFO ] Implicit Places using invariants in 184 ms returned [129, 215, 239, 455]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 185 ms to find 4 implicit places.
// Phase 1: matrix 423 rows 455 cols
[2021-05-14 08:27:07] [INFO ] Computed 84 place invariants in 1 ms
[2021-05-14 08:27:07] [INFO ] Dead Transitions using invariants and state equation in 190 ms returned []
Starting structural reductions, iteration 1 : 455/461 places, 423/425 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 453 transition count 421
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 453 transition count 421
Applied a total of 4 rules in 9 ms. Remains 453 /455 variables (removed 2) and now considering 421/423 (removed 2) transitions.
// Phase 1: matrix 421 rows 453 cols
[2021-05-14 08:27:07] [INFO ] Computed 84 place invariants in 1 ms
[2021-05-14 08:27:07] [INFO ] Implicit Places using invariants in 179 ms returned []
// Phase 1: matrix 421 rows 453 cols
[2021-05-14 08:27:07] [INFO ] Computed 84 place invariants in 7 ms
[2021-05-14 08:27:07] [INFO ] State equation strengthened by 108 read => feed constraints.
[2021-05-14 08:27:08] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 453/461 places, 421/425 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-432-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(EQ s191 1), p0:(AND (EQ s161 1) (EQ s207 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-09 finished in 1250 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((p1 U (p2||G(p1)))&&p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 425/425 transitions.
Drop transitions 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 461 transition count 409
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 445 transition count 409
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 445 transition count 393
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 429 transition count 393
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 427 transition count 391
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 427 transition count 391
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 114 place count 404 transition count 368
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 403 transition count 375
Applied a total of 116 rules in 40 ms. Remains 403 /461 variables (removed 58) and now considering 375/425 (removed 50) transitions.
// Phase 1: matrix 375 rows 403 cols
[2021-05-14 08:27:08] [INFO ] Computed 88 place invariants in 2 ms
[2021-05-14 08:27:08] [INFO ] Implicit Places using invariants in 179 ms returned [116, 188, 211, 400]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 180 ms to find 4 implicit places.
[2021-05-14 08:27:08] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 375 rows 399 cols
[2021-05-14 08:27:08] [INFO ] Computed 84 place invariants in 1 ms
[2021-05-14 08:27:08] [INFO ] Dead Transitions using invariants and state equation in 191 ms returned []
Starting structural reductions, iteration 1 : 399/461 places, 375/425 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 398 transition count 374
Applied a total of 2 rules in 20 ms. Remains 398 /399 variables (removed 1) and now considering 374/375 (removed 1) transitions.
// Phase 1: matrix 374 rows 398 cols
[2021-05-14 08:27:08] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-14 08:27:08] [INFO ] Implicit Places using invariants in 160 ms returned []
// Phase 1: matrix 374 rows 398 cols
[2021-05-14 08:27:08] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-14 08:27:09] [INFO ] State equation strengthened by 144 read => feed constraints.
[2021-05-14 08:27:09] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 398/461 places, 374/425 transitions.
Stuttering acceptance computed with spot in 32 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Parking-PT-432-10 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p2:(NEQ s223 1), p1:(OR (NEQ s92 1) (NEQ s118 1)), p0:(AND (NEQ s308 0) (OR (NEQ s92 1) (NEQ s118 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 104 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-10 finished in 1246 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 425/425 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions 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 460 transition count 408
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 444 transition count 408
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 444 transition count 392
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 428 transition count 392
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 426 transition count 390
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 426 transition count 390
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 116 place count 402 transition count 366
Applied a total of 116 rules in 28 ms. Remains 402 /461 variables (removed 59) and now considering 366/425 (removed 59) transitions.
// Phase 1: matrix 366 rows 402 cols
[2021-05-14 08:27:09] [INFO ] Computed 88 place invariants in 2 ms
[2021-05-14 08:27:09] [INFO ] Implicit Places using invariants in 189 ms returned [116, 187, 210, 399]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 190 ms to find 4 implicit places.
[2021-05-14 08:27:09] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 366 rows 398 cols
[2021-05-14 08:27:09] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-14 08:27:09] [INFO ] Dead Transitions using invariants and state equation in 182 ms returned []
Starting structural reductions, iteration 1 : 398/461 places, 366/425 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 396 transition count 364
Applied a total of 4 rules in 12 ms. Remains 396 /398 variables (removed 2) and now considering 364/366 (removed 2) transitions.
// Phase 1: matrix 364 rows 396 cols
[2021-05-14 08:27:09] [INFO ] Computed 84 place invariants in 1 ms
[2021-05-14 08:27:10] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 364 rows 396 cols
[2021-05-14 08:27:10] [INFO ] Computed 84 place invariants in 1 ms
[2021-05-14 08:27:10] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 396/461 places, 364/425 transitions.
Stuttering acceptance computed with spot in 34 ms :[true, (NOT p0)]
Running random walk in product with property : Parking-PT-432-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (NEQ s46 1) (NEQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1921 steps with 17 reset in 8 ms.
FORMULA Parking-PT-432-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-11 finished in 888 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0&&X(p1)))&&(X(p2)||F(p3))))], workingDir=/home/mcc/execution]
Support contains 5 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 425/425 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 459 transition count 423
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 459 transition count 423
Applied a total of 4 rules in 9 ms. Remains 459 /461 variables (removed 2) and now considering 423/425 (removed 2) transitions.
// Phase 1: matrix 423 rows 459 cols
[2021-05-14 08:27:10] [INFO ] Computed 88 place invariants in 1 ms
[2021-05-14 08:27:10] [INFO ] Implicit Places using invariants in 186 ms returned [129, 215, 239, 455]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 187 ms to find 4 implicit places.
// Phase 1: matrix 423 rows 455 cols
[2021-05-14 08:27:10] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-14 08:27:10] [INFO ] Dead Transitions using invariants and state equation in 204 ms returned []
Starting structural reductions, iteration 1 : 455/461 places, 423/425 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 453 transition count 421
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 453 transition count 421
Applied a total of 4 rules in 9 ms. Remains 453 /455 variables (removed 2) and now considering 421/423 (removed 2) transitions.
// Phase 1: matrix 421 rows 453 cols
[2021-05-14 08:27:10] [INFO ] Computed 84 place invariants in 1 ms
[2021-05-14 08:27:10] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 421 rows 453 cols
[2021-05-14 08:27:10] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-14 08:27:11] [INFO ] State equation strengthened by 108 read => feed constraints.
[2021-05-14 08:27:11] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 453/461 places, 421/425 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p3) (NOT p2)), (NOT p3)]
Running random walk in product with property : Parking-PT-432-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s137 0) (EQ s171 0)), p3:(AND (EQ s137 1) (EQ s171 1)), p1:(OR (NEQ s85 1) (NEQ s131 1)), p2:(AND (EQ s101 1) (EQ s131 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 105 steps with 1 reset in 1 ms.
FORMULA Parking-PT-432-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-12 finished in 1284 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(G(p0))&&(X(p1) U ((!p2&&X(p1))||X(G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 425/425 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 459 transition count 423
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 459 transition count 423
Applied a total of 4 rules in 9 ms. Remains 459 /461 variables (removed 2) and now considering 423/425 (removed 2) transitions.
// Phase 1: matrix 423 rows 459 cols
[2021-05-14 08:27:11] [INFO ] Computed 88 place invariants in 1 ms
[2021-05-14 08:27:11] [INFO ] Implicit Places using invariants in 184 ms returned [129, 215, 239, 455]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 186 ms to find 4 implicit places.
// Phase 1: matrix 423 rows 455 cols
[2021-05-14 08:27:11] [INFO ] Computed 84 place invariants in 1 ms
[2021-05-14 08:27:12] [INFO ] Dead Transitions using invariants and state equation in 212 ms returned []
Starting structural reductions, iteration 1 : 455/461 places, 423/425 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 453 transition count 421
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 453 transition count 421
Applied a total of 4 rules in 9 ms. Remains 453 /455 variables (removed 2) and now considering 421/423 (removed 2) transitions.
// Phase 1: matrix 421 rows 453 cols
[2021-05-14 08:27:12] [INFO ] Computed 84 place invariants in 1 ms
[2021-05-14 08:27:12] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 421 rows 453 cols
[2021-05-14 08:27:12] [INFO ] Computed 84 place invariants in 1 ms
[2021-05-14 08:27:12] [INFO ] State equation strengthened by 108 read => feed constraints.
[2021-05-14 08:27:12] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 453/461 places, 421/425 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : Parking-PT-432-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(NEQ s96 1), p2:(EQ s191 1), p1:(EQ s417 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-14 finished in 1327 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(p0)||(p1&&G(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 425/425 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 459 transition count 423
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 459 transition count 423
Applied a total of 4 rules in 8 ms. Remains 459 /461 variables (removed 2) and now considering 423/425 (removed 2) transitions.
// Phase 1: matrix 423 rows 459 cols
[2021-05-14 08:27:13] [INFO ] Computed 88 place invariants in 2 ms
[2021-05-14 08:27:13] [INFO ] Implicit Places using invariants in 174 ms returned [129, 215, 455]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 175 ms to find 3 implicit places.
// Phase 1: matrix 423 rows 456 cols
[2021-05-14 08:27:13] [INFO ] Computed 85 place invariants in 1 ms
[2021-05-14 08:27:13] [INFO ] Dead Transitions using invariants and state equation in 214 ms returned []
Starting structural reductions, iteration 1 : 456/461 places, 423/425 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 455 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 455 transition count 422
Applied a total of 2 rules in 8 ms. Remains 455 /456 variables (removed 1) and now considering 422/423 (removed 1) transitions.
// Phase 1: matrix 422 rows 455 cols
[2021-05-14 08:27:13] [INFO ] Computed 85 place invariants in 2 ms
[2021-05-14 08:27:13] [INFO ] Implicit Places using invariants in 182 ms returned []
// Phase 1: matrix 422 rows 455 cols
[2021-05-14 08:27:13] [INFO ] Computed 85 place invariants in 1 ms
[2021-05-14 08:27:13] [INFO ] State equation strengthened by 108 read => feed constraints.
[2021-05-14 08:27:14] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 455/461 places, 422/425 transitions.
Stuttering acceptance computed with spot in 77 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : Parking-PT-432-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (NEQ s156 0) (NEQ s234 0)) (NEQ s72 1)), p1:(EQ s72 1), p2:(OR (NEQ s236 1) (NEQ s237 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 912 reset in 471 ms.
Product exploration explored 100000 steps with 909 reset in 518 ms.
Knowledge obtained : [p0, (NOT p1), p2]
Stuttering acceptance computed with spot in 78 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Product exploration explored 100000 steps with 909 reset in 454 ms.
Product exploration explored 100000 steps with 907 reset in 498 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 100 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Support contains 5 out of 455 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 455/455 places, 422/422 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 455 transition count 422
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 455 transition count 422
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 30 place count 455 transition count 422
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 45 place count 440 transition count 407
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 60 place count 440 transition count 407
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 38 places in 1 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 83 place count 440 transition count 423
Deduced a syphon composed of 38 places in 0 ms
Applied a total of 83 rules in 41 ms. Remains 440 /455 variables (removed 15) and now considering 423/422 (removed -1) transitions.
[2021-05-14 08:27:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 423 rows 440 cols
[2021-05-14 08:27:16] [INFO ] Computed 85 place invariants in 1 ms
[2021-05-14 08:27:16] [INFO ] Dead Transitions using invariants and state equation in 263 ms returned []
Finished structural reductions, in 1 iterations. Remains : 440/455 places, 423/422 transitions.
Product exploration explored 100000 steps with 928 reset in 642 ms.
Product exploration explored 100000 steps with 914 reset in 534 ms.
[2021-05-14 08:27:18] [INFO ] Flatten gal took : 18 ms
[2021-05-14 08:27:18] [INFO ] Flatten gal took : 13 ms
[2021-05-14 08:27:18] [INFO ] Time to serialize gal into /tmp/LTL2642407396141866306.gal : 2 ms
[2021-05-14 08:27:18] [INFO ] Time to serialize properties into /tmp/LTL1329287966456703975.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2642407396141866306.gal, -t, CGAL, -LTL, /tmp/LTL1329287966456703975.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2642407396141866306.gal -t CGAL -LTL /tmp/LTL1329287966456703975.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(((p175!=0)&&(p268!=0))||(p76!=1))"))||(("(p76==1)")&&(G("((p270!=1)||(p271!=1))")))))))
Formula 0 simplified : !XG(F"(((p175!=0)&&(p268!=0))||(p76!=1))" | ("(p76==1)" & G"((p270!=1)||(p271!=1))"))
Detected timeout of ITS tools.
[2021-05-14 08:27:33] [INFO ] Flatten gal took : 12 ms
[2021-05-14 08:27:33] [INFO ] Applying decomposition
[2021-05-14 08:27:33] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph424176609100561092.txt, -o, /tmp/graph424176609100561092.bin, -w, /tmp/graph424176609100561092.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph424176609100561092.bin, -l, -1, -v, -w, /tmp/graph424176609100561092.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 08:27:33] [INFO ] Decomposing Gal with order
[2021-05-14 08:27:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 08:27:33] [INFO ] Removed a total of 58 redundant transitions.
[2021-05-14 08:27:33] [INFO ] Flatten gal took : 25 ms
[2021-05-14 08:27:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-14 08:27:33] [INFO ] Time to serialize gal into /tmp/LTL259727768085898491.gal : 3 ms
[2021-05-14 08:27:33] [INFO ] Time to serialize properties into /tmp/LTL6751870332033587077.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL259727768085898491.gal, -t, CGAL, -LTL, /tmp/LTL6751870332033587077.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL259727768085898491.gal -t CGAL -LTL /tmp/LTL6751870332033587077.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(((i6.u58.p175!=0)&&(i6.u79.p268!=0))||(i1.i0.i3.u30.p76!=1))"))||(("(i1.i0.i3.u30.p76==1)")&&(G("((i4.u80.p270!=1)||(i4.u81.p271!=1))")))))))
Formula 0 simplified : !XG(F"(((i6.u58.p175!=0)&&(i6.u79.p268!=0))||(i1.i0.i3.u30.p76!=1))" | ("(i1.i0.i3.u30.p76==1)" & G"((i4.u80.p270!=1)||(i4.u81.p271!=1))"))
Reverse transition relation is NOT exact ! Due to transitions i1.i0.i3.u45.t104, i7.u82.t70, i8.u118.t36, i14.i1.i3.u153.t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/418/4/422
Computing Next relation with stutter on 1.50062e+06 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
70 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.756535,41080,1,0,53341,10894,6874,80434,869,28727,85415
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-432-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Parking-PT-432-15 finished in 21117 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-14 08:27:34] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin1848982960207207026
[2021-05-14 08:27:34] [INFO ] Computing symmetric may disable matrix : 425 transitions.
[2021-05-14 08:27:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 08:27:34] [INFO ] Computing symmetric may enable matrix : 425 transitions.
[2021-05-14 08:27:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 08:27:34] [INFO ] Flatten gal took : 14 ms
[2021-05-14 08:27:34] [INFO ] Computing Do-Not-Accords matrix : 425 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11155350139347219291.txt, -o, /tmp/graph11155350139347219291.bin, -w, /tmp/graph11155350139347219291.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11155350139347219291.bin, -l, -1, -v, -w, /tmp/graph11155350139347219291.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 08:27:34] [INFO ] Decomposing Gal with order
[2021-05-14 08:27:34] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 08:27:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 08:27:34] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1848982960207207026
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1848982960207207026]
[2021-05-14 08:27:34] [INFO ] Removed a total of 59 redundant transitions.
[2021-05-14 08:27:34] [INFO ] Flatten gal took : 24 ms
[2021-05-14 08:27:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-14 08:27:34] [INFO ] Time to serialize gal into /tmp/LTLFireability12222825251762915781.gal : 5 ms
[2021-05-14 08:27:34] [INFO ] Time to serialize properties into /tmp/LTLFireability2658127368189976559.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability12222825251762915781.gal, -t, CGAL, -LTL, /tmp/LTLFireability2658127368189976559.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability12222825251762915781.gal -t CGAL -LTL /tmp/LTLFireability2658127368189976559.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("(i2.u86.p278==1)"))&&(F(G(!("((((i2.u124.p410==1)&&(i11.u149.p504==1))||(i10.i1.i1.u109.p360==1))&&(i10.i1.i0.u108.p352==1))"))))))
Formula 0 simplified : !(F"(i2.u86.p278==1)" & FG!"((((i2.u124.p410==1)&&(i11.u149.p504==1))||(i10.i1.i1.u109.p360==1))&&(i10.i1.i0.u108.p352==1))")
Reverse transition relation is NOT exact ! Due to transitions i6.u47.t336, i9.u85.t226, i10.i1.i1.u120.t116, i14.u157.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/421/4/425
Computing Next relation with stutter on 1.50062e+06 deadlock states
Compilation finished in 2268 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin1848982960207207026]
Link finished in 49 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, (<>((LTLAPp0==true))&&<>([]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin1848982960207207026]
4 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1313 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.1731,352676,1,0,687773,6093,6652,1.47316e+06,864,24668,541764
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-432-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1620980886605

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="itstools"
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-4028"
echo " Executing tool itstools"
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 r140-tall-162089127900437"
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 ;