fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r168-tall-165277016600369
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for PhilosophersDyn-COL-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
277.752 7459.00 17592.00 64.70 TFFFFTTFTTFTFFTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016600369.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PhilosophersDyn-COL-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016600369
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 7.9K Apr 30 07:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 30 07:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 30 07:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 07:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 31K May 10 09:34 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 PhilosophersDyn-COL-03-CTLCardinality-00
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-01
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-02
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-03
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-04
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-05
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-06
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-07
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-08
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-09
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-10
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-11
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-12
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-13
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-14
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652834740893

Running Version 202205111006
[2022-05-18 00:45:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -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]
[2022-05-18 00:45:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 00:45:42] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-18 00:45:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 00:45:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 625 ms
[2022-05-18 00:45:42] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 30 PT places and 87.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
[2022-05-18 00:45:43] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 5 ms.
[2022-05-18 00:45:43] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PhilosophersDyn-COL-03-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 1368 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 60) seen :18
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 38 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 100 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 100 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 32 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 100 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 100 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 100 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 62 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 42) seen :0
Running SMT prover for 42 properties.
// Phase 1: matrix 7 rows 8 cols
[2022-05-18 00:45:43] [INFO ] Computed 3 place invariants in 6 ms
[2022-05-18 00:45:43] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-18 00:45:43] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :37 sat :0 real:5
[2022-05-18 00:45:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 00:45:44] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :40 sat :2
[2022-05-18 00:45:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-18 00:45:44] [INFO ] After 11ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :40 sat :2
[2022-05-18 00:45:44] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :40 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-18 00:45:44] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :40 sat :2
Fused 42 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 9 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 8 cols
[2022-05-18 00:45:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-18 00:45:44] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 7/7 transitions.
Incomplete random walk after 10000 steps, including 1357 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 547 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 271 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Probably explored full state space saw : 42 states, properties seen :0
Probabilistic random walk after 118 steps, saw 42 distinct states, run finished after 10 ms. (steps per millisecond=11 ) properties seen :0
Explored full state space saw : 42 states, properties seen :0
Exhaustive walk after 118 steps, saw 42 distinct states, run finished after 1 ms. (steps per millisecond=118 ) properties seen :0
Successfully simplified 42 atomic propositions for a total of 13 simplifications.
FORMULA PhilosophersDyn-COL-03-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-18 00:45:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2022-05-18 00:45:44] [INFO ] Flatten gal took : 17 ms
[2022-05-18 00:45:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PhilosophersDyn-COL-03-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-18 00:45:44] [INFO ] Flatten gal took : 3 ms
Domain [Philosopher(3), Philosopher(3)] of place Neighbourhood breaks symmetries in sort Philosopher
[2022-05-18 00:45:44] [INFO ] Unfolded HLPN to a Petri net with 30 places and 84 transitions 564 arcs in 12 ms.
[2022-05-18 00:45:44] [INFO ] Unfolded 8 HLPN properties in 1 ms.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2022-05-18 00:45:44] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2022-05-18 00:45:44] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-18 00:45:44] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 30 transitions.
Found 30 dead transitions using SMT.
Drop transitions removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:44] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-18 00:45:44] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:44] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-18 00:45:44] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:45:44] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/30 places, 51/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/81 transitions.
Support contains 30 out of 30 places after structural reductions.
[2022-05-18 00:45:44] [INFO ] Flatten gal took : 12 ms
[2022-05-18 00:45:44] [INFO ] Flatten gal took : 11 ms
[2022-05-18 00:45:44] [INFO ] Input system was already deterministic with 51 transitions.
Incomplete random walk after 10000 steps, including 1430 resets, run finished after 474 ms. (steps per millisecond=21 ) properties (out of 38) seen :17
Incomplete Best-First random walk after 1000 steps, including 38 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 33 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 33 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 62 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 62 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:45] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 00:45:45] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-18 00:45:45] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-18 00:45:45] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :19 sat :0 real:2
[2022-05-18 00:45:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 00:45:45] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-18 00:45:45] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :21 sat :0
Fused 21 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 21 atomic propositions for a total of 8 simplifications.
[2022-05-18 00:45:45] [INFO ] Flatten gal took : 8 ms
[2022-05-18 00:45:45] [INFO ] Flatten gal took : 7 ms
[2022-05-18 00:45:45] [INFO ] Input system was already deterministic with 51 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:45] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:45:45] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:45] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:45:45] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:45] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:45:45] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:45:45] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:45] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 00:45:45] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
[2022-05-18 00:45:45] [INFO ] Flatten gal took : 6 ms
[2022-05-18 00:45:45] [INFO ] Flatten gal took : 6 ms
[2022-05-18 00:45:45] [INFO ] Input system was already deterministic with 51 transitions.
[2022-05-18 00:45:45] [INFO ] Flatten gal took : 5 ms
[2022-05-18 00:45:45] [INFO ] Flatten gal took : 5 ms
[2022-05-18 00:45:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality2549063786488220730.gal : 3 ms
[2022-05-18 00:45:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality11999583598083317979.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2549063786488220730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11999583598083317979.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,325,0.028298,5004,2,501,5,2420,6,0,180,2376,0


Converting to forward existential form...Done !
original formula: (AX(((AF((((WaitRight_0+WaitRight_1)+WaitRight_2)<=((HasRight_0+HasRight_1)+HasRight_2))) + (((((HasLeft_0+HasLeft_1)+HasLeft_2)>((WaitRi...955
=> equivalent forward existential formula: ([FwdG(((EY(Init) * !(((((((HasLeft_0+HasLeft_1)+HasLeft_2)<=((Outside_0+Outside_1)+Outside_2))&&(((((Neighbourh...1040
Reverse transition relation is NOT exact ! Due to transitions t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, Intersection with reachable at e...220
(forward)formula 0,0,0.121809,8416,1,0,103,18244,115,45,1886,12629,108
FORMULA PhilosophersDyn-COL-03-CTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:46] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:45:46] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:46] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:45:46] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:46] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:45:46] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:45:46] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:46] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:45:46] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
[2022-05-18 00:45:46] [INFO ] Flatten gal took : 5 ms
[2022-05-18 00:45:46] [INFO ] Flatten gal took : 4 ms
[2022-05-18 00:45:46] [INFO ] Input system was already deterministic with 51 transitions.
[2022-05-18 00:45:46] [INFO ] Flatten gal took : 7 ms
[2022-05-18 00:45:46] [INFO ] Flatten gal took : 5 ms
[2022-05-18 00:45:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality4844282235561735208.gal : 1 ms
[2022-05-18 00:45:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality18302187141013850949.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4844282235561735208.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18302187141013850949.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,325,0.028571,5032,2,501,5,2420,6,0,180,2376,0


Converting to forward existential form...Done !
original formula: AX((((((((Neighbourhood_0+Neighbourhood_1)+(Neighbourhood_2+Neighbourhood_3))+((Neighbourhood_4+Neighbourhood_5)+(Neighbourhood_6+Neighbo...342
=> equivalent forward existential formula: [(EY(Init) * !((((((((Neighbourhood_0+Neighbourhood_1)+(Neighbourhood_2+Neighbourhood_3))+((Neighbourhood_4+Neig...389
(forward)formula 0,0,0.034156,5468,1,0,9,2420,9,2,455,2376,2
FORMULA PhilosophersDyn-COL-03-CTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:46] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-18 00:45:46] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:46] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:45:46] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:46] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-18 00:45:46] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:45:46] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:46] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:45:46] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
[2022-05-18 00:45:46] [INFO ] Flatten gal took : 4 ms
[2022-05-18 00:45:46] [INFO ] Flatten gal took : 4 ms
[2022-05-18 00:45:46] [INFO ] Input system was already deterministic with 51 transitions.
[2022-05-18 00:45:46] [INFO ] Flatten gal took : 4 ms
[2022-05-18 00:45:46] [INFO ] Flatten gal took : 5 ms
[2022-05-18 00:45:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality16767125517673892360.gal : 1 ms
[2022-05-18 00:45:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality11377063938520122790.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16767125517673892360.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11377063938520122790.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,325,0.021382,5056,2,501,5,2420,6,0,180,2376,0


Converting to forward existential form...Done !
original formula: EX(AF((((Think_0+Think_1)+Think_2)>((Forks_0+Forks_1)+Forks_2))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((((Think_0+Think_1)+Think_2)>((Forks_0+Forks_1)+Forks_2))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, Intersection with reachable at e...220
(forward)formula 0,0,0.165037,10512,1,0,129,29509,116,61,1866,21226,149
FORMULA PhilosophersDyn-COL-03-CTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:46] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 00:45:46] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:46] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 00:45:46] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:46] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:45:46] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:45:46] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:46] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:45:46] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
[2022-05-18 00:45:46] [INFO ] Flatten gal took : 5 ms
[2022-05-18 00:45:46] [INFO ] Flatten gal took : 5 ms
[2022-05-18 00:45:46] [INFO ] Input system was already deterministic with 51 transitions.
[2022-05-18 00:45:46] [INFO ] Flatten gal took : 4 ms
[2022-05-18 00:45:46] [INFO ] Flatten gal took : 4 ms
[2022-05-18 00:45:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality13479011503515372770.gal : 1 ms
[2022-05-18 00:45:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality4510901502236826151.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13479011503515372770.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4510901502236826151.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,325,0.021631,5052,2,501,5,2420,6,0,180,2376,0


Converting to forward existential form...Done !
original formula: ((AG((((HasRight_0+HasRight_1)+HasRight_2)>((Think_0+Think_1)+Think_2))) + !(A(AX((AX((((Think_0+Think_1)+Think_2)<=((Forks_0+Forks_1)+Fo...411
=> equivalent forward existential formula: [(EY((Init * !((!(E(TRUE U !((((HasRight_0+HasRight_1)+HasRight_2)>((Think_0+Think_1)+Think_2))))) + !(!((E(!(EX...680
Reverse transition relation is NOT exact ! Due to transitions t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, Intersection with reachable at e...220
Using saturation style SCC detection
(forward)formula 0,0,0.174069,10832,1,0,130,29807,127,66,2020,23128,140
FORMULA PhilosophersDyn-COL-03-CTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 7 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:47] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:45:47] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:47] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:45:47] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:47] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:45:47] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:45:47] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2022-05-18 00:45:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:47] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 00:45:47] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
[2022-05-18 00:45:47] [INFO ] Flatten gal took : 5 ms
[2022-05-18 00:45:47] [INFO ] Flatten gal took : 4 ms
[2022-05-18 00:45:47] [INFO ] Input system was already deterministic with 51 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA PhilosophersDyn-COL-03-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:47] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 00:45:47] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:47] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:45:47] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:47] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 00:45:47] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:45:47] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:47] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-18 00:45:47] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
[2022-05-18 00:45:47] [INFO ] Flatten gal took : 4 ms
[2022-05-18 00:45:47] [INFO ] Flatten gal took : 4 ms
[2022-05-18 00:45:47] [INFO ] Input system was already deterministic with 51 transitions.
[2022-05-18 00:45:47] [INFO ] Flatten gal took : 4 ms
[2022-05-18 00:45:47] [INFO ] Flatten gal took : 4 ms
[2022-05-18 00:45:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality13128229368596599854.gal : 1 ms
[2022-05-18 00:45:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality9479477029909423508.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13128229368596599854.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9479477029909423508.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,325,0.022333,5116,2,501,5,2420,6,0,180,2376,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.022883,5116,1,0,6,2420,7,1,323,2376,1
FORMULA PhilosophersDyn-COL-03-CTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:47] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:45:47] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:47] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-18 00:45:47] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:47] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:45:47] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:45:47] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:47] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:45:47] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
[2022-05-18 00:45:47] [INFO ] Flatten gal took : 4 ms
[2022-05-18 00:45:47] [INFO ] Flatten gal took : 7 ms
[2022-05-18 00:45:47] [INFO ] Input system was already deterministic with 51 transitions.
[2022-05-18 00:45:47] [INFO ] Flatten gal took : 3 ms
[2022-05-18 00:45:47] [INFO ] Flatten gal took : 3 ms
[2022-05-18 00:45:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality12567668497201018494.gal : 1 ms
[2022-05-18 00:45:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality13016957818094432681.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12567668497201018494.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13016957818094432681.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,325,0.028389,5040,2,501,5,2420,6,0,180,2376,0


Converting to forward existential form...Done !
original formula: EX(AF(AX(FALSE)))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(EX(!(FALSE)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, Intersection with reachable at e...220
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.124694,8972,1,0,112,19863,116,54,1835,14162,124
FORMULA PhilosophersDyn-COL-03-CTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:48] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:45:48] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:48] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-18 00:45:48] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:48] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 00:45:48] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 00:45:48] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 00:45:48] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 00:45:48] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
[2022-05-18 00:45:48] [INFO ] Flatten gal took : 4 ms
[2022-05-18 00:45:48] [INFO ] Flatten gal took : 4 ms
[2022-05-18 00:45:48] [INFO ] Input system was already deterministic with 51 transitions.
[2022-05-18 00:45:48] [INFO ] Flatten gal took : 3 ms
[2022-05-18 00:45:48] [INFO ] Flatten gal took : 4 ms
[2022-05-18 00:45:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality5899866596613747162.gal : 2 ms
[2022-05-18 00:45:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality8983409144157771745.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5899866596613747162.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8983409144157771745.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,325,0.020689,4988,2,501,5,2420,6,0,180,2376,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.021246,4988,1,0,6,2420,7,1,323,2376,1
FORMULA PhilosophersDyn-COL-03-CTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

[2022-05-18 00:45:48] [INFO ] Flatten gal took : 4 ms
[2022-05-18 00:45:48] [INFO ] Flatten gal took : 4 ms
Total runtime 6108 ms.

BK_STOP 1652834748352

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination CTLCardinality -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=@none -Xss128m -Xms40m -Xmx8192m

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="PhilosophersDyn-COL-03"
export BK_EXAMINATION="CTLCardinality"
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 PhilosophersDyn-COL-03, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277016600369"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-03.tgz
mv PhilosophersDyn-COL-03 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;