fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r299-tall-162124164600022
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for CANConstruction-PT-040

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
796.184 102618.00 122149.00 544.60 T normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r299-tall-162124164600022.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CANConstruction-PT-040, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tall-162124164600022
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.9M
-rw-r--r-- 1 mcc users 31K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 168K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K May 12 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 12 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.6K May 11 18:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 11 18:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 11 15:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 11 15:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 12 04:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 7.5M May 12 08:13 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1621320666149

Running Version 0
[2021-05-18 06:51:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -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, 1800]
[2021-05-18 06:51:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 06:51:08] [INFO ] Load time of PNML (sax parser for PT used): 350 ms
[2021-05-18 06:51:08] [INFO ] Transformed 3682 places.
[2021-05-18 06:51:08] [INFO ] Transformed 6720 transitions.
[2021-05-18 06:51:08] [INFO ] Parsed PT model containing 3682 places and 6720 transitions in 504 ms.
Starting structural reductions, iteration 0 : 3682/3682 places, 6720/6720 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3682 transition count 6440
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3402 transition count 6440
Discarding 1520 places :
Symmetric choice reduction at 2 with 1520 rule applications. Total rules 2080 place count 1882 transition count 3400
Iterating global reduction 2 with 1520 rules applied. Total rules applied 3600 place count 1882 transition count 3400
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 3680 place count 1842 transition count 3360
Applied a total of 3680 rules in 833 ms. Remains 1842 /3682 variables (removed 1840) and now considering 3360/6720 (removed 3360) transitions.
// Phase 1: matrix 3360 rows 1842 cols
[2021-05-18 06:51:09] [INFO ] Computed 81 place invariants in 65 ms
[2021-05-18 06:51:10] [INFO ] Implicit Places using invariants in 1466 ms returned [5, 11, 17, 23, 29, 35, 41, 47, 53, 59, 65, 71, 77, 83, 89, 95, 101, 107, 113, 119, 125, 131, 137, 143, 149, 155, 161, 167, 173, 179, 185, 191, 197, 203, 209, 215, 221, 227, 233, 239]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1494 ms to find 40 implicit places.
// Phase 1: matrix 3360 rows 1802 cols
[2021-05-18 06:51:10] [INFO ] Computed 41 place invariants in 31 ms
[2021-05-18 06:51:12] [INFO ] Dead Transitions using invariants and state equation in 1671 ms returned []
Starting structural reductions, iteration 1 : 1802/3682 places, 3360/6720 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 1802 transition count 3280
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 1722 transition count 3280
Applied a total of 160 rules in 96 ms. Remains 1722 /1802 variables (removed 80) and now considering 3280/3360 (removed 80) transitions.
// Phase 1: matrix 3280 rows 1722 cols
[2021-05-18 06:51:12] [INFO ] Computed 41 place invariants in 23 ms
[2021-05-18 06:51:13] [INFO ] Implicit Places using invariants in 1133 ms returned []
// Phase 1: matrix 3280 rows 1722 cols
[2021-05-18 06:51:13] [INFO ] Computed 41 place invariants in 23 ms
[2021-05-18 06:51:14] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2021-05-18 06:51:44] [INFO ] Performed 1603/1722 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2021-05-18 06:51:47] [INFO ] Implicit Places using invariants and state equation in 33666 ms returned []
Implicit Place search using SMT with State Equation took 34800 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1722/3682 places, 3280/6720 transitions.
Discarding 40 transitions out of 3280. Remains 3240
[2021-05-18 06:51:47] [INFO ] Initial state test concluded for 40 properties.
Incomplete random walk after 10000 steps, including 37 resets, run finished after 707 ms. (steps per millisecond=14 ) properties (out of 3200) seen :2888
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 312) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 312) seen :0
Running SMT prover for 312 properties.
// Phase 1: matrix 3280 rows 1722 cols
[2021-05-18 06:51:48] [INFO ] Computed 41 place invariants in 19 ms
[2021-05-18 06:51:54] [INFO ] [Real]Absence check using 41 positive place invariants in 52 ms returned sat
[2021-05-18 06:52:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 06:52:13] [INFO ] [Real]Absence check using state equation in 12155 ms returned unsat :0 sat :312 real:0
[2021-05-18 06:52:13] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2021-05-18 06:52:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
Fused 312 Parikh solutions to 153 different solutions.
Incomplete Parikh walk after 92 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=30 ) properties (out of 312) seen :15 could not realise parikh vector
Incomplete Parikh walk after 92 steps, including 1 resets, run finished after 4 ms. (steps per millisecond=23 ) properties (out of 297) seen :0 could not realise parikh vector
Incomplete Parikh walk after 92 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=30 ) properties (out of 297) seen :0 could not realise parikh vector
Incomplete Parikh walk after 92 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=30 ) properties (out of 297) seen :0 could not realise parikh vector
Incomplete Parikh walk after 92 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=30 ) properties (out of 297) seen :0 could not realise parikh vector
Incomplete Parikh walk after 92 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=30 ) properties (out of 297) seen :0 could not realise parikh vector
Incomplete Parikh walk after 92 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=30 ) properties (out of 297) seen :0 could not realise parikh vector
Incomplete Parikh walk after 92 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=30 ) properties (out of 297) seen :0 could not realise parikh vector
Incomplete Parikh walk after 92 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=30 ) properties (out of 297) seen :0 could not realise parikh vector
Incomplete Parikh walk after 91 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=30 ) properties (out of 297) seen :0 could not realise parikh vector
Incomplete Parikh walk after 91 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=30 ) properties (out of 297) seen :0 could not realise parikh vector
Incomplete Parikh walk after 91 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=30 ) properties (out of 297) seen :0 could not realise parikh vector
Incomplete Parikh walk after 89 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=29 ) properties (out of 297) seen :0 could not realise parikh vector
Incomplete Parikh walk after 89 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=29 ) properties (out of 297) seen :0 could not realise parikh vector
Incomplete Parikh walk after 89 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=29 ) properties (out of 297) seen :0 could not realise parikh vector
Incomplete Parikh walk after 89 steps, including 1 resets, run finished after 2 ms. (steps per millisecond=44 ) properties (out of 297) seen :0 could not realise parikh vector
Incomplete Parikh walk after 87 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=29 ) properties (out of 297) seen :0 could not realise parikh vector
Incomplete Parikh walk after 85 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=28 ) properties (out of 297) seen :0 could not realise parikh vector
Incomplete Parikh walk after 85 steps, including 1 resets, run finished after 2 ms. (steps per millisecond=42 ) properties (out of 297) seen :0 could not realise parikh vector
Incomplete Parikh walk after 85 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=28 ) properties (out of 297) seen :0 could not realise parikh vector
Incomplete Parikh walk after 85 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=28 ) properties (out of 297) seen :0 could not realise parikh vector
Incomplete Parikh walk after 85 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=28 ) properties (out of 297) seen :0 could not realise parikh vector
Incomplete Parikh walk after 85 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=28 ) properties (out of 297) seen :0 could not realise parikh vector
Incomplete Parikh walk after 85 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=28 ) properties (out of 297) seen :0 could not realise parikh vector
Incomplete Parikh walk after 85 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=28 ) properties (out of 297) seen :0 could not realise parikh vector
Incomplete Parikh walk after 85 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=28 ) properties (out of 297) seen :0 could not realise parikh vector
Incomplete Parikh walk after 85 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=28 ) properties (out of 297) seen :0 could not realise parikh vector
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
Support contains 332 out of 1722 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1722/1722 places, 3280/3280 transitions.
Applied a total of 0 rules in 254 ms. Remains 1722 /1722 variables (removed 0) and now considering 3280/3280 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1722/1722 places, 3280/3280 transitions.
[2021-05-18 06:52:14] [INFO ] Flatten gal took : 233 ms
[2021-05-18 06:52:14] [INFO ] Flatten gal took : 142 ms
[2021-05-18 06:52:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1931867528676642742.gal : 40 ms
[2021-05-18 06:52:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2869828531794272522.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality1931867528676642742.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2869828531794272522.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality1931867528676642742.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2869828531794272522.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2869828531794272522.prop.
SDD proceeding with computation,297 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,297 properties remain. new max is 8
SDD size :40 after 42
SDD proceeding with computation,297 properties remain. new max is 16
SDD size :42 after 44
SDD proceeding with computation,297 properties remain. new max is 32
SDD size :44 after 46
SDD proceeding with computation,297 properties remain. new max is 64
SDD size :46 after 48
SDD proceeding with computation,297 properties remain. new max is 128
SDD size :48 after 51
SDD proceeding with computation,297 properties remain. new max is 256
SDD size :51 after 56
Detected timeout of ITS tools.
[2021-05-18 06:52:29] [INFO ] Flatten gal took : 114 ms
[2021-05-18 06:52:29] [INFO ] Applying decomposition
[2021-05-18 06:52:29] [INFO ] Flatten gal took : 105 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13908112690163788379.txt, -o, /tmp/graph13908112690163788379.bin, -w, /tmp/graph13908112690163788379.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13908112690163788379.bin, -l, -1, -v, -w, /tmp/graph13908112690163788379.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 06:52:29] [INFO ] Decomposing Gal with order
[2021-05-18 06:52:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 06:52:30] [INFO ] Removed a total of 3157 redundant transitions.
[2021-05-18 06:52:30] [INFO ] Flatten gal took : 714 ms
[2021-05-18 06:52:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 3040 labels/synchronizations in 246 ms.
[2021-05-18 06:52:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16337230001002484680.gal : 21 ms
[2021-05-18 06:52:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13148436245596933787.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality16337230001002484680.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13148436245596933787.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality16337230001002484680.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13148436245596933787.prop --nowitness
Loading property file /tmp/ReachabilityCardinality13148436245596933787.prop.
SDD proceeding with computation,297 properties remain. new max is 4
SDD size :1 after 72
SDD proceeding with computation,297 properties remain. new max is 8
SDD size :72 after 76
Reachability property qltransition_1067 is true.
SDD proceeding with computation,296 properties remain. new max is 8
SDD size :76 after 98
SDD proceeding with computation,296 properties remain. new max is 16
SDD size :98 after 107
Reachability property qltransition_293 is true.
Reachability property qltransition_289 is true.
Reachability property qltransition_285 is true.
Reachability property qltransition_217 is true.
Reachability property qltransition_205 is true.
Reachability property qltransition_197 is true.
Reachability property qltransition_85 is true.
Reachability property qltransition_81 is true.
Reachability property qltransition_53 is true.
Reachability property qltransition_41 is true.
SDD proceeding with computation,286 properties remain. new max is 16
SDD size :107 after 2153
SDD proceeding with computation,286 properties remain. new max is 32
SDD size :2153 after 2422
SDD proceeding with computation,286 properties remain. new max is 64
SDD size :2422 after 34924
SDD proceeding with computation,286 properties remain. new max is 128
SDD size :34924 after 357240
Reachability property qltransition_769 is true.
Reachability property qltransition_93 is true.
SDD proceeding with computation,284 properties remain. new max is 128
SDD size :357240 after 2.55725e+11
Reachability property qltransition_531 is true.
Reachability property qltransition_529 is true.
Reachability property qltransition_105 is true.
SDD proceeding with computation,281 properties remain. new max is 128
SDD size :2.55725e+11 after 8.16906e+13
SDD proceeding with computation,281 properties remain. new max is 256
SDD size :8.16906e+13 after 8.16906e+13
Reachability property qltransition_1625 is true.
Reachability property qltransition_1621 is true.
Reachability property qltransition_1617 is true.
Reachability property qltransition_1607 is true.
Reachability property qltransition_1553 is true.
Reachability property qltransition_113 is true.
Reachability property qltransition_109 is true.
SDD proceeding with computation,274 properties remain. new max is 256
SDD size :8.16906e+13 after 2.54804e+15
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10892148448186157239
[2021-05-18 06:52:46] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10892148448186157239
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10892148448186157239]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10892148448186157239] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10892148448186157239] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Finished random walk after 32578 steps, including 118 resets, run visited all 274 properties in 451 ms. (steps per millisecond=72 )
Able to resolve query QuasiLiveness after proving 3240 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING TOPOLOGICAL INITIAL_STATE USE_NUPN

BK_STOP 1621320768767

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-040"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 CANConstruction-PT-040, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r299-tall-162124164600022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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