fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r111-csrt-158961257800548
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for Parking-PT-832

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.450 3600000.00 3603492.00 33832.60 T?????????????F? normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961257800548.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 Parking-PT-832, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961257800548
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 3.6K Apr 12 00:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 00:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 10 23:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 10 23:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Apr 10 07:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 10 07:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 9 12:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 9 12:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 251K Mar 24 05:37 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-832-CTLFireability-00
FORMULA_NAME Parking-PT-832-CTLFireability-01
FORMULA_NAME Parking-PT-832-CTLFireability-02
FORMULA_NAME Parking-PT-832-CTLFireability-03
FORMULA_NAME Parking-PT-832-CTLFireability-04
FORMULA_NAME Parking-PT-832-CTLFireability-05
FORMULA_NAME Parking-PT-832-CTLFireability-06
FORMULA_NAME Parking-PT-832-CTLFireability-07
FORMULA_NAME Parking-PT-832-CTLFireability-08
FORMULA_NAME Parking-PT-832-CTLFireability-09
FORMULA_NAME Parking-PT-832-CTLFireability-10
FORMULA_NAME Parking-PT-832-CTLFireability-11
FORMULA_NAME Parking-PT-832-CTLFireability-12
FORMULA_NAME Parking-PT-832-CTLFireability-13
FORMULA_NAME Parking-PT-832-CTLFireability-14
FORMULA_NAME Parking-PT-832-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590000770930

[2020-05-20 18:52:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-20 18:52:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 18:52:54] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2020-05-20 18:52:54] [INFO ] Transformed 737 places.
[2020-05-20 18:52:54] [INFO ] Transformed 993 transitions.
[2020-05-20 18:52:54] [INFO ] Found NUPN structural information;
[2020-05-20 18:52:54] [INFO ] Parsed PT model containing 737 places and 993 transitions in 252 ms.
Ensure Unique test removed 384 transitions
Reduce redundant transitions removed 384 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 80 ms.
Incomplete random walk after 100000 steps, including 499 resets, run finished after 869 ms. (steps per millisecond=115 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1]
// Phase 1: matrix 609 rows 737 cols
[2020-05-20 18:52:55] [INFO ] Computed 184 place invariants in 35 ms
[2020-05-20 18:52:56] [INFO ] [Real]Absence check using 176 positive place invariants in 198 ms returned sat
[2020-05-20 18:52:56] [INFO ] [Real]Absence check using 176 positive and 8 generalized place invariants in 17 ms returned sat
[2020-05-20 18:52:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:57] [INFO ] [Real]Absence check using state equation in 1303 ms returned sat
[2020-05-20 18:52:57] [INFO ] State equation strengthened by 152 read => feed constraints.
[2020-05-20 18:52:57] [INFO ] [Real]Added 152 Read/Feed constraints in 103 ms returned sat
[2020-05-20 18:52:57] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 101 ms.
[2020-05-20 18:52:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:52:59] [INFO ] [Nat]Absence check using 176 positive place invariants in 520 ms returned sat
[2020-05-20 18:52:59] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 29 ms returned sat
[2020-05-20 18:52:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:53:00] [INFO ] [Nat]Absence check using state equation in 1560 ms returned sat
[2020-05-20 18:53:00] [INFO ] [Nat]Added 152 Read/Feed constraints in 30 ms returned sat
[2020-05-20 18:53:01] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 157 ms.
[2020-05-20 18:53:09] [INFO ] Added : 556 causal constraints over 112 iterations in 8975 ms. Result :sat
[2020-05-20 18:53:09] [INFO ] Deduced a trap composed of 44 places in 119 ms
[2020-05-20 18:53:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2020-05-20 18:53:10] [INFO ] [Real]Absence check using 176 positive place invariants in 155 ms returned sat
[2020-05-20 18:53:10] [INFO ] [Real]Absence check using 176 positive and 8 generalized place invariants in 6 ms returned sat
[2020-05-20 18:53:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:53:11] [INFO ] [Real]Absence check using state equation in 1354 ms returned sat
[2020-05-20 18:53:11] [INFO ] [Real]Added 152 Read/Feed constraints in 43 ms returned sat
[2020-05-20 18:53:12] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 104 ms.
[2020-05-20 18:53:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:53:12] [INFO ] [Nat]Absence check using 176 positive place invariants in 169 ms returned sat
[2020-05-20 18:53:12] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 6 ms returned sat
[2020-05-20 18:53:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:53:14] [INFO ] [Nat]Absence check using state equation in 1449 ms returned sat
[2020-05-20 18:53:14] [INFO ] [Nat]Added 152 Read/Feed constraints in 39 ms returned sat
[2020-05-20 18:53:14] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 75 ms.
[2020-05-20 18:53:22] [INFO ] Added : 547 causal constraints over 110 iterations in 8089 ms. Result :sat
[2020-05-20 18:53:22] [INFO ] Deduced a trap composed of 40 places in 177 ms
[2020-05-20 18:53:22] [INFO ] Deduced a trap composed of 44 places in 149 ms
[2020-05-20 18:53:22] [INFO ] Deduced a trap composed of 40 places in 127 ms
[2020-05-20 18:53:22] [INFO ] Deduced a trap composed of 44 places in 78 ms
[2020-05-20 18:53:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 836 ms
[2020-05-20 18:53:23] [INFO ] [Real]Absence check using 176 positive place invariants in 118 ms returned sat
[2020-05-20 18:53:23] [INFO ] [Real]Absence check using 176 positive and 8 generalized place invariants in 14 ms returned sat
[2020-05-20 18:53:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:53:24] [INFO ] [Real]Absence check using state equation in 1340 ms returned sat
[2020-05-20 18:53:24] [INFO ] [Real]Added 152 Read/Feed constraints in 41 ms returned sat
[2020-05-20 18:53:24] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 90 ms.
[2020-05-20 18:53:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:53:25] [INFO ] [Nat]Absence check using 176 positive place invariants in 130 ms returned sat
[2020-05-20 18:53:25] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 17 ms returned sat
[2020-05-20 18:53:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:53:26] [INFO ] [Nat]Absence check using state equation in 1394 ms returned sat
[2020-05-20 18:53:26] [INFO ] [Nat]Added 152 Read/Feed constraints in 28 ms returned sat
[2020-05-20 18:53:26] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 45 ms.
[2020-05-20 18:53:35] [INFO ] Added : 583 causal constraints over 117 iterations in 8315 ms. Result :sat
[2020-05-20 18:53:35] [INFO ] Deduced a trap composed of 44 places in 107 ms
[2020-05-20 18:53:35] [INFO ] Deduced a trap composed of 40 places in 72 ms
[2020-05-20 18:53:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 390 ms
[2020-05-20 18:53:36] [INFO ] [Real]Absence check using 176 positive place invariants in 436 ms returned sat
[2020-05-20 18:53:36] [INFO ] [Real]Absence check using 176 positive and 8 generalized place invariants in 20 ms returned sat
[2020-05-20 18:53:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:53:38] [INFO ] [Real]Absence check using state equation in 2099 ms returned sat
[2020-05-20 18:53:38] [INFO ] [Real]Added 152 Read/Feed constraints in 28 ms returned sat
[2020-05-20 18:53:38] [INFO ] Deduced a trap composed of 44 places in 542 ms
[2020-05-20 18:53:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 630 ms
[2020-05-20 18:53:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:53:39] [INFO ] [Nat]Absence check using 176 positive place invariants in 202 ms returned sat
[2020-05-20 18:53:39] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 65 ms returned sat
[2020-05-20 18:53:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:53:41] [INFO ] [Nat]Absence check using state equation in 2340 ms returned sat
[2020-05-20 18:53:41] [INFO ] [Nat]Added 152 Read/Feed constraints in 34 ms returned sat
[2020-05-20 18:53:42] [INFO ] Deduced a trap composed of 44 places in 806 ms
[2020-05-20 18:53:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 873 ms
[2020-05-20 18:53:42] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 26 ms.
[2020-05-20 18:53:50] [INFO ] Added : 533 causal constraints over 107 iterations in 7197 ms. Result :sat
[2020-05-20 18:53:50] [INFO ] Deduced a trap composed of 44 places in 143 ms
[2020-05-20 18:53:50] [INFO ] Deduced a trap composed of 40 places in 83 ms
[2020-05-20 18:53:50] [INFO ] Deduced a trap composed of 40 places in 52 ms
[2020-05-20 18:53:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 559 ms
[2020-05-20 18:53:50] [INFO ] [Real]Absence check using 176 positive place invariants in 117 ms returned sat
[2020-05-20 18:53:50] [INFO ] [Real]Absence check using 176 positive and 8 generalized place invariants in 14 ms returned sat
[2020-05-20 18:53:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:53:52] [INFO ] [Real]Absence check using state equation in 1408 ms returned sat
[2020-05-20 18:53:52] [INFO ] [Real]Added 152 Read/Feed constraints in 38 ms returned sat
[2020-05-20 18:53:52] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 32 ms.
[2020-05-20 18:53:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:53:52] [INFO ] [Nat]Absence check using 176 positive place invariants in 143 ms returned sat
[2020-05-20 18:53:52] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 7 ms returned sat
[2020-05-20 18:53:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:53:54] [INFO ] [Nat]Absence check using state equation in 1454 ms returned sat
[2020-05-20 18:53:54] [INFO ] [Nat]Added 152 Read/Feed constraints in 28 ms returned sat
[2020-05-20 18:53:54] [INFO ] Deduced a trap composed of 47 places in 49 ms
[2020-05-20 18:53:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2020-05-20 18:53:54] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 43 ms.
[2020-05-20 18:54:02] [INFO ] Added : 568 causal constraints over 114 iterations in 8075 ms. Result :sat
[2020-05-20 18:54:02] [INFO ] Deduced a trap composed of 47 places in 54 ms
[2020-05-20 18:54:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2020-05-20 18:54:02] [INFO ] [Real]Absence check using 176 positive place invariants in 108 ms returned sat
[2020-05-20 18:54:02] [INFO ] [Real]Absence check using 176 positive and 8 generalized place invariants in 6 ms returned sat
[2020-05-20 18:54:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:54:04] [INFO ] [Real]Absence check using state equation in 1382 ms returned sat
[2020-05-20 18:54:04] [INFO ] [Real]Added 152 Read/Feed constraints in 23 ms returned sat
[2020-05-20 18:54:04] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 36 ms.
[2020-05-20 18:54:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:54:04] [INFO ] [Nat]Absence check using 176 positive place invariants in 117 ms returned sat
[2020-05-20 18:54:04] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 15 ms returned sat
[2020-05-20 18:54:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:54:06] [INFO ] [Nat]Absence check using state equation in 1379 ms returned sat
[2020-05-20 18:54:06] [INFO ] [Nat]Added 152 Read/Feed constraints in 47 ms returned sat
[2020-05-20 18:54:06] [INFO ] Deduced a trap composed of 44 places in 46 ms
[2020-05-20 18:54:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2020-05-20 18:54:06] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 34 ms.
[2020-05-20 18:54:14] [INFO ] Added : 548 causal constraints over 110 iterations in 7932 ms. Result :sat
[2020-05-20 18:54:14] [INFO ] Deduced a trap composed of 44 places in 124 ms
[2020-05-20 18:54:14] [INFO ] Deduced a trap composed of 40 places in 38 ms
[2020-05-20 18:54:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 367 ms
[2020-05-20 18:54:14] [INFO ] [Real]Absence check using 176 positive place invariants in 119 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-20 18:54:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-20 18:54:15] [INFO ] Flatten gal took : 217 ms
[2020-05-20 18:54:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-20 18:54:15] [INFO ] Flatten gal took : 82 ms
FORMULA Parking-PT-832-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-20 18:54:15] [INFO ] Applying decomposition
[2020-05-20 18:54:15] [INFO ] Flatten gal took : 74 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph3510393879147501835.txt, -o, /tmp/graph3510393879147501835.bin, -w, /tmp/graph3510393879147501835.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph3510393879147501835.bin, -l, -1, -v, -w, /tmp/graph3510393879147501835.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-20 18:54:16] [INFO ] Decomposing Gal with order
[2020-05-20 18:54:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-20 18:54:16] [INFO ] Removed a total of 16 redundant transitions.
[2020-05-20 18:54:16] [INFO ] Flatten gal took : 343 ms
[2020-05-20 18:54:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 52 ms.
[2020-05-20 18:54:17] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 39 ms
[2020-05-20 18:54:17] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
built 49 ordering constraints for composite.
built 34 ordering constraints for composite.
built 28 ordering constraints for composite.
built 15 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 15 ordering constraints for composite.
built 8 ordering constraints for composite.
built 12 ordering constraints for composite.
built 40 ordering constraints for composite.
built 33 ordering constraints for composite.
built 16 ordering constraints for composite.
built 19 ordering constraints for composite.
built 15 ordering constraints for composite.
built 24 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 41 ordering constraints for composite.
built 20 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 14 ordering constraints for composite.
built 18 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 18 ordering constraints for composite.
built 21 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 26 ordering constraints for composite.
built 13 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 29 ordering constraints for composite.
built 19 ordering constraints for composite.
built 7 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 34 ordering constraints for composite.
built 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 20 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 17 ordering constraints for composite.
built 25 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 12 ordering constraints for composite.
built 15 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 20 ordering constraints for composite.
built 12 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 26 ordering constraints for composite.
built 19 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 40 ordering constraints for composite.
built 17 ordering constraints for composite.
built 25 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 12 ordering constraints for composite.
built 15 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
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,1.4648e+54,1.88054,49212,2233,168,85568,12542,1509,188621,135,36166,0


Converting to forward existential form...Done !
original formula: EF((i13.i0.i1.u219.p608==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i13.i0.i1.u219.p608==1))] != FALSE
(forward)formula 0,1,1.88464,49596,1,0,85568,12542,1515,188621,138,36166,33
FORMULA Parking-PT-832-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(EX(AF(((i9.i0.i1.u4.p10==1)&&(i9.i0.i1.u72.p166==1)))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(EG(!(((i9.i0.i1.u4.p10==1)&&(i9.i0.i1.u72.p166==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i1.t991, i1.t990, i1.t989, i1.t988, i1.u81.t410, i1.u81.t412, i2.t963, i2.t962, i2.t961, i2.t960, i2.u107.t352, i2.u107.t354, i4.i0.t933, i4.i0.t934, i4.i0.t935, i4.i0.i2.t932, i4.i0.i4.u133.t294, i4.i0.i4.u133.t296, i6.t907, i6.t906, i6.t905, i6.t904, i6.u157.t236, i6.u157.t238, i7.i0.t877, i7.i0.t878, i7.i0.i3.t879, i7.i0.i3.t876, i7.i0.i3.u183.t178, i7.i0.i3.u183.t180, i11.i0.t849, i11.i0.t850, i11.i0.t851, i11.i0.i3.u209.t120, i11.i0.i3.u209.t122, i11.i0.i4.t848, i13.i0.t821, i13.i0.t822, i13.i0.t823, i13.i0.i3.u235.t62, i13.i0.i3.u235.t64, i13.i0.i4.t820, i15.t795, i15.t794, i15.t793, i15.t792, i15.u260.t4, i15.u260.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/561/48/609
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
[2020-05-20 19:14:44] [INFO ] Applying decomposition
[2020-05-20 19:14:44] [INFO ] Flatten gal took : 84 ms
[2020-05-20 19:14:44] [INFO ] Decomposing Gal with order
[2020-05-20 19:14:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-20 19:14:44] [INFO ] Removed a total of 112 redundant transitions.
[2020-05-20 19:14:44] [INFO ] Flatten gal took : 169 ms
[2020-05-20 19:14:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 20 ms.
[2020-05-20 19:14:44] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 15 ms
[2020-05-20 19:14:44] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
built 313 ordering constraints for composite.
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,1.4648e+54,2.04552,58312,1475,82,114335,3385,1606,137909,136,10775,0


Converting to forward existential form...Done !
original formula: EX(EX(AF(((u5.p10==1)&&(u69.p166==1)))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(EG(!(((u5.p10==1)&&(u69.p166==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t792, t793, t794, t795, t820, t821, t822, t823, t848, t849, t850, t851, t876, t877, t878, t879, t904, t905, t906, t907, t932, t933, t934, t935, t960, t961, t962, t963, t988, t989, t990, t991, u71.t410, u71.t412, u86.t352, u86.t354, u101.t294, u101.t296, u116.t236, u116.t238, u131.t178, u131.t180, u146.t120, u146.t122, u161.t62, u161.t64, u176.t4, u176.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/545/48/593
Detected timeout of ITS tools.
[2020-05-20 19:35:13] [INFO ] Flatten gal took : 655 ms
[2020-05-20 19:35:14] [INFO ] Input system was already deterministic with 609 transitions.
[2020-05-20 19:35:14] [INFO ] Transformed 737 places.
[2020-05-20 19:35:14] [INFO ] Transformed 609 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-20 19:35:15] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 95 ms
[2020-05-20 19:35:15] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-832"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-832, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r111-csrt-158961257800548"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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