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

About the Execution of ITS-Tools for BART-PT-005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
673.888 17166.00 31325.00 405.50 FFFFTTTFTTFTTFFT 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.r007-tall-162037990200601.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 BART-PT-005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990200601
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 4.2K Mar 20 13:27 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 20 13:27 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Jun 8 09:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 8 09:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Jun 8 09:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 8 09:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Jun 8 09:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 8 09:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Jun 8 09:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 8 09:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 8 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 8 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 20 13:27 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 20 13:27 instance
-rw-r--r-- 1 mcc users 6 Mar 20 13:27 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 20 13:27 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 BART-PT-005-00
FORMULA_NAME BART-PT-005-01
FORMULA_NAME BART-PT-005-02
FORMULA_NAME BART-PT-005-03
FORMULA_NAME BART-PT-005-04
FORMULA_NAME BART-PT-005-05
FORMULA_NAME BART-PT-005-06
FORMULA_NAME BART-PT-005-07
FORMULA_NAME BART-PT-005-08
FORMULA_NAME BART-PT-005-09
FORMULA_NAME BART-PT-005-10
FORMULA_NAME BART-PT-005-11
FORMULA_NAME BART-PT-005-12
FORMULA_NAME BART-PT-005-13
FORMULA_NAME BART-PT-005-14
FORMULA_NAME BART-PT-005-15

=== Now, execution of the tool begins

BK_START 1623177299193

Running Version 0
[2021-06-08 18:35:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-06-08 18:35:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-08 18:35:01] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2021-06-08 18:35:01] [INFO ] Transformed 870 places.
[2021-06-08 18:35:01] [INFO ] Transformed 1010 transitions.
[2021-06-08 18:35:01] [INFO ] Found NUPN structural information;
[2021-06-08 18:35:01] [INFO ] Parsed PT model containing 870 places and 1010 transitions in 172 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-06-08 18:35:01] [INFO ] Initial state test concluded for 3 properties.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-005-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 660 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 148 places :
Symmetric choice reduction at 0 with 148 rule applications. Total rules 148 place count 512 transition count 862
Iterating global reduction 0 with 148 rules applied. Total rules applied 296 place count 512 transition count 862
Discarding 116 places :
Symmetric choice reduction at 0 with 116 rule applications. Total rules 412 place count 396 transition count 746
Iterating global reduction 0 with 116 rules applied. Total rules applied 528 place count 396 transition count 746
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 546 place count 378 transition count 728
Iterating global reduction 0 with 18 rules applied. Total rules applied 564 place count 378 transition count 728
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 576 place count 366 transition count 716
Iterating global reduction 0 with 12 rules applied. Total rules applied 588 place count 366 transition count 716
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 599 place count 355 transition count 705
Iterating global reduction 0 with 11 rules applied. Total rules applied 610 place count 355 transition count 705
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 621 place count 344 transition count 694
Iterating global reduction 0 with 11 rules applied. Total rules applied 632 place count 344 transition count 694
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 643 place count 333 transition count 683
Iterating global reduction 0 with 11 rules applied. Total rules applied 654 place count 333 transition count 683
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 662 place count 325 transition count 675
Iterating global reduction 0 with 8 rules applied. Total rules applied 670 place count 325 transition count 675
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 675 place count 320 transition count 670
Iterating global reduction 0 with 5 rules applied. Total rules applied 680 place count 320 transition count 670
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 684 place count 316 transition count 666
Iterating global reduction 0 with 4 rules applied. Total rules applied 688 place count 316 transition count 666
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 689 place count 315 transition count 665
Iterating global reduction 0 with 1 rules applied. Total rules applied 690 place count 315 transition count 665
Applied a total of 690 rules in 156 ms. Remains 315 /660 variables (removed 345) and now considering 665/1010 (removed 345) transitions.
// Phase 1: matrix 665 rows 315 cols
[2021-06-08 18:35:01] [INFO ] Computed 5 place invariants in 29 ms
[2021-06-08 18:35:01] [INFO ] Implicit Places using invariants in 195 ms returned []
// Phase 1: matrix 665 rows 315 cols
[2021-06-08 18:35:01] [INFO ] Computed 5 place invariants in 10 ms
[2021-06-08 18:35:01] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
// Phase 1: matrix 665 rows 315 cols
[2021-06-08 18:35:01] [INFO ] Computed 5 place invariants in 10 ms
[2021-06-08 18:35:02] [INFO ] Dead Transitions using invariants and state equation in 308 ms returned []
Finished structural reductions, in 1 iterations. Remains : 315/660 places, 665/1010 transitions.
[2021-06-08 18:35:02] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-06-08 18:35:02] [INFO ] Flatten gal took : 74 ms
FORMULA BART-PT-005-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-08 18:35:02] [INFO ] Flatten gal took : 41 ms
[2021-06-08 18:35:02] [INFO ] Input system was already deterministic with 665 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 237 ms. (steps per millisecond=421 ) properties (out of 12) seen :10
Running SMT prover for 2 properties.
// Phase 1: matrix 665 rows 315 cols
[2021-06-08 18:35:02] [INFO ] Computed 5 place invariants in 7 ms
[2021-06-08 18:35:02] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-06-08 18:35:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 18:35:02] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2021-06-08 18:35:02] [INFO ] Solution in real domain found non-integer solution.
[2021-06-08 18:35:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned unsat
[2021-06-08 18:35:03] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-06-08 18:35:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 18:35:03] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2021-06-08 18:35:03] [INFO ] Solution in real domain found non-integer solution.
[2021-06-08 18:35:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
[2021-06-08 18:35:03] [INFO ] Initial state test concluded for 2 properties.
FORMULA BART-PT-005-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 315 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 315/315 places, 665/665 transitions.
Graph (trivial) has 657 edges and 315 vertex of which 308 / 315 are part of one of the 5 SCC in 3 ms
Free SCC test removed 303 places
Ensure Unique test removed 649 transitions
Reduce isomorphic transitions removed 649 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 9 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 8 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 7 transition count 11
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 7 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 7 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 6 transition count 8
Applied a total of 12 rules in 15 ms. Remains 6 /315 variables (removed 309) and now considering 8/665 (removed 657) transitions.
// Phase 1: matrix 8 rows 6 cols
[2021-06-08 18:35:03] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:35:03] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 8 rows 6 cols
[2021-06-08 18:35:03] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:35:03] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-06-08 18:35:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 6 cols
[2021-06-08 18:35:03] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:35:03] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/315 places, 8/665 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BART-PT-005-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (NEQ s2 0) (NEQ s0 1)), p1:(NEQ s1 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BART-PT-005-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-01 finished in 331 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 315 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 315/315 places, 665/665 transitions.
Graph (trivial) has 659 edges and 315 vertex of which 311 / 315 are part of one of the 5 SCC in 2 ms
Free SCC test removed 306 places
Ensure Unique test removed 654 transitions
Reduce isomorphic transitions removed 654 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 6 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 5 transition count 8
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 4 transition count 5
Applied a total of 9 rules in 6 ms. Remains 4 /315 variables (removed 311) and now considering 5/665 (removed 660) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:35:03] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:35:03] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:35:03] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:35:03] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-06-08 18:35:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:35:03] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:35:03] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/315 places, 5/665 transitions.
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Running random walk in product with property : BART-PT-005-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s1 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA BART-PT-005-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-02 finished in 103 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 315 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 315/315 places, 665/665 transitions.
Graph (trivial) has 661 edges and 315 vertex of which 305 / 315 are part of one of the 5 SCC in 3 ms
Free SCC test removed 300 places
Ensure Unique test removed 643 transitions
Reduce isomorphic transitions removed 643 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 12 transition count 19
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 11 transition count 17
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 10 transition count 15
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 13 place count 9 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 16 place count 8 transition count 11
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 19 place count 7 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 20 place count 6 transition count 9
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 22 place count 6 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 22 place count 6 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 26 place count 4 transition count 5
Applied a total of 26 rules in 12 ms. Remains 4 /315 variables (removed 311) and now considering 5/665 (removed 660) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:35:03] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:35:03] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:35:03] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:35:03] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-06-08 18:35:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-06-08 18:35:03] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:35:03] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/315 places, 5/665 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-005-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s0 0) (NEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-005-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-03 finished in 147 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 315 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 315/315 places, 665/665 transitions.
Graph (trivial) has 657 edges and 315 vertex of which 309 / 315 are part of one of the 5 SCC in 2 ms
Free SCC test removed 304 places
Ensure Unique test removed 650 transitions
Reduce isomorphic transitions removed 650 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 8 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 8 transition count 11
Applied a total of 5 rules in 14 ms. Remains 8 /315 variables (removed 307) and now considering 11/665 (removed 654) transitions.
// Phase 1: matrix 11 rows 8 cols
[2021-06-08 18:35:03] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:35:03] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2021-06-08 18:35:03] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:35:03] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-06-08 18:35:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2021-06-08 18:35:03] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:35:03] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/315 places, 11/665 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-005-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s2 1) (EQ s0 1) (EQ s3 0) (EQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA BART-PT-005-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-07 finished in 92 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((X(X(p0))&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 315 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 315/315 places, 665/665 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 296 transition count 646
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 296 transition count 646
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 51 place count 283 transition count 633
Iterating global reduction 0 with 13 rules applied. Total rules applied 64 place count 283 transition count 633
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 276 transition count 626
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 276 transition count 626
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 271 transition count 621
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 271 transition count 621
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 92 place count 267 transition count 617
Iterating global reduction 0 with 4 rules applied. Total rules applied 96 place count 267 transition count 617
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 100 place count 263 transition count 613
Iterating global reduction 0 with 4 rules applied. Total rules applied 104 place count 263 transition count 613
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 107 place count 260 transition count 610
Iterating global reduction 0 with 3 rules applied. Total rules applied 110 place count 260 transition count 610
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 112 place count 258 transition count 608
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 258 transition count 608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 115 place count 257 transition count 607
Iterating global reduction 0 with 1 rules applied. Total rules applied 116 place count 257 transition count 607
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 117 place count 256 transition count 606
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 256 transition count 606
Applied a total of 118 rules in 59 ms. Remains 256 /315 variables (removed 59) and now considering 606/665 (removed 59) transitions.
// Phase 1: matrix 606 rows 256 cols
[2021-06-08 18:35:04] [INFO ] Computed 5 place invariants in 2 ms
[2021-06-08 18:35:04] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 606 rows 256 cols
[2021-06-08 18:35:04] [INFO ] Computed 5 place invariants in 7 ms
[2021-06-08 18:35:04] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
// Phase 1: matrix 606 rows 256 cols
[2021-06-08 18:35:04] [INFO ] Computed 5 place invariants in 5 ms
[2021-06-08 18:35:04] [INFO ] Dead Transitions using invariants and state equation in 256 ms returned []
Finished structural reductions, in 1 iterations. Remains : 256/315 places, 606/665 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-PT-005-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}]], initial=0, aps=[p1:(OR (EQ s13 0) (EQ s119 1)), p0:(EQ s45 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1731 reset in 353 ms.
Stack based approach found an accepted trace after 40378 steps with 724 reset with depth 73 and stack size 73 in 107 ms.
FORMULA BART-PT-005-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-10 finished in 1383 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 315 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 315/315 places, 665/665 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 296 transition count 646
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 296 transition count 646
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 52 place count 282 transition count 632
Iterating global reduction 0 with 14 rules applied. Total rules applied 66 place count 282 transition count 632
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 73 place count 275 transition count 625
Iterating global reduction 0 with 7 rules applied. Total rules applied 80 place count 275 transition count 625
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 86 place count 269 transition count 619
Iterating global reduction 0 with 6 rules applied. Total rules applied 92 place count 269 transition count 619
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 97 place count 264 transition count 614
Iterating global reduction 0 with 5 rules applied. Total rules applied 102 place count 264 transition count 614
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 107 place count 259 transition count 609
Iterating global reduction 0 with 5 rules applied. Total rules applied 112 place count 259 transition count 609
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 116 place count 255 transition count 605
Iterating global reduction 0 with 4 rules applied. Total rules applied 120 place count 255 transition count 605
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 122 place count 253 transition count 603
Iterating global reduction 0 with 2 rules applied. Total rules applied 124 place count 253 transition count 603
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 126 place count 251 transition count 601
Iterating global reduction 0 with 2 rules applied. Total rules applied 128 place count 251 transition count 601
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 250 transition count 600
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 250 transition count 600
Applied a total of 130 rules in 101 ms. Remains 250 /315 variables (removed 65) and now considering 600/665 (removed 65) transitions.
// Phase 1: matrix 600 rows 250 cols
[2021-06-08 18:35:05] [INFO ] Computed 5 place invariants in 2 ms
[2021-06-08 18:35:05] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 600 rows 250 cols
[2021-06-08 18:35:05] [INFO ] Computed 5 place invariants in 2 ms
[2021-06-08 18:35:05] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
// Phase 1: matrix 600 rows 250 cols
[2021-06-08 18:35:05] [INFO ] Computed 5 place invariants in 3 ms
[2021-06-08 18:35:05] [INFO ] Dead Transitions using invariants and state equation in 224 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/315 places, 600/665 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-005-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s180 0) (EQ s223 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 600 ms.
Product exploration explored 100000 steps with 33333 reset in 611 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 612 ms.
Product exploration explored 100000 steps with 33333 reset in 600 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 250 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 250/250 places, 600/600 transitions.
Graph (trivial) has 596 edges and 250 vertex of which 245 / 250 are part of one of the 5 SCC in 2 ms
Free SCC test removed 240 places
Ensure Unique test removed 587 transitions
Reduce isomorphic transitions removed 587 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 7 transition count 11
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 7 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 7 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 7 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 7 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 7 transition count 8
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 7 transition count 8
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 11 place count 5 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 5 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 13 rules in 8 ms. Remains 5 /250 variables (removed 245) and now considering 6/600 (removed 594) transitions.
[2021-06-08 18:35:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 5 cols
[2021-06-08 18:35:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:35:08] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/250 places, 6/600 transitions.
Product exploration explored 100000 steps with 33333 reset in 411 ms.
Product exploration explored 100000 steps with 33333 reset in 401 ms.
[2021-06-08 18:35:09] [INFO ] Flatten gal took : 20 ms
[2021-06-08 18:35:09] [INFO ] Flatten gal took : 20 ms
[2021-06-08 18:35:09] [INFO ] Time to serialize gal into /tmp/LTL561300444569226753.gal : 29 ms
[2021-06-08 18:35:09] [INFO ] Time to serialize properties into /tmp/LTL4344664857566050595.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL561300444569226753.gal, -t, CGAL, -LTL, /tmp/LTL4344664857566050595.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL561300444569226753.gal -t CGAL -LTL /tmp/LTL4344664857566050595.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((TrainState_1_4_29==0)||(TrainState_2_2_36==1))")))))
Formula 0 simplified : !XXF"((TrainState_1_4_29==0)||(TrainState_2_2_36==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
425 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.29028,152384,1,0,7,856299,20,0,6178,86945,12
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-PT-005-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BART-PT-005-11 finished in 9234 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(X(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 315 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 315/315 places, 665/665 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 294 transition count 644
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 294 transition count 644
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 57 place count 279 transition count 629
Iterating global reduction 0 with 15 rules applied. Total rules applied 72 place count 279 transition count 629
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 80 place count 271 transition count 621
Iterating global reduction 0 with 8 rules applied. Total rules applied 88 place count 271 transition count 621
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 94 place count 265 transition count 615
Iterating global reduction 0 with 6 rules applied. Total rules applied 100 place count 265 transition count 615
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 105 place count 260 transition count 610
Iterating global reduction 0 with 5 rules applied. Total rules applied 110 place count 260 transition count 610
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 115 place count 255 transition count 605
Iterating global reduction 0 with 5 rules applied. Total rules applied 120 place count 255 transition count 605
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 124 place count 251 transition count 601
Iterating global reduction 0 with 4 rules applied. Total rules applied 128 place count 251 transition count 601
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 131 place count 248 transition count 598
Iterating global reduction 0 with 3 rules applied. Total rules applied 134 place count 248 transition count 598
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 136 place count 246 transition count 596
Iterating global reduction 0 with 2 rules applied. Total rules applied 138 place count 246 transition count 596
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 139 place count 245 transition count 595
Iterating global reduction 0 with 1 rules applied. Total rules applied 140 place count 245 transition count 595
Applied a total of 140 rules in 48 ms. Remains 245 /315 variables (removed 70) and now considering 595/665 (removed 70) transitions.
// Phase 1: matrix 595 rows 245 cols
[2021-06-08 18:35:14] [INFO ] Computed 5 place invariants in 4 ms
[2021-06-08 18:35:14] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 595 rows 245 cols
[2021-06-08 18:35:14] [INFO ] Computed 5 place invariants in 2 ms
[2021-06-08 18:35:14] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
// Phase 1: matrix 595 rows 245 cols
[2021-06-08 18:35:14] [INFO ] Computed 5 place invariants in 2 ms
[2021-06-08 18:35:15] [INFO ] Dead Transitions using invariants and state equation in 205 ms returned []
Finished structural reductions, in 1 iterations. Remains : 245/315 places, 595/665 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : BART-PT-005-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s93 0), p1:(EQ s48 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 790 steps with 0 reset in 2 ms.
FORMULA BART-PT-005-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-13 finished in 583 ms.
All properties solved without resorting to model-checking.

BK_STOP 1623177316359

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="BART-PT-005"
export BK_EXAMINATION="LTLCardinality"
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 BART-PT-005, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-tall-162037990200601"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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