fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r260-csrt-152732585400176
Last Updated
June 26, 2018

About the Execution of ITS-Tools for PhaseVariation-PT-D05CS010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15756.090 366206.00 978284.00 267.70 FFFFFFFFFFFFFFFF normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..................
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.0K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 10K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 633K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is PhaseVariation-PT-D05CS010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r260-csrt-152732585400176
=====================================================================


--------------------
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 PhaseVariation-PT-D05CS010-LTLFireability-00
FORMULA_NAME PhaseVariation-PT-D05CS010-LTLFireability-01
FORMULA_NAME PhaseVariation-PT-D05CS010-LTLFireability-02
FORMULA_NAME PhaseVariation-PT-D05CS010-LTLFireability-03
FORMULA_NAME PhaseVariation-PT-D05CS010-LTLFireability-04
FORMULA_NAME PhaseVariation-PT-D05CS010-LTLFireability-05
FORMULA_NAME PhaseVariation-PT-D05CS010-LTLFireability-06
FORMULA_NAME PhaseVariation-PT-D05CS010-LTLFireability-07
FORMULA_NAME PhaseVariation-PT-D05CS010-LTLFireability-08
FORMULA_NAME PhaseVariation-PT-D05CS010-LTLFireability-09
FORMULA_NAME PhaseVariation-PT-D05CS010-LTLFireability-10
FORMULA_NAME PhaseVariation-PT-D05CS010-LTLFireability-11
FORMULA_NAME PhaseVariation-PT-D05CS010-LTLFireability-12
FORMULA_NAME PhaseVariation-PT-D05CS010-LTLFireability-13
FORMULA_NAME PhaseVariation-PT-D05CS010-LTLFireability-14
FORMULA_NAME PhaseVariation-PT-D05CS010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1527490121917

Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((F(F("(((pool__1_4_>=1)&&(cell___1_3__B_>=1))&&(run_dot>=1))"))))
Formula 0 simplified : !F"(((pool__1_4_>=1)&&(cell___1_3__B_>=1))&&(run_dot>=1))"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 51
// Phase 1: matrix 51 rows 77 cols
invariant :cell___4_4__A_ + cell___4_4__B_ + pool__4_4_ = 1
invariant :cell___1_3__A_ + cell___1_3__B_ + pool__1_3_ = 1
invariant :cell___5_4__A_ + cell___5_4__B_ + pool__5_4_ = 1
invariant :cell___3_4__A_ + cell___3_4__B_ + pool__3_4_ = 1
invariant :cell___5_1__A_ + cell___5_1__B_ + pool__5_1_ = 1
invariant :cell___1_4__A_ + cell___1_4__B_ + pool__1_4_ = 1
invariant :pool__1_1_ + pool__1_2_ + pool__1_3_ + pool__1_4_ + pool__1_5_ + pool__2_1_ + pool__2_2_ + pool__2_3_ + pool__2_4_ + pool__2_5_ + pool__3_1_ + pool__3_2_ + pool__3_3_ + pool__3_4_ + pool__3_5_ + pool__4_1_ + pool__4_2_ + pool__4_3_ + pool__4_4_ + pool__4_5_ + pool__5_1_ + pool__5_2_ + pool__5_3_ + pool__5_4_ + pool__5_5_ + size_dot = 25
invariant :cell___5_3__A_ + cell___5_3__B_ + pool__5_3_ = 1
invariant :cell___3_5__A_ + cell___3_5__B_ + pool__3_5_ = 1
invariant :cell___3_2__A_ + cell___3_2__B_ + pool__3_2_ = 1
invariant :cell___5_5__A_ + cell___5_5__B_ + pool__5_5_ = 1
invariant :cell___2_4__A_ + cell___2_4__B_ + pool__2_4_ = 1
invariant :cell___2_1__A_ + cell___2_1__B_ + pool__2_1_ = 1
invariant :cell___1_2__A_ + cell___1_2__B_ + pool__1_2_ = 1
invariant :cell___2_5__A_ + cell___2_5__B_ + pool__2_5_ = 1
invariant :cell___4_5__A_ + cell___4_5__B_ + pool__4_5_ = 1
invariant :cell___2_3__A_ + cell___2_3__B_ + pool__2_3_ = 1
invariant :cell___4_3__A_ + cell___4_3__B_ + pool__4_3_ = 1
invariant :cell___3_3__A_ + cell___3_3__B_ + pool__3_3_ = 1
invariant :cell___5_2__A_ + cell___5_2__B_ + pool__5_2_ = 1
invariant :cell___1_5__A_ + cell___1_5__B_ + pool__1_5_ = 1
invariant :cell___4_2__A_ + cell___4_2__B_ + pool__4_2_ = 1
invariant :cell___3_1__A_ + cell___3_1__B_ + pool__3_1_ = 1
invariant :cell___1_1__A_ + cell___1_1__B_ + -1'pool__1_2_ + -1'pool__1_3_ + -1'pool__1_4_ + -1'pool__1_5_ + -1'pool__2_1_ + -1'pool__2_2_ + -1'pool__2_3_ + -1'pool__2_4_ + -1'pool__2_5_ + -1'pool__3_1_ + -1'pool__3_2_ + -1'pool__3_3_ + -1'pool__3_4_ + -1'pool__3_5_ + -1'pool__4_1_ + -1'pool__4_2_ + -1'pool__4_3_ + -1'pool__4_4_ + -1'pool__4_5_ + -1'pool__5_1_ + -1'pool__5_2_ + -1'pool__5_3_ + -1'pool__5_4_ + -1'pool__5_5_ + -1'size_dot = -24
invariant :cell___2_2__A_ + cell___2_2__B_ + pool__2_2_ = 1
invariant :cell___4_1__A_ + cell___4_1__B_ + pool__4_1_ = 1
Reverse transition relation is NOT exact ! Due to transitions division2_mutate_1_3_A_1_2, division2_mutate_1_3_A_1_4, division2_mutate_1_3_A_2_2, division2_mutate_1_3_A_2_4, division2_mutate_1_3_B_1_2, division2_mutate_1_3_B_1_4, division2_mutate_1_3_B_2_4, division2_mutate_1_4_A_1_3, division2_mutate_1_4_A_1_5, division2_mutate_1_4_A_2_3, division2_mutate_1_4_A_2_5, division2_mutate_1_4_B_1_3, division2_mutate_1_4_B_1_5, division2_mutate_1_4_B_2_3, division2_mutate_1_4_B_2_5, division2_mutate_2_3_A_1_2, division2_mutate_2_3_A_1_3, division2_mutate_2_3_A_1_4, division2_mutate_2_3_A_2_2, division2_mutate_2_3_A_2_4, division2_mutate_2_3_A_3_2, division2_mutate_2_3_A_3_3, division2_mutate_2_3_A_3_4, division2_mutate_2_3_B_1_2, division2_mutate_2_3_B_1_3, division2_mutate_2_3_B_1_4, division2_mutate_2_3_B_2_4, division2_mutate_2_3_B_3_2, division2_mutate_2_3_B_3_3, division2_mutate_2_3_B_3_4, division2_mutate_2_4_A_1_3, division2_mutate_2_4_A_1_4, division2_mutate_2_4_A_1_5, division2_mutate_2_4_A_2_3, division2_mutate_2_4_A_2_5, division2_mutate_2_4_A_3_3, division2_mutate_2_4_A_3_4, division2_mutate_2_4_A_3_5, division2_mutate_2_4_B_1_3, division2_mutate_2_4_B_1_4, division2_mutate_2_4_B_1_5, division2_mutate_2_4_B_2_3, division2_mutate_2_4_B_2_5, division2_mutate_2_4_B_3_3, division2_mutate_2_4_B_3_4, division2_mutate_2_4_B_3_5, division2_mutate_2_5_A_1_4, division2_mutate_2_5_A_1_5, division2_mutate_2_5_A_3_4, division2_mutate_2_5_A_3_5, division2_mutate_2_5_B_1_4, division2_mutate_2_5_B_1_5, division2_mutate_2_5_B_3_4, division2_mutate_2_5_B_3_5, division2_mutate_3_1_A_2_1, division2_mutate_3_1_A_2_2, division2_mutate_3_1_A_4_1, division2_mutate_3_1_A_4_2, division2_mutate_3_1_B_2_1, division2_mutate_3_1_B_4_1, division2_mutate_3_1_B_4_2, division2_mutate_3_2_A_2_1, division2_mutate_3_2_A_2_2, division2_mutate_3_2_A_2_3, division2_mutate_3_2_A_3_1, division2_mutate_3_2_A_3_3, division2_mutate_3_2_A_4_1, division2_mutate_3_2_A_4_2, division2_mutate_3_2_A_4_3, division2_mutate_3_2_B_2_1, division2_mutate_3_2_B_2_3, division2_mutate_3_2_B_3_1, division2_mutate_3_2_B_3_3, division2_mutate_3_2_B_4_1, division2_mutate_3_2_B_4_2, division2_mutate_3_2_B_4_3, division2_mutate_3_3_A_2_2, division2_mutate_3_3_A_2_3, division2_mutate_3_3_A_2_4, division2_mutate_3_3_A_3_2, division2_mutate_3_3_A_3_4, division2_mutate_3_3_A_4_2, division2_mutate_3_3_A_4_3, division2_mutate_3_3_A_4_4, division2_mutate_3_3_B_2_3, division2_mutate_3_3_B_2_4, division2_mutate_3_3_B_3_2, division2_mutate_3_3_B_3_4, division2_mutate_3_3_B_4_2, division2_mutate_3_3_B_4_3, division2_mutate_3_3_B_4_4, division2_mutate_3_4_A_2_3, division2_mutate_3_4_A_2_4, division2_mutate_3_4_A_2_5, division2_mutate_3_4_A_3_3, division2_mutate_3_4_A_3_5, division2_mutate_3_4_A_4_3, division2_mutate_3_4_A_4_4, division2_mutate_3_4_A_4_5, division2_mutate_3_4_B_2_3, division2_mutate_3_4_B_2_4, division2_mutate_3_4_B_2_5, division2_mutate_3_4_B_3_3, division2_mutate_3_4_B_3_5, division2_mutate_3_4_B_4_3, division2_mutate_3_4_B_4_4, division2_mutate_3_4_B_4_5, division2_mutate_3_5_A_2_4, division2_mutate_3_5_A_2_5, division2_mutate_3_5_A_4_4, division2_mutate_3_5_A_4_5, division2_mutate_3_5_B_2_4, division2_mutate_3_5_B_2_5, division2_mutate_3_5_B_4_4, division2_mutate_3_5_B_4_5, division2_mutate_4_1_A_3_1, division2_mutate_4_1_A_3_2, division2_mutate_4_1_A_5_1, division2_mutate_4_1_A_5_2, division2_mutate_4_1_B_3_1, division2_mutate_4_1_B_3_2, division2_mutate_4_1_B_5_1, division2_mutate_4_1_B_5_2, division2_mutate_4_2_A_3_1, division2_mutate_4_2_A_3_2, division2_mutate_4_2_A_3_3, division2_mutate_4_2_A_4_1, division2_mutate_4_2_A_4_3, division2_mutate_4_2_A_5_1, division2_mutate_4_2_A_5_2, division2_mutate_4_2_A_5_3, division2_mutate_4_2_B_3_1, division2_mutate_4_2_B_3_2, division2_mutate_4_2_B_3_3, division2_mutate_4_2_B_4_1, division2_mutate_4_2_B_4_3, division2_mutate_4_2_B_5_1, division2_mutate_4_2_B_5_2, division2_mutate_4_2_B_5_3, division2_mutate_4_3_A_3_2, division2_mutate_4_3_A_3_3, division2_mutate_4_3_A_3_4, division2_mutate_4_3_A_4_2, division2_mutate_4_3_A_4_4, division2_mutate_4_3_A_5_2, division2_mutate_4_3_A_5_3, division2_mutate_4_3_A_5_4, division2_mutate_4_3_B_3_2, division2_mutate_4_3_B_3_3, division2_mutate_4_3_B_3_4, division2_mutate_4_3_B_4_2, division2_mutate_4_3_B_4_4, division2_mutate_4_3_B_5_2, division2_mutate_4_3_B_5_3, division2_mutate_4_3_B_5_4, division2_mutate_4_4_A_3_3, division2_mutate_4_4_A_3_4, division2_mutate_4_4_A_3_5, division2_mutate_4_4_A_4_3, division2_mutate_4_4_A_4_5, division2_mutate_4_4_A_5_3, division2_mutate_4_4_A_5_4, division2_mutate_4_4_A_5_5, division2_mutate_4_4_B_3_3, division2_mutate_4_4_B_3_4, division2_mutate_4_4_B_3_5, division2_mutate_4_4_B_4_3, division2_mutate_4_4_B_4_5, division2_mutate_4_4_B_5_3, division2_mutate_4_4_B_5_4, division2_mutate_4_4_B_5_5, division2_mutate_4_5_A_3_4, division2_mutate_4_5_A_3_5, division2_mutate_4_5_A_5_4, division2_mutate_4_5_A_5_5, division2_mutate_4_5_B_3_4, division2_mutate_4_5_B_3_5, division2_mutate_4_5_B_5_4, division2_mutate_4_5_B_5_5, division2_mutate_5_2_A_4_1, division2_mutate_5_2_A_4_3, division2_mutate_5_2_A_5_1, division2_mutate_5_2_A_5_3, division2_mutate_5_2_B_4_1, division2_mutate_5_2_B_4_3, division2_mutate_5_2_B_5_1, division2_mutate_5_2_B_5_3, division2_mutate_5_3_A_4_2, division2_mutate_5_3_A_4_4, division2_mutate_5_3_A_5_2, division2_mutate_5_3_A_5_4, division2_mutate_5_3_B_4_2, division2_mutate_5_3_B_4_4, division2_mutate_5_3_B_5_2, division2_mutate_5_3_B_5_4, division2_mutate_5_4_A_4_3, division2_mutate_5_4_A_4_5, division2_mutate_5_4_A_5_3, division2_mutate_5_4_A_5_5, division2_mutate_5_4_B_4_3, division2_mutate_5_4_B_4_5, division2_mutate_5_4_B_5_3, division2_mutate_5_4_B_5_5, division2_replicate_1_3_A_1_2, division2_replicate_1_3_A_1_4, division2_replicate_1_3_A_2_2, division2_replicate_1_3_A_2_4, division2_replicate_1_3_B_1_2, division2_replicate_1_3_B_1_4, division2_replicate_1_3_B_2_4, division2_replicate_1_4_A_1_3, division2_replicate_1_4_A_1_5, division2_replicate_1_4_A_2_3, division2_replicate_1_4_A_2_5, division2_replicate_1_4_B_1_3, division2_replicate_1_4_B_1_5, division2_replicate_1_4_B_2_3, division2_replicate_1_4_B_2_5, division2_replicate_2_3_A_1_2, division2_replicate_2_3_A_1_3, division2_replicate_2_3_A_1_4, division2_replicate_2_3_A_2_2, division2_replicate_2_3_A_2_4, division2_replicate_2_3_A_3_2, division2_replicate_2_3_A_3_3, division2_replicate_2_3_A_3_4, division2_replicate_2_3_B_1_2, division2_replicate_2_3_B_1_3, division2_replicate_2_3_B_1_4, division2_replicate_2_3_B_2_4, division2_replicate_2_3_B_3_2, division2_replicate_2_3_B_3_3, division2_replicate_2_3_B_3_4, division2_replicate_2_4_A_1_3, division2_replicate_2_4_A_1_4, division2_replicate_2_4_A_1_5, division2_replicate_2_4_A_2_3, division2_replicate_2_4_A_2_5, division2_replicate_2_4_A_3_3, division2_replicate_2_4_A_3_4, division2_replicate_2_4_A_3_5, division2_replicate_2_4_B_1_3, division2_replicate_2_4_B_1_4, division2_replicate_2_4_B_1_5, division2_replicate_2_4_B_2_3, division2_replicate_2_4_B_2_5, division2_replicate_2_4_B_3_3, division2_replicate_2_4_B_3_4, division2_replicate_2_4_B_3_5, division2_replicate_2_5_A_1_4, division2_replicate_2_5_A_1_5, division2_replicate_2_5_A_3_4, division2_replicate_2_5_A_3_5, division2_replicate_2_5_B_1_4, division2_replicate_2_5_B_1_5, division2_replicate_2_5_B_3_4, division2_replicate_2_5_B_3_5, division2_replicate_3_1_A_2_1, division2_replicate_3_1_A_2_2, division2_replicate_3_1_A_4_1, division2_replicate_3_1_A_4_2, division2_replicate_3_1_B_2_1, division2_replicate_3_1_B_4_1, division2_replicate_3_1_B_4_2, division2_replicate_3_2_A_2_1, division2_replicate_3_2_A_2_2, division2_replicate_3_2_A_2_3, division2_replicate_3_2_A_3_1, division2_replicate_3_2_A_3_3, division2_replicate_3_2_A_4_1, division2_replicate_3_2_A_4_2, division2_replicate_3_2_A_4_3, division2_replicate_3_2_B_2_1, division2_replicate_3_2_B_2_3, division2_replicate_3_2_B_3_1, division2_replicate_3_2_B_3_3, division2_replicate_3_2_B_4_1, division2_replicate_3_2_B_4_2, division2_replicate_3_2_B_4_3, division2_replicate_3_3_A_2_2, division2_replicate_3_3_A_2_3, division2_replicate_3_3_A_2_4, division2_replicate_3_3_A_3_2, division2_replicate_3_3_A_3_4, division2_replicate_3_3_A_4_2, division2_replicate_3_3_A_4_3, division2_replicate_3_3_A_4_4, division2_replicate_3_3_B_2_3, division2_replicate_3_3_B_2_4, division2_replicate_3_3_B_3_2, division2_replicate_3_3_B_3_4, division2_replicate_3_3_B_4_2, division2_replicate_3_3_B_4_3, division2_replicate_3_3_B_4_4, division2_replicate_3_4_A_2_3, division2_replicate_3_4_A_2_4, division2_replicate_3_4_A_2_5, division2_replicate_3_4_A_3_3, division2_replicate_3_4_A_3_5, division2_replicate_3_4_A_4_3, division2_replicate_3_4_A_4_4, division2_replicate_3_4_A_4_5, division2_replicate_3_4_B_2_3, division2_replicate_3_4_B_2_4, division2_replicate_3_4_B_2_5, division2_replicate_3_4_B_3_3, division2_replicate_3_4_B_3_5, division2_replicate_3_4_B_4_3, division2_replicate_3_4_B_4_4, division2_replicate_3_4_B_4_5, division2_replicate_3_5_A_2_4, division2_replicate_3_5_A_2_5, division2_replicate_3_5_A_4_4, division2_replicate_3_5_A_4_5, division2_replicate_3_5_B_2_4, division2_replicate_3_5_B_2_5, division2_replicate_3_5_B_4_4, division2_replicate_3_5_B_4_5, division2_replicate_4_1_A_3_1, division2_replicate_4_1_A_3_2, division2_replicate_4_1_A_5_1, division2_replicate_4_1_A_5_2, division2_replicate_4_1_B_3_1, division2_replicate_4_1_B_3_2, division2_replicate_4_1_B_5_1, division2_replicate_4_1_B_5_2, division2_replicate_4_2_A_3_1, division2_replicate_4_2_A_3_2, division2_replicate_4_2_A_3_3, division2_replicate_4_2_A_4_1, division2_replicate_4_2_A_4_3, division2_replicate_4_2_A_5_1, division2_replicate_4_2_A_5_2, division2_replicate_4_2_A_5_3, division2_replicate_4_2_B_3_1, division2_replicate_4_2_B_3_2, division2_replicate_4_2_B_3_3, division2_replicate_4_2_B_4_1, division2_replicate_4_2_B_4_3, division2_replicate_4_2_B_5_1, division2_replicate_4_2_B_5_2, division2_replicate_4_2_B_5_3, division2_replicate_4_3_A_3_2, division2_replicate_4_3_A_3_3, division2_replicate_4_3_A_3_4, division2_replicate_4_3_A_4_2, division2_replicate_4_3_A_4_4, division2_replicate_4_3_A_5_2, division2_replicate_4_3_A_5_3, division2_replicate_4_3_A_5_4, division2_replicate_4_3_B_3_2, division2_replicate_4_3_B_3_3, division2_replicate_4_3_B_3_4, division2_replicate_4_3_B_4_2, division2_replicate_4_3_B_4_4, division2_replicate_4_3_B_5_2, division2_replicate_4_3_B_5_3, division2_replicate_4_3_B_5_4, division2_replicate_4_4_A_3_3, division2_replicate_4_4_A_3_4, division2_replicate_4_4_A_3_5, division2_replicate_4_4_A_4_3, division2_replicate_4_4_A_4_5, division2_replicate_4_4_A_5_3, division2_replicate_4_4_A_5_4, division2_replicate_4_4_A_5_5, division2_replicate_4_4_B_3_3, division2_replicate_4_4_B_3_4, division2_replicate_4_4_B_3_5, division2_replicate_4_4_B_4_3, division2_replicate_4_4_B_4_5, division2_replicate_4_4_B_5_3, division2_replicate_4_4_B_5_4, division2_replicate_4_4_B_5_5, division2_replicate_4_5_A_3_4, division2_replicate_4_5_A_3_5, division2_replicate_4_5_A_5_4, division2_replicate_4_5_A_5_5, division2_replicate_4_5_B_3_4, division2_replicate_4_5_B_3_5, division2_replicate_4_5_B_5_4, division2_replicate_4_5_B_5_5, division2_replicate_5_2_A_4_1, division2_replicate_5_2_A_4_3, division2_replicate_5_2_A_5_1, division2_replicate_5_2_A_5_3, division2_replicate_5_2_B_4_1, division2_replicate_5_2_B_4_3, division2_replicate_5_2_B_5_1, division2_replicate_5_2_B_5_3, division2_replicate_5_3_A_4_2, division2_replicate_5_3_A_4_4, division2_replicate_5_3_A_5_2, division2_replicate_5_3_A_5_4, division2_replicate_5_3_B_4_2, division2_replicate_5_3_B_4_4, division2_replicate_5_3_B_5_2, division2_replicate_5_3_B_5_4, division2_replicate_5_4_A_4_3, division2_replicate_5_4_A_4_5, division2_replicate_5_4_A_5_3, division2_replicate_5_4_A_5_5, division2_replicate_5_4_B_4_3, division2_replicate_5_4_B_4_5, division2_replicate_5_4_B_5_3, division2_replicate_5_4_B_5_5, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :148/123/406/677
Computing Next relation with stutter on 2.38171e+11 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
7494 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,75.0596,1198136,1,0,1144,6.7976e+06,1232,386,8851,5.42364e+06,1473
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D05CS010-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(G((F("(((pool__5_4_>=1)&&(cell___4_5__A_>=1))&&(run_dot>=1))"))U("(((pool__1_3_>=1)&&(cell___2_2__B_>=1))&&(run_dot>=1))")))))
Formula 1 simplified : !G(F"(((pool__5_4_>=1)&&(cell___4_5__A_>=1))&&(run_dot>=1))" U "(((pool__1_3_>=1)&&(cell___2_2__B_>=1))&&(run_dot>=1))")
Computing Next relation with stutter on 2.38171e+11 deadlock states
28 unique states visited
28 strongly connected components in search stack
29 transitions explored
28 items max in DFS search stack
2666 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,101.722,1612096,1,0,1252,8.44657e+06,1251,499,8933,7.56599e+06,1762
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D05CS010-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X(F(X(X(X("(((pool__2_3_>=1)&&(cell___3_3__B_>=1))&&(run_dot>=1))")))))))
Formula 2 simplified : !XFXXX"(((pool__2_3_>=1)&&(cell___3_3__B_>=1))&&(run_dot>=1))"
Computing Next relation with stutter on 2.38171e+11 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
5688 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,158.602,2214492,1,0,1360,1.15391e+07,17,582,2912,1.0447e+07,60
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D05CS010-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(((F("(((pool__4_3_>=1)&&(cell___3_3__B_>=1))&&(run_dot>=1))"))U((X("(((pool__2_4_>=1)&&(cell___1_3__B_>=1))&&(run_dot>=1))"))U(X("(((pool__3_1_>=1)&&(cell___2_2__B_>=1))&&(run_dot>=1))")))))
Formula 3 simplified : !(F"(((pool__4_3_>=1)&&(cell___3_3__B_>=1))&&(run_dot>=1))" U (X"(((pool__2_4_>=1)&&(cell___1_3__B_>=1))&&(run_dot>=1))" U X"(((pool__3_1_>=1)&&(cell___2_2__B_>=1))&&(run_dot>=1))"))
Computing Next relation with stutter on 2.38171e+11 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
4635 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,204.951,2215000,1,0,1360,1.15391e+07,36,582,3888,1.0447e+07,438
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D05CS010-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(((F(X(F("(((pool__4_4_>=1)&&(cell___4_4__A_>=1))&&(run_dot>=1))"))))U((X("(((pool__2_2_>=1)&&(cell___2_2__B_>=1))&&(run_dot>=1))"))U("(((pool__3_4_>=1)&&(cell___3_3__B_>=1))&&(run_dot>=1))"))))
Formula 4 simplified : !(FXF"(((pool__4_4_>=1)&&(cell___4_4__A_>=1))&&(run_dot>=1))" U (X"(((pool__2_2_>=1)&&(cell___2_2__B_>=1))&&(run_dot>=1))" U "(((pool__3_4_>=1)&&(cell___3_3__B_>=1))&&(run_dot>=1))"))
Computing Next relation with stutter on 2.38171e+11 deadlock states
26 unique states visited
26 strongly connected components in search stack
26 transitions explored
26 items max in DFS search stack
2638 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,231.336,2215000,1,0,1360,1.15391e+07,41,582,3891,1.0447e+07,710
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D05CS010-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((G(X(F(("(((pool__2_3_>=1)&&(cell___3_3__A_>=1))&&(run_dot>=1))")U("(((pool__2_5_>=1)&&(cell___3_5__A_>=1))&&(run_dot>=1))"))))))
Formula 5 simplified : !GXF("(((pool__2_3_>=1)&&(cell___3_3__A_>=1))&&(run_dot>=1))" U "(((pool__2_5_>=1)&&(cell___3_5__A_>=1))&&(run_dot>=1))")
Computing Next relation with stutter on 2.38171e+11 deadlock states
28 unique states visited
28 strongly connected components in search stack
29 transitions explored
28 items max in DFS search stack
2313 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,254.469,2298824,1,0,1360,1.15391e+07,55,582,3968,1.09354e+07,870
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D05CS010-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F(X(G(F(X("(((pool__5_4_>=1)&&(cell___5_4__A_>=1))&&(run_dot>=1))")))))))
Formula 6 simplified : !FXGFX"(((pool__5_4_>=1)&&(cell___5_4__A_>=1))&&(run_dot>=1))"
Computing Next relation with stutter on 2.38171e+11 deadlock states
28 unique states visited
28 strongly connected components in search stack
29 transitions explored
28 items max in DFS search stack
0 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,254.479,2299064,1,0,1360,1.15391e+07,64,582,3973,1.09356e+07,878
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D05CS010-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((F(G(("(((pool__2_4_>=1)&&(cell___2_4__A_>=1))&&(run_dot>=1))")U(X("(((pool__2_4_>=1)&&(cell___2_3__B_>=1))&&(run_dot>=1))"))))))
Formula 7 simplified : !FG("(((pool__2_4_>=1)&&(cell___2_4__A_>=1))&&(run_dot>=1))" U X"(((pool__2_4_>=1)&&(cell___2_3__B_>=1))&&(run_dot>=1))")
Computing Next relation with stutter on 2.38171e+11 deadlock states
27 unique states visited
26 strongly connected components in search stack
28 transitions explored
27 items max in DFS search stack
4460 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,299.066,2448356,1,0,1360,1.19734e+07,24,582,2991,1.17818e+07,200
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D05CS010-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(((X(F("(((pool__2_2_>=1)&&(cell___1_3__B_>=1))&&(run_dot>=1))")))U(G(G(X("(((pool__4_4_>=1)&&(cell___3_4__A_>=1))&&(run_dot>=1))"))))))
Formula 8 simplified : !(XF"(((pool__2_2_>=1)&&(cell___1_3__B_>=1))&&(run_dot>=1))" U GX"(((pool__4_4_>=1)&&(cell___3_4__A_>=1))&&(run_dot>=1))")
Computing Next relation with stutter on 2.38171e+11 deadlock states
29 unique states visited
29 strongly connected components in search stack
30 transitions explored
29 items max in DFS search stack
1245 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,311.515,2448568,1,0,1360,1.19734e+07,42,582,3959,1.17818e+07,285
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D05CS010-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((G(G("(((pool__3_3_>=1)&&(cell___4_4__B_>=1))&&(run_dot>=1))"))))
Formula 9 simplified : !G"(((pool__3_3_>=1)&&(cell___4_4__B_>=1))&&(run_dot>=1))"
Computing Next relation with stutter on 2.38171e+11 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
3 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,311.551,2448568,1,0,1360,1.19734e+07,50,582,3965,1.17818e+07,298
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D05CS010-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(("(((pool__2_3_>=1)&&(cell___2_4__A_>=1))&&(run_dot>=1))"))
Formula 10 simplified : !"(((pool__2_3_>=1)&&(cell___2_4__A_>=1))&&(run_dot>=1))"
Computing Next relation with stutter on 2.38171e+11 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 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,311.552,2448568,1,0,1360,1.19734e+07,53,582,3969,1.17818e+07,300
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D05CS010-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((F(F(X("(((pool__2_4_>=1)&&(cell___1_4__A_>=1))&&(run_dot>=1))")))))
Formula 11 simplified : !FX"(((pool__2_4_>=1)&&(cell___1_4__A_>=1))&&(run_dot>=1))"
Computing Next relation with stutter on 2.38171e+11 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1692 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,328.478,2448568,1,0,1360,1.19734e+07,62,582,3973,1.17818e+07,551
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D05CS010-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G((("(((pool__2_2_>=1)&&(cell___1_3__A_>=1))&&(run_dot>=1))")U("(((pool__4_3_>=1)&&(cell___4_4__A_>=1))&&(run_dot>=1))"))U(G(X("(((pool__1_5_>=1)&&(cell___1_4__B_>=1))&&(run_dot>=1))"))))))
Formula 12 simplified : !G(("(((pool__2_2_>=1)&&(cell___1_3__A_>=1))&&(run_dot>=1))" U "(((pool__4_3_>=1)&&(cell___4_4__A_>=1))&&(run_dot>=1))") U GX"(((pool__1_5_>=1)&&(cell___1_4__B_>=1))&&(run_dot>=1))")
Computing Next relation with stutter on 2.38171e+11 deadlock states
29 unique states visited
29 strongly connected components in search stack
30 transitions explored
29 items max in DFS search stack
1704 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,345.525,2449492,1,0,1360,1.19734e+07,87,582,4005,1.17818e+07,1338
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D05CS010-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(("(((pool__1_3_>=1)&&(cell___2_3__B_>=1))&&(run_dot>=1))"))
Formula 13 simplified : !"(((pool__1_3_>=1)&&(cell___2_3__B_>=1))&&(run_dot>=1))"
Computing Next relation with stutter on 2.38171e+11 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 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,345.526,2449492,1,0,1360,1.19734e+07,90,582,4009,1.17818e+07,1340
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D05CS010-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(((G("(((pool__5_3_>=1)&&(cell___5_3__B_>=1))&&(run_dot>=1))"))U(X(F("(((pool__3_3_>=1)&&(cell___2_2__B_>=1))&&(run_dot>=1))")))))
Formula 14 simplified : !(G"(((pool__5_3_>=1)&&(cell___5_3__B_>=1))&&(run_dot>=1))" U XF"(((pool__3_3_>=1)&&(cell___2_2__B_>=1))&&(run_dot>=1))")
Computing Next relation with stutter on 2.38171e+11 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
328 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,348.812,2449492,1,0,1360,1.19734e+07,99,588,4014,1.17818e+07,1513
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D05CS010-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !(("(((pool__2_5_>=1)&&(cell___3_4__B_>=1))&&(run_dot>=1))"))
Formula 15 simplified : !"(((pool__2_5_>=1)&&(cell___3_4__B_>=1))&&(run_dot>=1))"
Computing Next relation with stutter on 2.38171e+11 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 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,348.82,2449492,1,0,1360,1.19734e+07,102,588,4019,1.17818e+07,1515
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D05CS010-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527490488123

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
May 28, 2018 6:48:43 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -smt]
May 28, 2018 6:48:43 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 6:48:44 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 134 ms
May 28, 2018 6:48:44 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 77 places.
May 28, 2018 6:48:44 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 677 transitions.
May 28, 2018 6:48:44 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 40 ms
May 28, 2018 6:48:44 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 170 ms
May 28, 2018 6:48:44 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 6 ms
May 28, 2018 6:48:44 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
May 28, 2018 6:48:44 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 677 transitions.
May 28, 2018 6:48:45 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 26 place invariants in 23 ms
May 28, 2018 6:48:45 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 77 variables to be positive in 311 ms
May 28, 2018 6:48:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 677 transitions.
May 28, 2018 6:48:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/677 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 6:48:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 98 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 6:48:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 677 transitions.
May 28, 2018 6:48:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 6:48:48 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 677 transitions.
May 28, 2018 6:48:48 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(1/677) took 305 ms. Total solver calls (SAT/UNSAT): 1351(0/1351)
May 28, 2018 6:48:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(22/677) took 3372 ms. Total solver calls (SAT/UNSAT): 15295(0/15295)
May 28, 2018 6:48:54 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(48/677) took 6446 ms. Total solver calls (SAT/UNSAT): 31948(0/31948)
May 28, 2018 6:48:58 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(72/677) took 9581 ms. Total solver calls (SAT/UNSAT): 46720(0/46720)
May 28, 2018 6:49:01 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(95/677) took 12694 ms. Total solver calls (SAT/UNSAT): 60336(0/60336)
May 28, 2018 6:49:04 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(101/677) took 15959 ms. Total solver calls (SAT/UNSAT): 63801(1091/62710)
May 28, 2018 6:49:08 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(103/677) took 19994 ms. Total solver calls (SAT/UNSAT): 64948(2161/62787)
May 28, 2018 6:49:12 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(106/677) took 23597 ms. Total solver calls (SAT/UNSAT): 66661(3770/62891)
May 28, 2018 6:49:16 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(110/677) took 27591 ms. Total solver calls (SAT/UNSAT): 68931(5830/63101)
May 28, 2018 6:49:21 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(111/677) took 33483 ms. Total solver calls (SAT/UNSAT): 69496(6368/63128)
May 28, 2018 6:49:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(112/677) took 38467 ms. Total solver calls (SAT/UNSAT): 70060(6889/63171)
May 28, 2018 6:49:33 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(113/677) took 45278 ms. Total solver calls (SAT/UNSAT): 70623(7410/63213)
May 28, 2018 6:49:39 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(117/677) took 50853 ms. Total solver calls (SAT/UNSAT): 72865(9452/63413)
May 28, 2018 6:49:44 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(119/677) took 55874 ms. Total solver calls (SAT/UNSAT): 73980(10446/63534)
May 28, 2018 6:49:48 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(120/677) took 59564 ms. Total solver calls (SAT/UNSAT): 74536(10940/63596)
May 28, 2018 6:49:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(122/677) took 63391 ms. Total solver calls (SAT/UNSAT): 75645(11972/63673)
May 28, 2018 6:49:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(124/677) took 67066 ms. Total solver calls (SAT/UNSAT): 76750(12958/63792)
May 28, 2018 6:50:01 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(127/677) took 73131 ms. Total solver calls (SAT/UNSAT): 78400(14480/63920)
May 28, 2018 6:50:12 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(128/677) took 83828 ms. Total solver calls (SAT/UNSAT): 78948(14968/63980)
May 28, 2018 6:50:22 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(129/677) took 93825 ms. Total solver calls (SAT/UNSAT): 79495(15454/64041)
May 28, 2018 6:50:25 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(130/677) took 96907 ms. Total solver calls (SAT/UNSAT): 80041(15956/64085)
May 28, 2018 6:50:33 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(131/677) took 104946 ms. Total solver calls (SAT/UNSAT): 80586(16467/64119)
May 28, 2018 6:50:46 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(132/677) took 117639 ms. Total solver calls (SAT/UNSAT): 81130(16980/64150)
May 28, 2018 6:50:58 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(133/677) took 130014 ms. Total solver calls (SAT/UNSAT): 81673(17464/64209)
May 28, 2018 6:51:07 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(134/677) took 138640 ms. Total solver calls (SAT/UNSAT): 82215(17946/64269)
May 28, 2018 6:51:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(135/677) took 149293 ms. Total solver calls (SAT/UNSAT): 82756(18444/64312)
May 28, 2018 6:51:27 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(136/677) took 159171 ms. Total solver calls (SAT/UNSAT): 83296(18957/64339)
May 28, 2018 6:51:31 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(137/677) took 162641 ms. Total solver calls (SAT/UNSAT): 83835(19444/64391)
May 28, 2018 6:51:35 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(138/677) took 166667 ms. Total solver calls (SAT/UNSAT): 84373(19947/64426)
May 28, 2018 6:51:41 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(142/677) took 172624 ms. Total solver calls (SAT/UNSAT): 86515(21953/64562)
May 28, 2018 6:51:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(143/677) took 177341 ms. Total solver calls (SAT/UNSAT): 87048(22454/64594)
May 28, 2018 6:52:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(144/677) took 192344 ms. Total solver calls (SAT/UNSAT): 87580(22929/64651)
May 28, 2018 6:52:13 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(145/677) took 205333 ms. Total solver calls (SAT/UNSAT): 88111(23418/64693)
May 28, 2018 6:52:20 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(146/677) took 212020 ms. Total solver calls (SAT/UNSAT): 88641(23888/64753)
May 28, 2018 6:52:25 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(147/677) took 216894 ms. Total solver calls (SAT/UNSAT): 89170(24393/64777)
May 28, 2018 6:52:32 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(148/677) took 224127 ms. Total solver calls (SAT/UNSAT): 89698(24890/64808)
May 28, 2018 6:52:37 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(149/677) took 229056 ms. Total solver calls (SAT/UNSAT): 90225(25361/64864)
May 28, 2018 6:52:44 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(150/677) took 236255 ms. Total solver calls (SAT/UNSAT): 90751(25846/64905)
May 28, 2018 6:52:49 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(151/677) took 241121 ms. Total solver calls (SAT/UNSAT): 91276(26312/64964)
May 28, 2018 6:53:01 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(152/677) took 253383 ms. Total solver calls (SAT/UNSAT): 91800(26804/64996)
May 28, 2018 6:53:08 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(154/677) took 259825 ms. Total solver calls (SAT/UNSAT): 92845(27770/65075)
May 28, 2018 6:53:11 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(156/677) took 262830 ms. Total solver calls (SAT/UNSAT): 93886(28706/65180)
May 28, 2018 6:53:20 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(157/677) took 271908 ms. Total solver calls (SAT/UNSAT): 94405(29176/65229)
May 28, 2018 6:53:33 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(158/677) took 285524 ms. Total solver calls (SAT/UNSAT): 94923(29627/65296)
May 28, 2018 6:53:39 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(161/677) took 291271 ms. Total solver calls (SAT/UNSAT): 96471(31038/65433)
May 28, 2018 6:53:48 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(162/677) took 300351 ms. Total solver calls (SAT/UNSAT): 96985(31513/65472)
May 28, 2018 6:53:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(163/677) took 306781 ms. Total solver calls (SAT/UNSAT): 97498(31987/65511)
May 28, 2018 6:53:59 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(164/677) took 310679 ms. Total solver calls (SAT/UNSAT): 98010(32435/65575)
May 28, 2018 6:54:09 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(165/677) took 320662 ms. Total solver calls (SAT/UNSAT): 98521(32898/65623)
May 28, 2018 6:54:19 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(166/677) took 331244 ms. Total solver calls (SAT/UNSAT): 99031(33342/65689)
May 28, 2018 6:54:28 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(167/677) took 340196 ms. Total solver calls (SAT/UNSAT): 99540(33784/65756)
May 28, 2018 6:54:33 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(168/677) took 345146 ms. Total solver calls (SAT/UNSAT): 100048(34254/65794)
May 28, 2018 6:54:40 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(169/677) took 352527 ms. Total solver calls (SAT/UNSAT): 100555(34722/65833)
SMT solver raised 'unknown', retrying with same input.
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:490)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
May 28, 2018 6:54:47 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 363106ms conformant to PINS in folder :/home/mcc/execution

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="PhaseVariation-PT-D05CS010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/PhaseVariation-PT-D05CS010.tgz
mv PhaseVariation-PT-D05CS010 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstools"
echo " Input is PhaseVariation-PT-D05CS010, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r260-csrt-152732585400176"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;