fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r102-smll-162075331100079
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for FlexibleBarrier-PT-12b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
792.743 109264.00 140165.00 538.70 FTTFFTTTFFTTFTTT 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.r102-smll-162075331100079.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FlexibleBarrier-PT-12b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331100079
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 7.5K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K 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.3K Mar 28 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 11:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 11:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 19:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 536K 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 FlexibleBarrier-PT-12b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621139703407

Running Version 0
[2021-05-16 04:35:06] [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-16 04:35:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 04:35:06] [INFO ] Load time of PNML (sax parser for PT used): 331 ms
[2021-05-16 04:35:06] [INFO ] Transformed 1988 places.
[2021-05-16 04:35:06] [INFO ] Transformed 2289 transitions.
[2021-05-16 04:35:06] [INFO ] Found NUPN structural information;
[2021-05-16 04:35:06] [INFO ] Parsed PT model containing 1988 places and 2289 transitions in 420 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 115 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 16) seen :2
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :1
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :1
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :2
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2289 rows 1988 cols
[2021-05-16 04:35:07] [INFO ] Computed 14 place invariants in 98 ms
[2021-05-16 04:35:09] [INFO ] [Real]Absence check using 14 positive place invariants in 96 ms returned sat
[2021-05-16 04:35:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:35:10] [INFO ] [Real]Absence check using state equation in 1500 ms returned sat
[2021-05-16 04:35:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 04:35:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 70 ms returned sat
[2021-05-16 04:35:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 04:35:12] [INFO ] [Nat]Absence check using state equation in 1414 ms returned sat
[2021-05-16 04:35:14] [INFO ] Deduced a trap composed of 718 places in 1568 ms of which 11 ms to minimize.
[2021-05-16 04:35:16] [INFO ] Deduced a trap composed of 733 places in 1660 ms of which 4 ms to minimize.
[2021-05-16 04:35:16] [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-16 04:35:16] [INFO ] [Real]Absence check using 14 positive place invariants in 59 ms returned sat
[2021-05-16 04:35:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:35:18] [INFO ] [Real]Absence check using state equation in 1369 ms returned sat
[2021-05-16 04:35:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 04:35:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 60 ms returned sat
[2021-05-16 04:35:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 04:35:20] [INFO ] [Nat]Absence check using state equation in 1356 ms returned sat
[2021-05-16 04:35:21] [INFO ] Deduced a trap composed of 675 places in 1501 ms of which 3 ms to minimize.
[2021-05-16 04:35:23] [INFO ] Deduced a trap composed of 227 places in 1441 ms of which 4 ms to minimize.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2021-05-16 04:35:25] [INFO ] Deduced a trap composed of 14 places in 1997 ms of which 17 ms to minimize.
[2021-05-16 04:35:25] [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 1
[2021-05-16 04:35:26] [INFO ] [Real]Absence check using 14 positive place invariants in 60 ms returned unsat
[2021-05-16 04:35:26] [INFO ] [Real]Absence check using 14 positive place invariants in 62 ms returned sat
[2021-05-16 04:35:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:35:27] [INFO ] [Real]Absence check using state equation in 1173 ms returned sat
[2021-05-16 04:35:29] [INFO ] Deduced a trap composed of 737 places in 1502 ms of which 3 ms to minimize.
[2021-05-16 04:35:31] [INFO ] Deduced a trap composed of 680 places in 1466 ms of which 2 ms to minimize.
[2021-05-16 04:35:31] [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-16 04:35:31] [INFO ] [Real]Absence check using 14 positive place invariants in 59 ms returned sat
[2021-05-16 04:35:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:35:32] [INFO ] [Real]Absence check using state equation in 1235 ms returned sat
[2021-05-16 04:35:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 04:35:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 65 ms returned sat
[2021-05-16 04:35:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 04:35:34] [INFO ] [Nat]Absence check using state equation in 1279 ms returned sat
[2021-05-16 04:35:36] [INFO ] Deduced a trap composed of 700 places in 1625 ms of which 3 ms to minimize.
[2021-05-16 04:35:38] [INFO ] Deduced a trap composed of 719 places in 1542 ms of which 2 ms to minimize.
[2021-05-16 04:35:38] [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-16 04:35:38] [INFO ] [Real]Absence check using 14 positive place invariants in 60 ms returned sat
[2021-05-16 04:35:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:35:40] [INFO ] [Real]Absence check using state equation in 1583 ms returned sat
[2021-05-16 04:35:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 04:35:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 59 ms returned sat
[2021-05-16 04:35:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 04:35:42] [INFO ] [Nat]Absence check using state equation in 1342 ms returned sat
[2021-05-16 04:35:43] [INFO ] Deduced a trap composed of 72 places in 1659 ms of which 2 ms to minimize.
[2021-05-16 04:35:45] [INFO ] Deduced a trap composed of 24 places in 1586 ms of which 1 ms to minimize.
[2021-05-16 04:35:45] [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 5
[2021-05-16 04:35:46] [INFO ] [Real]Absence check using 14 positive place invariants in 58 ms returned sat
[2021-05-16 04:35:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:35:47] [INFO ] [Real]Absence check using state equation in 1453 ms returned sat
[2021-05-16 04:35:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 04:35:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 60 ms returned sat
[2021-05-16 04:35:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 04:35:49] [INFO ] [Nat]Absence check using state equation in 1353 ms returned sat
[2021-05-16 04:35:49] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 216 ms.
[2021-05-16 04:35:52] [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
[2021-05-16 04:35:53] [INFO ] [Real]Absence check using 14 positive place invariants in 60 ms returned sat
[2021-05-16 04:35:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:35:54] [INFO ] [Real]Absence check using state equation in 1209 ms returned sat
[2021-05-16 04:35:55] [INFO ] Deduced a trap composed of 169 places in 606 ms of which 2 ms to minimize.
[2021-05-16 04:35:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 778 ms
[2021-05-16 04:35:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 04:35:55] [INFO ] [Nat]Absence check using 14 positive place invariants in 62 ms returned sat
[2021-05-16 04:35:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 04:35:56] [INFO ] [Nat]Absence check using state equation in 1216 ms returned sat
[2021-05-16 04:35:57] [INFO ] Deduced a trap composed of 169 places in 644 ms of which 1 ms to minimize.
[2021-05-16 04:35:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 831 ms
[2021-05-16 04:35:57] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 165 ms.
[2021-05-16 04:36:00] [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 7
[2021-05-16 04:36:00] [INFO ] [Real]Absence check using 14 positive place invariants in 60 ms returned sat
[2021-05-16 04:36:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:36:01] [INFO ] [Real]Absence check using state equation in 1203 ms returned sat
[2021-05-16 04:36:03] [INFO ] Deduced a trap composed of 753 places in 1522 ms of which 2 ms to minimize.
[2021-05-16 04:36:05] [INFO ] Deduced a trap composed of 713 places in 1409 ms of which 2 ms to minimize.
[2021-05-16 04:36:06] [INFO ] Deduced a trap composed of 684 places in 1421 ms of which 2 ms to minimize.
[2021-05-16 04:36:06] [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 8
[2021-05-16 04:36:07] [INFO ] [Real]Absence check using 14 positive place invariants in 60 ms returned sat
[2021-05-16 04:36:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:36:08] [INFO ] [Real]Absence check using state equation in 1381 ms returned sat
[2021-05-16 04:36:10] [INFO ] Deduced a trap composed of 331 places in 1538 ms of which 2 ms to minimize.
[2021-05-16 04:36:11] [INFO ] Deduced a trap composed of 782 places in 1490 ms of which 2 ms to minimize.
[2021-05-16 04:36:11] [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 9
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Support contains 47 out of 1988 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Graph (trivial) has 1588 edges and 1988 vertex of which 62 / 1988 are part of one of the 10 SCC in 15 ms
Free SCC test removed 52 places
Drop transitions removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Drop transitions removed 341 transitions
Trivial Post-agglo rules discarded 341 transitions
Performed 341 trivial Post agglomeration. Transition count delta: 341
Iterating post reduction 0 with 341 rules applied. Total rules applied 342 place count 1936 transition count 1885
Reduce places removed 341 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 345 rules applied. Total rules applied 687 place count 1595 transition count 1881
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 691 place count 1591 transition count 1881
Performed 269 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 269 Pre rules applied. Total rules applied 691 place count 1591 transition count 1612
Deduced a syphon composed of 269 places in 4 ms
Reduce places removed 269 places and 0 transitions.
Iterating global reduction 3 with 538 rules applied. Total rules applied 1229 place count 1322 transition count 1612
Discarding 736 places :
Symmetric choice reduction at 3 with 736 rule applications. Total rules 1965 place count 586 transition count 876
Iterating global reduction 3 with 736 rules applied. Total rules applied 2701 place count 586 transition count 876
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 2701 place count 586 transition count 870
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 2713 place count 580 transition count 870
Discarding 102 places :
Symmetric choice reduction at 3 with 102 rule applications. Total rules 2815 place count 478 transition count 768
Iterating global reduction 3 with 102 rules applied. Total rules applied 2917 place count 478 transition count 768
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 3 with 97 rules applied. Total rules applied 3014 place count 478 transition count 671
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 3156 place count 407 transition count 600
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3160 place count 405 transition count 600
Free-agglomeration rule applied 133 times.
Iterating global reduction 4 with 133 rules applied. Total rules applied 3293 place count 405 transition count 467
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 4 with 133 rules applied. Total rules applied 3426 place count 272 transition count 467
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 3430 place count 268 transition count 463
Iterating global reduction 5 with 4 rules applied. Total rules applied 3434 place count 268 transition count 463
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 3438 place count 268 transition count 459
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 3447 place count 268 transition count 450
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 3450 place count 268 transition count 450
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3451 place count 267 transition count 449
Applied a total of 3451 rules in 732 ms. Remains 267 /1988 variables (removed 1721) and now considering 449/2289 (removed 1840) transitions.
Finished structural reductions, in 1 iterations. Remains : 267/1988 places, 449/2289 transitions.
[2021-05-16 04:36:12] [INFO ] Flatten gal took : 116 ms
[2021-05-16 04:36:13] [INFO ] Flatten gal took : 46 ms
[2021-05-16 04:36:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4906034832077558673.gal : 28 ms
[2021-05-16 04:36:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14277058746086164936.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/ReachabilityCardinality4906034832077558673.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14277058746086164936.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/ReachabilityCardinality4906034832077558673.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14277058746086164936.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality14277058746086164936.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :8 after 15
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :15 after 118
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :118 after 896
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :896 after 28672
Reachability property FlexibleBarrier-PT-12b-ReachabilityFireability-14 is true.
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property FlexibleBarrier-PT-12b-ReachabilityFireability-12 does not hold.
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property FlexibleBarrier-PT-12b-ReachabilityFireability-06 is true.
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property FlexibleBarrier-PT-12b-ReachabilityFireability-03 does not hold.
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :28672 after 3.21551e+06
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :3.21551e+06 after 3.21579e+06
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :3.21579e+06 after 3.22734e+06
Invariant property FlexibleBarrier-PT-12b-ReachabilityFireability-09 does not hold.
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :3.22734e+06 after 3.32294e+06
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :3.32294e+06 after 3.53248e+06
Detected timeout of ITS tools.
[2021-05-16 04:36:28] [INFO ] Flatten gal took : 40 ms
[2021-05-16 04:36:28] [INFO ] Applying decomposition
[2021-05-16 04:36:28] [INFO ] Flatten gal took : 38 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/graph11688705521276714900.txt, -o, /tmp/graph11688705521276714900.bin, -w, /tmp/graph11688705521276714900.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/graph11688705521276714900.bin, -l, -1, -v, -w, /tmp/graph11688705521276714900.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 04:36:28] [INFO ] Decomposing Gal with order
[2021-05-16 04:36:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 04:36:28] [INFO ] Removed a total of 371 redundant transitions.
[2021-05-16 04:36:28] [INFO ] Flatten gal took : 196 ms
[2021-05-16 04:36:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 20 ms.
[2021-05-16 04:36:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15781778697251025159.gal : 13 ms
[2021-05-16 04:36:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16049851917774283929.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/ReachabilityCardinality15781778697251025159.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16049851917774283929.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/ReachabilityCardinality15781778697251025159.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16049851917774283929.prop --nowitness
Loading property file /tmp/ReachabilityCardinality16049851917774283929.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 3
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :3 after 3
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :3 after 3
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :3 after 12
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :12 after 12
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :12 after 240
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :240 after 552960
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :552960 after 6.07846e+06
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :6.07846e+06 after 1.04125e+08
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1.04125e+08 after 6.62997e+08
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15557096343923281427
[2021-05-16 04:36:43] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15557096343923281427
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/ltsmin15557096343923281427]
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/ltsmin15557096343923281427] 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/ltsmin15557096343923281427] 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 22782 resets, run finished after 3793 ms. (steps per millisecond=263 ) properties (out of 4) seen :1
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2365 resets, run finished after 892 ms. (steps per millisecond=1121 ) properties (out of 3) seen :1
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2339 resets, run finished after 1107 ms. (steps per millisecond=903 ) properties (out of 2) seen :1
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
[2021-05-16 04:36:50] [INFO ] Flow matrix only has 430 transitions (discarded 19 similar events)
// Phase 1: matrix 430 rows 267 cols
[2021-05-16 04:36:50] [INFO ] Computed 14 place invariants in 16 ms
[2021-05-16 04:36:50] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2021-05-16 04:36:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:36:50] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2021-05-16 04:36:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 04:36:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2021-05-16 04:36:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 04:36:51] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2021-05-16 04:36:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 04:36:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-16 04:36:51] [INFO ] Computed and/alt/rep : 413/782/413 causal constraints (skipped 5 transitions) in 34 ms.
[2021-05-16 04:36:51] [INFO ] Added : 45 causal constraints over 9 iterations in 299 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
Incomplete Parikh walk after 9400 steps, including 209 resets, run finished after 49 ms. (steps per millisecond=191 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 13 out of 267 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 267/267 places, 449/449 transitions.
Graph (trivial) has 63 edges and 267 vertex of which 4 / 267 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 265 transition count 441
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 261 transition count 441
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 9 place count 261 transition count 437
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 257 transition count 437
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 28 place count 257 transition count 426
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 46 place count 239 transition count 408
Iterating global reduction 3 with 18 rules applied. Total rules applied 64 place count 239 transition count 408
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 67 place count 239 transition count 405
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 89 place count 228 transition count 394
Drop transitions removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 93 place count 228 transition count 390
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 102 place count 219 transition count 381
Iterating global reduction 5 with 9 rules applied. Total rules applied 111 place count 219 transition count 381
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 119 place count 219 transition count 373
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 121 place count 219 transition count 371
Free-agglomeration rule applied 31 times with reduction of 1 identical transitions.
Iterating global reduction 6 with 31 rules applied. Total rules applied 152 place count 219 transition count 339
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 59 edges and 187 vertex of which 24 / 187 are part of one of the 12 SCC in 0 ms
Free SCC test removed 12 places
Iterating post reduction 6 with 35 rules applied. Total rules applied 187 place count 175 transition count 337
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 24 rules applied. Total rules applied 211 place count 175 transition count 313
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 11 Pre rules applied. Total rules applied 211 place count 175 transition count 302
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 233 place count 164 transition count 302
Discarding 31 places :
Symmetric choice reduction at 8 with 31 rule applications. Total rules 264 place count 133 transition count 271
Iterating global reduction 8 with 31 rules applied. Total rules applied 295 place count 133 transition count 271
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 8 with 31 rules applied. Total rules applied 326 place count 133 transition count 240
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 348 place count 122 transition count 229
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 359 place count 122 transition count 218
Free-agglomeration rule applied 12 times.
Iterating global reduction 9 with 12 rules applied. Total rules applied 371 place count 122 transition count 206
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 9 with 50 rules applied. Total rules applied 421 place count 104 transition count 174
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 10 with 31 rules applied. Total rules applied 452 place count 88 transition count 159
Discarding 32 places :
Symmetric choice reduction at 11 with 32 rule applications. Total rules 484 place count 56 transition count 127
Iterating global reduction 11 with 32 rules applied. Total rules applied 516 place count 56 transition count 127
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 11 with 32 rules applied. Total rules applied 548 place count 56 transition count 95
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 12 with 7 rules applied. Total rules applied 555 place count 56 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 557 place count 55 transition count 87
Applied a total of 557 rules in 128 ms. Remains 55 /267 variables (removed 212) and now considering 87/449 (removed 362) transitions.
Finished structural reductions, in 1 iterations. Remains : 55/267 places, 87/449 transitions.
[2021-05-16 04:36:51] [INFO ] Flatten gal took : 7 ms
[2021-05-16 04:36:51] [INFO ] Flatten gal took : 6 ms
[2021-05-16 04:36:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13711689746714211743.gal : 1 ms
[2021-05-16 04:36:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3284854110414730333.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/ReachabilityCardinality13711689746714211743.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3284854110414730333.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/ReachabilityCardinality13711689746714211743.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3284854110414730333.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3284854110414730333.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 272
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :272 after 280
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :280 after 296
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :296 after 308
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :308 after 2046
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2046 after 6428
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,17440,0.111968,5528,2,278,12,10148,7,0,329,6798,0
Total reachable state count : 17440

Verifying 1 reachability properties.
Reachability property FlexibleBarrier-PT-12b-ReachabilityFireability-11 is true.
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FlexibleBarrier-PT-12b-ReachabilityFireability-11,20,0.114574,5528,2,83,12,10148,7,0,349,6798,0
All properties solved without resorting to model-checking.

BK_STOP 1621139812671

--------------------
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="FlexibleBarrier-PT-12b"
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 FlexibleBarrier-PT-12b, 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 r102-smll-162075331100079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-12b.tgz
mv FlexibleBarrier-PT-12b 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 ;