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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3872.264 120273.00 152411.00 543.70 FTTTFFTTFTFTTFTF 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.r140-tall-162089127900455.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Parking-PT-864, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127900455
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 112K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 06:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 08:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 08:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 427K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Parking-PT-864-ReachabilityFireability-00
FORMULA_NAME Parking-PT-864-ReachabilityFireability-01
FORMULA_NAME Parking-PT-864-ReachabilityFireability-02
FORMULA_NAME Parking-PT-864-ReachabilityFireability-03
FORMULA_NAME Parking-PT-864-ReachabilityFireability-04
FORMULA_NAME Parking-PT-864-ReachabilityFireability-05
FORMULA_NAME Parking-PT-864-ReachabilityFireability-06
FORMULA_NAME Parking-PT-864-ReachabilityFireability-07
FORMULA_NAME Parking-PT-864-ReachabilityFireability-08
FORMULA_NAME Parking-PT-864-ReachabilityFireability-09
FORMULA_NAME Parking-PT-864-ReachabilityFireability-10
FORMULA_NAME Parking-PT-864-ReachabilityFireability-11
FORMULA_NAME Parking-PT-864-ReachabilityFireability-12
FORMULA_NAME Parking-PT-864-ReachabilityFireability-13
FORMULA_NAME Parking-PT-864-ReachabilityFireability-14
FORMULA_NAME Parking-PT-864-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620984702957

Running Version 0
[2021-05-14 09:31:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 09:31:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 09:31:44] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2021-05-14 09:31:44] [INFO ] Transformed 1185 places.
[2021-05-14 09:31:44] [INFO ] Transformed 1697 transitions.
[2021-05-14 09:31:44] [INFO ] Found NUPN structural information;
[2021-05-14 09:31:44] [INFO ] Parsed PT model containing 1185 places and 1697 transitions in 174 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
Incomplete random walk after 10000 steps, including 38 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 16) seen :9
FORMULA Parking-PT-864-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1009 rows 1185 cols
[2021-05-14 09:31:45] [INFO ] Computed 280 place invariants in 47 ms
[2021-05-14 09:31:45] [INFO ] [Real]Absence check using 272 positive place invariants in 69 ms returned sat
[2021-05-14 09:31:45] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-14 09:31:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 09:31:46] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2021-05-14 09:31:46] [INFO ] State equation strengthened by 248 read => feed constraints.
[2021-05-14 09:31:46] [INFO ] [Real]Added 248 Read/Feed constraints in 36 ms returned sat
[2021-05-14 09:31:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 09:31:46] [INFO ] [Nat]Absence check using 272 positive place invariants in 78 ms returned sat
[2021-05-14 09:31:46] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 8 ms returned sat
[2021-05-14 09:31:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 09:31:47] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2021-05-14 09:31:47] [INFO ] [Nat]Added 248 Read/Feed constraints in 27 ms returned sat
[2021-05-14 09:31:47] [INFO ] Computed and/alt/rep : 864/2496/864 causal constraints (skipped 144 transitions) in 69 ms.
[2021-05-14 09:31:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-14 09:31:51] [INFO ] [Real]Absence check using 272 positive place invariants in 63 ms returned sat
[2021-05-14 09:31:51] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-14 09:31:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 09:31:52] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2021-05-14 09:31:52] [INFO ] [Real]Added 248 Read/Feed constraints in 28 ms returned sat
[2021-05-14 09:31:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 09:31:52] [INFO ] [Nat]Absence check using 272 positive place invariants in 74 ms returned sat
[2021-05-14 09:31:52] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-14 09:31:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 09:31:52] [INFO ] [Nat]Absence check using state equation in 407 ms returned sat
[2021-05-14 09:31:53] [INFO ] [Nat]Added 248 Read/Feed constraints in 44 ms returned sat
[2021-05-14 09:31:53] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 4 ms to minimize.
[2021-05-14 09:31:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2021-05-14 09:31:53] [INFO ] Computed and/alt/rep : 864/2496/864 causal constraints (skipped 144 transitions) in 61 ms.
[2021-05-14 09:31:57] [INFO ] Added : 315 causal constraints over 63 iterations in 4134 ms. Result :unknown
[2021-05-14 09:31:57] [INFO ] [Real]Absence check using 272 positive place invariants in 52 ms returned sat
[2021-05-14 09:31:57] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 09:31:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 09:31:57] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2021-05-14 09:31:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 09:31:58] [INFO ] [Nat]Absence check using 272 positive place invariants in 54 ms returned sat
[2021-05-14 09:31:58] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 09:31:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 09:31:58] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2021-05-14 09:31:58] [INFO ] [Nat]Added 248 Read/Feed constraints in 27 ms returned sat
[2021-05-14 09:31:58] [INFO ] Computed and/alt/rep : 864/2496/864 causal constraints (skipped 144 transitions) in 58 ms.
[2021-05-14 09:32:02] [INFO ] Added : 400 causal constraints over 80 iterations in 4401 ms. Result :unknown
[2021-05-14 09:32:03] [INFO ] [Real]Absence check using 272 positive place invariants in 60 ms returned sat
[2021-05-14 09:32:03] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 09:32:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 09:32:03] [INFO ] [Real]Absence check using state equation in 346 ms returned sat
[2021-05-14 09:32:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 09:32:03] [INFO ] [Nat]Absence check using 272 positive place invariants in 65 ms returned sat
[2021-05-14 09:32:03] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 09:32:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 09:32:04] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2021-05-14 09:32:04] [INFO ] [Nat]Added 248 Read/Feed constraints in 39 ms returned sat
[2021-05-14 09:32:04] [INFO ] Deduced a trap composed of 68 places in 32 ms of which 1 ms to minimize.
[2021-05-14 09:32:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2021-05-14 09:32:04] [INFO ] Computed and/alt/rep : 864/2496/864 causal constraints (skipped 144 transitions) in 78 ms.
[2021-05-14 09:32:09] [INFO ] Deduced a trap composed of 3 places in 475 ms of which 2 ms to minimize.
[2021-05-14 09:32:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-14 09:32:09] [INFO ] [Real]Absence check using 272 positive place invariants in 61 ms returned sat
[2021-05-14 09:32:09] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 09:32:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 09:32:09] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2021-05-14 09:32:09] [INFO ] [Real]Added 248 Read/Feed constraints in 35 ms returned sat
[2021-05-14 09:32:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 09:32:09] [INFO ] [Nat]Absence check using 272 positive place invariants in 63 ms returned sat
[2021-05-14 09:32:09] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 09:32:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 09:32:10] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2021-05-14 09:32:10] [INFO ] [Nat]Added 248 Read/Feed constraints in 35 ms returned sat
[2021-05-14 09:32:10] [INFO ] Deduced a trap composed of 68 places in 39 ms of which 1 ms to minimize.
[2021-05-14 09:32:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2021-05-14 09:32:10] [INFO ] Computed and/alt/rep : 864/2496/864 causal constraints (skipped 144 transitions) in 52 ms.
[2021-05-14 09:32:15] [INFO ] Deduced a trap composed of 3 places in 484 ms of which 1 ms to minimize.
[2021-05-14 09:32:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2021-05-14 09:32:15] [INFO ] [Real]Absence check using 272 positive place invariants in 45 ms returned unsat
[2021-05-14 09:32:15] [INFO ] [Real]Absence check using 272 positive place invariants in 56 ms returned sat
[2021-05-14 09:32:15] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 09:32:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 09:32:15] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2021-05-14 09:32:16] [INFO ] [Real]Added 248 Read/Feed constraints in 29 ms returned sat
[2021-05-14 09:32:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 09:32:16] [INFO ] [Nat]Absence check using 272 positive place invariants in 66 ms returned sat
[2021-05-14 09:32:16] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 09:32:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 09:32:16] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2021-05-14 09:32:16] [INFO ] [Nat]Added 248 Read/Feed constraints in 38 ms returned sat
[2021-05-14 09:32:16] [INFO ] Computed and/alt/rep : 864/2496/864 causal constraints (skipped 144 transitions) in 60 ms.
[2021-05-14 09:32:21] [INFO ] Deduced a trap composed of 3 places in 480 ms of which 1 ms to minimize.
[2021-05-14 09:32:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
FORMULA Parking-PT-864-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 3 different solutions.
Incomplete Parikh walk after 110800 steps, including 334 resets, run finished after 1786 ms. (steps per millisecond=62 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 89900 steps, including 277 resets, run finished after 1405 ms. (steps per millisecond=63 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 37 out of 1185 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1185 transition count 983
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 1159 transition count 982
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 1158 transition count 982
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 54 place count 1158 transition count 955
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 108 place count 1131 transition count 955
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 115 place count 1124 transition count 948
Iterating global reduction 3 with 7 rules applied. Total rules applied 122 place count 1124 transition count 948
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 192 place count 1089 transition count 913
Free-agglomeration rule applied 181 times.
Iterating global reduction 3 with 181 rules applied. Total rules applied 373 place count 1089 transition count 732
Reduce places removed 181 places and 0 transitions.
Iterating post reduction 3 with 181 rules applied. Total rules applied 554 place count 908 transition count 732
Applied a total of 554 rules in 454 ms. Remains 908 /1185 variables (removed 277) and now considering 732/1009 (removed 277) transitions.
Finished structural reductions, in 1 iterations. Remains : 908/1185 places, 732/1009 transitions.
[2021-05-14 09:32:25] [INFO ] Flatten gal took : 132 ms
[2021-05-14 09:32:25] [INFO ] Flatten gal took : 68 ms
[2021-05-14 09:32:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality319965850993838923.gal : 23 ms
[2021-05-14 09:32:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14867369418686050403.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality319965850993838923.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14867369418686050403.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/ReachabilityCardinality319965850993838923.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14867369418686050403.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality14867369418686050403.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :5 after 20
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :20 after 30
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :30 after 40
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :40 after 69
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :69 after 97
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :97 after 153
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :153 after 1781
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :1781 after 3317
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :3317 after 6984
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :6984 after 12129
Detected timeout of ITS tools.
[2021-05-14 09:32:40] [INFO ] Flatten gal took : 60 ms
[2021-05-14 09:32:40] [INFO ] Applying decomposition
[2021-05-14 09:32:40] [INFO ] Flatten gal took : 62 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/graph12266792286271979580.txt, -o, /tmp/graph12266792286271979580.bin, -w, /tmp/graph12266792286271979580.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/graph12266792286271979580.bin, -l, -1, -v, -w, /tmp/graph12266792286271979580.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 09:32:40] [INFO ] Decomposing Gal with order
[2021-05-14 09:32:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 09:32:41] [INFO ] Removed a total of 105 redundant transitions.
[2021-05-14 09:32:41] [INFO ] Flatten gal took : 104 ms
[2021-05-14 09:32:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 36 ms.
[2021-05-14 09:32:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7568349241879980287.gal : 20 ms
[2021-05-14 09:32:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5436204681390438015.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality7568349241879980287.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5436204681390438015.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/ReachabilityCardinality7568349241879980287.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5436204681390438015.prop --nowitness
Loading property file /tmp/ReachabilityCardinality5436204681390438015.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 7
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :7 after 157
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :157 after 577
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :577 after 625
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :625 after 4.55347e+07
Reachability property Parking-PT-864-ReachabilityFireability-12 is true.
FORMULA Parking-PT-864-ReachabilityFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property Parking-PT-864-ReachabilityFireability-06 is true.
FORMULA Parking-PT-864-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property Parking-PT-864-ReachabilityFireability-05 does not hold.
FORMULA Parking-PT-864-ReachabilityFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property Parking-PT-864-ReachabilityFireability-04 does not hold.
FORMULA Parking-PT-864-ReachabilityFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property Parking-PT-864-ReachabilityFireability-02 is true.
FORMULA Parking-PT-864-ReachabilityFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4.55347e+07 after 6.60171e+18
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :6.60171e+18 after 7.99473e+18
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,9.69059e+18,14.7561,258852,7237,284,299934,12211,2028,2.08497e+06,200,62519,0
Total reachable state count : 9690585747161088001

Verifying 6 reachability properties.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15413210062955640212
[2021-05-14 09:32:56] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15413210062955640212
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/ltsmin15413210062955640212]
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/ltsmin15413210062955640212] 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/ltsmin15413210062955640212] 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)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5892 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3284 ms. (steps per millisecond=304 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2111756 steps, run timeout after 30001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 2111756 steps, saw 1398728 distinct states, run finished after 30004 ms. (steps per millisecond=70 ) properties seen :{}
Running SMT prover for 1 properties.
// Phase 1: matrix 732 rows 908 cols
[2021-05-14 09:33:36] [INFO ] Computed 280 place invariants in 14 ms
[2021-05-14 09:33:36] [INFO ] [Real]Absence check using 272 positive place invariants in 54 ms returned sat
[2021-05-14 09:33:36] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 09:33:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 09:33:37] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2021-05-14 09:33:37] [INFO ] State equation strengthened by 512 read => feed constraints.
[2021-05-14 09:33:37] [INFO ] [Real]Added 512 Read/Feed constraints in 37 ms returned sat
[2021-05-14 09:33:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 09:33:37] [INFO ] [Nat]Absence check using 272 positive place invariants in 55 ms returned sat
[2021-05-14 09:33:37] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 09:33:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 09:33:37] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2021-05-14 09:33:37] [INFO ] [Nat]Added 512 Read/Feed constraints in 42 ms returned sat
[2021-05-14 09:33:37] [INFO ] Computed and/alt/rep : 585/1386/585 causal constraints (skipped 146 transitions) in 45 ms.
[2021-05-14 09:33:42] [INFO ] Deduced a trap composed of 71 places in 41 ms of which 1 ms to minimize.
[2021-05-14 09:33:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2021-05-14 09:33:42] [INFO ] Added : 502 causal constraints over 102 iterations in 4589 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
Finished Parikh walk after 938 steps, including 2 resets, run visited all 1 properties in 22 ms. (steps per millisecond=42 )
FORMULA Parking-PT-864-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620984823230

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Parking-PT-864, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089127900455"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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