About the Execution of ITS-Tools.L for SharedMemory-PT-000010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15752.260 | 26186.00 | 55051.00 | 376.40 | FTTFTTTFTTTFFFFF | 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 608K
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K 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 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.6K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 34K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 24K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 167K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is SharedMemory-PT-000010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r213-smll-152732264600569
=====================================================================
--------------------
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 SharedMemory-PT-000010-LTLCardinality-00
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-01
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-02
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-03
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-04
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-05
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-06
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-07
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-08
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-09
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-10
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-11
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-12
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-13
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-14
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527862486681
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.201805241334/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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.201805241334/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((G(X("((((((((((Queue_6+Queue_5)+Queue_4)+Queue_3)+Queue_2)+Queue_1)+Queue_10)+Queue_9)+Queue_8)+Queue_7)<=(((((((((OwnMemAcc_4+OwnMemAcc_3)+OwnMemAcc_2)+OwnMemAcc_1)+OwnMemAcc_6)+OwnMemAcc_5)+OwnMemAcc_8)+OwnMemAcc_7)+OwnMemAcc_10)+OwnMemAcc_9))"))))
Formula 0 simplified : !GX"((((((((((Queue_6+Queue_5)+Queue_4)+Queue_3)+Queue_2)+Queue_1)+Queue_10)+Queue_9)+Queue_8)+Queue_7)<=(((((((((OwnMemAcc_4+OwnMemAcc_3)+OwnMemAcc_2)+OwnMemAcc_1)+OwnMemAcc_6)+OwnMemAcc_5)+OwnMemAcc_8)+OwnMemAcc_7)+OwnMemAcc_10)+OwnMemAcc_9))"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 210 rows 131 cols
invariant :Ext_Mem_Acc_3_8 + Ext_Mem_Acc_4_8 + Ext_Mem_Acc_5_8 + Ext_Mem_Acc_6_8 + Ext_Mem_Acc_1_8 + Ext_Mem_Acc_2_8 + Ext_Mem_Acc_7_8 + Ext_Mem_Acc_9_8 + Ext_Mem_Acc_10_8 + Memory_8 = 1
invariant :Ext_Mem_Acc_2_4 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_6_4 + Ext_Mem_Acc_7_4 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_5_4 + Ext_Mem_Acc_10_4 + Ext_Mem_Acc_8_4 + Ext_Mem_Acc_9_4 + Memory_4 = 1
invariant :Ext_Mem_Acc_2_1 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_6_1 + Ext_Mem_Acc_7_1 + Ext_Mem_Acc_8_1 + Ext_Mem_Acc_9_1 + Ext_Mem_Acc_10_1 + Memory_1 = 1
invariant :Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_3_6 + -1'Ext_Mem_Acc_2_7 + -1'Ext_Mem_Acc_1_7 + -1'Ext_Mem_Acc_8_7 + -1'Ext_Mem_Acc_6_7 + -1'Ext_Mem_Acc_5_7 + -1'Ext_Mem_Acc_4_7 + -1'Ext_Mem_Acc_4_8 + -1'Ext_Mem_Acc_5_8 + -1'Ext_Mem_Acc_6_8 + -1'Ext_Mem_Acc_9_7 + -1'Ext_Mem_Acc_10_7 + -1'Ext_Mem_Acc_1_8 + -1'Ext_Mem_Acc_2_8 + Ext_Mem_Acc_3_9 + -1'Ext_Mem_Acc_7_8 + -1'Ext_Mem_Acc_9_8 + -1'Ext_Mem_Acc_10_8 + Ext_Mem_Acc_3_10 + -1'Memory_7 + -1'Memory_8 + Active_3 + Queue_3 + OwnMemAcc_3 = -1
invariant :Ext_Mem_Acc_10_1 + Ext_Mem_Acc_10_2 + Ext_Mem_Acc_10_3 + Ext_Mem_Acc_10_4 + Ext_Mem_Acc_10_5 + Ext_Mem_Acc_10_6 + Ext_Mem_Acc_10_7 + Ext_Mem_Acc_10_8 + Ext_Mem_Acc_10_9 + Active_10 + Queue_10 + OwnMemAcc_10 = 1
invariant :Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 + Ext_Mem_Acc_5_6 + Ext_Mem_Acc_5_7 + Ext_Mem_Acc_5_8 + Ext_Mem_Acc_5_9 + Ext_Mem_Acc_5_10 + Active_5 + Queue_5 + OwnMemAcc_5 = 1
invariant :Ext_Mem_Acc_4_6 + Ext_Mem_Acc_3_6 + Ext_Mem_Acc_2_6 + Ext_Mem_Acc_1_6 + Ext_Mem_Acc_9_6 + Ext_Mem_Acc_8_6 + Ext_Mem_Acc_7_6 + Ext_Mem_Acc_5_6 + Ext_Mem_Acc_10_6 + Memory_6 = 1
invariant :Ext_Mem_Acc_2_9 + Ext_Mem_Acc_3_9 + Ext_Mem_Acc_4_9 + Ext_Mem_Acc_5_9 + Ext_Mem_Acc_1_9 + Ext_Mem_Acc_7_9 + Ext_Mem_Acc_6_9 + Ext_Mem_Acc_10_9 + Ext_Mem_Acc_8_9 + Memory_9 = 1
invariant :-1'Ext_Mem_Acc_3_1 + -1'Ext_Mem_Acc_4_1 + -1'Ext_Mem_Acc_5_1 + -1'Ext_Mem_Acc_6_1 + -1'Ext_Mem_Acc_7_1 + -1'Ext_Mem_Acc_8_1 + -1'Ext_Mem_Acc_9_1 + -1'Ext_Mem_Acc_10_1 + Ext_Mem_Acc_2_3 + -1'Ext_Mem_Acc_1_4 + -1'Ext_Mem_Acc_6_4 + -1'Ext_Mem_Acc_7_4 + -1'Ext_Mem_Acc_3_4 + -1'Ext_Mem_Acc_5_4 + -1'Ext_Mem_Acc_10_4 + -1'Ext_Mem_Acc_8_4 + -1'Ext_Mem_Acc_9_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_2_6 + Ext_Mem_Acc_2_7 + Ext_Mem_Acc_2_8 + -1'Ext_Mem_Acc_3_9 + -1'Ext_Mem_Acc_4_9 + -1'Ext_Mem_Acc_5_9 + -1'Ext_Mem_Acc_1_9 + -1'Ext_Mem_Acc_1_10 + -1'Ext_Mem_Acc_4_10 + -1'Ext_Mem_Acc_3_10 + -1'Ext_Mem_Acc_7_9 + -1'Ext_Mem_Acc_6_9 + -1'Ext_Mem_Acc_10_9 + -1'Ext_Mem_Acc_8_9 + -1'Ext_Mem_Acc_9_10 + -1'Memory_1 + -1'Ext_Mem_Acc_6_10 + -1'Ext_Mem_Acc_5_10 + -1'Ext_Mem_Acc_8_10 + -1'Ext_Mem_Acc_7_10 + -1'Memory_9 + -1'Memory_10 + -1'Memory_4 + Active_2 + Queue_2 + OwnMemAcc_2 = -3
invariant :Ext_Mem_Acc_1_3 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_6_3 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_8_3 + Ext_Mem_Acc_7_3 + Ext_Mem_Acc_10_3 + Ext_Mem_Acc_9_3 + Memory_3 = 1
invariant :Ext_Bus + -1'Memory_2 + -1'Memory_1 + -1'Memory_9 + -1'Memory_10 + -1'Memory_7 + -1'Memory_8 + -1'Memory_5 + -1'Memory_6 + -1'Memory_3 + -1'Memory_4 = -9
invariant :-1'Ext_Mem_Acc_3_2 + -1'Ext_Mem_Acc_4_2 + -1'Ext_Mem_Acc_5_2 + -1'Ext_Mem_Acc_7_2 + -1'Ext_Mem_Acc_6_2 + -1'Ext_Mem_Acc_9_2 + -1'Ext_Mem_Acc_8_2 + -1'Ext_Mem_Acc_10_2 + -1'Ext_Mem_Acc_4_3 + -1'Ext_Mem_Acc_2_3 + -1'Ext_Mem_Acc_6_3 + -1'Ext_Mem_Acc_5_3 + -1'Ext_Mem_Acc_8_3 + -1'Ext_Mem_Acc_7_3 + -1'Ext_Mem_Acc_10_3 + -1'Ext_Mem_Acc_9_3 + Ext_Mem_Acc_1_4 + -1'Ext_Mem_Acc_4_5 + -1'Ext_Mem_Acc_6_5 + -1'Ext_Mem_Acc_2_5 + -1'Ext_Mem_Acc_3_5 + -1'Ext_Mem_Acc_9_5 + -1'Ext_Mem_Acc_10_5 + -1'Ext_Mem_Acc_7_5 + -1'Ext_Mem_Acc_8_5 + Ext_Mem_Acc_1_6 + Ext_Mem_Acc_1_7 + Ext_Mem_Acc_1_8 + Ext_Mem_Acc_1_9 + Ext_Mem_Acc_1_10 + -1'Memory_2 + -1'Memory_5 + -1'Memory_3 + Active_1 + Queue_1 + OwnMemAcc_1 = -2
invariant :Ext_Mem_Acc_9_1 + Ext_Mem_Acc_9_2 + Ext_Mem_Acc_9_3 + Ext_Mem_Acc_9_4 + Ext_Mem_Acc_9_5 + Ext_Mem_Acc_9_6 + Ext_Mem_Acc_9_7 + Ext_Mem_Acc_9_8 + Ext_Mem_Acc_9_10 + Active_9 + Queue_9 + OwnMemAcc_9 = 1
invariant :Ext_Mem_Acc_6_1 + Ext_Mem_Acc_6_2 + Ext_Mem_Acc_6_3 + Ext_Mem_Acc_6_4 + Ext_Mem_Acc_6_5 + Ext_Mem_Acc_6_7 + Ext_Mem_Acc_6_8 + Ext_Mem_Acc_6_9 + Ext_Mem_Acc_6_10 + Active_6 + Queue_6 + OwnMemAcc_6 = 1
invariant :Ext_Mem_Acc_2_10 + Ext_Mem_Acc_1_10 + Ext_Mem_Acc_4_10 + Ext_Mem_Acc_3_10 + Ext_Mem_Acc_9_10 + Ext_Mem_Acc_6_10 + Ext_Mem_Acc_5_10 + Ext_Mem_Acc_8_10 + Ext_Mem_Acc_7_10 + Memory_10 = 1
invariant :Ext_Mem_Acc_8_1 + Ext_Mem_Acc_8_2 + Ext_Mem_Acc_8_3 + Ext_Mem_Acc_8_4 + Ext_Mem_Acc_8_5 + Ext_Mem_Acc_8_6 + Ext_Mem_Acc_8_7 + Ext_Mem_Acc_8_9 + Ext_Mem_Acc_8_10 + Active_8 + Queue_8 + OwnMemAcc_8 = 1
invariant :Ext_Mem_Acc_7_1 + Ext_Mem_Acc_7_2 + Ext_Mem_Acc_7_3 + Ext_Mem_Acc_7_4 + Ext_Mem_Acc_7_5 + Ext_Mem_Acc_7_6 + Ext_Mem_Acc_7_8 + Ext_Mem_Acc_7_9 + Ext_Mem_Acc_7_10 + Active_7 + Queue_7 + OwnMemAcc_7 = 1
invariant :Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + -1'Ext_Mem_Acc_3_6 + -1'Ext_Mem_Acc_2_6 + -1'Ext_Mem_Acc_1_6 + -1'Ext_Mem_Acc_9_6 + -1'Ext_Mem_Acc_8_6 + -1'Ext_Mem_Acc_7_6 + -1'Ext_Mem_Acc_5_6 + -1'Ext_Mem_Acc_10_6 + Ext_Mem_Acc_4_7 + Ext_Mem_Acc_4_8 + Ext_Mem_Acc_4_9 + Ext_Mem_Acc_4_10 + -1'Memory_6 + Active_4 + Queue_4 + OwnMemAcc_4 = 0
invariant :Ext_Mem_Acc_1_5 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_6_5 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_9_5 + Ext_Mem_Acc_10_5 + Ext_Mem_Acc_7_5 + Ext_Mem_Acc_8_5 + Memory_5 = 1
invariant :Ext_Mem_Acc_3_7 + Ext_Mem_Acc_2_7 + Ext_Mem_Acc_1_7 + Ext_Mem_Acc_8_7 + Ext_Mem_Acc_6_7 + Ext_Mem_Acc_5_7 + Ext_Mem_Acc_4_7 + Ext_Mem_Acc_9_7 + Ext_Mem_Acc_10_7 + Memory_7 = 1
invariant :Ext_Mem_Acc_1_2 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_7_2 + Ext_Mem_Acc_6_2 + Ext_Mem_Acc_9_2 + Ext_Mem_Acc_8_2 + Ext_Mem_Acc_10_2 + Memory_2 = 1
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1592 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,15.9618,373180,1,0,30,1.03565e+06,23,10,5812,806073,77
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SharedMemory-PT-000010-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((G(G("(Ext_Bus<=(((((((((Memory_2+Memory_1)+Memory_9)+Memory_10)+Memory_7)+Memory_8)+Memory_5)+Memory_6)+Memory_3)+Memory_4))")))U("((((((((((OwnMemAcc_4+OwnMemAcc_3)+OwnMemAcc_2)+OwnMemAcc_1)+OwnMemAcc_6)+OwnMemAcc_5)+OwnMemAcc_8)+OwnMemAcc_7)+OwnMemAcc_10)+OwnMemAcc_9)<=(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((Ext_Mem_Acc_2_1+Ext_Mem_Acc_3_1)+Ext_Mem_Acc_4_1)+Ext_Mem_Acc_5_1)+Ext_Mem_Acc_6_1)+Ext_Mem_Acc_7_1)+Ext_Mem_Acc_8_1)+Ext_Mem_Acc_9_1)+Ext_Mem_Acc_10_1)+Ext_Mem_Acc_1_2)+Ext_Mem_Acc_3_2)+Ext_Mem_Acc_4_2)+Ext_Mem_Acc_5_2)+Ext_Mem_Acc_7_2)+Ext_Mem_Acc_6_2)+Ext_Mem_Acc_9_2)+Ext_Mem_Acc_8_2)+Ext_Mem_Acc_1_3)+Ext_Mem_Acc_10_2)+Ext_Mem_Acc_4_3)+Ext_Mem_Acc_2_3)+Ext_Mem_Acc_6_3)+Ext_Mem_Acc_5_3)+Ext_Mem_Acc_8_3)+Ext_Mem_Acc_7_3)+Ext_Mem_Acc_10_3)+Ext_Mem_Acc_9_3)+Ext_Mem_Acc_2_4)+Ext_Mem_Acc_1_4)+Ext_Mem_Acc_6_4)+Ext_Mem_Acc_7_4)+Ext_Mem_Acc_3_4)+Ext_Mem_Acc_5_4)+Ext_Mem_Acc_10_4)+Ext_Mem_Acc_1_5)+Ext_Mem_Acc_8_4)+Ext_Mem_Acc_9_4)+Ext_Mem_Acc_4_5)+Ext_Mem_Acc_6_5)+Ext_Mem_Acc_2_5)+Ext_Mem_Acc_3_5)+Ext_Mem_Acc_9_5)+Ext_Mem_Acc_10_5)+Ext_Mem_Acc_7_5)+Ext_Mem_Acc_8_5)+Ext_Mem_Acc_4_6)+Ext_Mem_Acc_3_6)+Ext_Mem_Acc_2_6)+Ext_Mem_Acc_1_6)+Ext_Mem_Acc_9_6)+Ext_Mem_Acc_8_6)+Ext_Mem_Acc_7_6)+Ext_Mem_Acc_5_6)+Ext_Mem_Acc_3_7)+Ext_Mem_Acc_2_7)+Ext_Mem_Acc_1_7)+Ext_Mem_Acc_10_6)+Ext_Mem_Acc_8_7)+Ext_Mem_Acc_6_7)+Ext_Mem_Acc_5_7)+Ext_Mem_Acc_4_7)+Ext_Mem_Acc_3_8)+Ext_Mem_Acc_4_8)+Ext_Mem_Acc_5_8)+Ext_Mem_Acc_6_8)+Ext_Mem_Acc_9_7)+Ext_Mem_Acc_10_7)+Ext_Mem_Acc_1_8)+Ext_Mem_Acc_2_8)+Ext_Mem_Acc_2_9)+Ext_Mem_Acc_3_9)+Ext_Mem_Acc_4_9)+Ext_Mem_Acc_5_9)+Ext_Mem_Acc_7_8)+Ext_Mem_Acc_9_8)+Ext_Mem_Acc_10_8)+Ext_Mem_Acc_1_9)+Ext_Mem_Acc_2_10)+Ext_Mem_Acc_1_10)+Ext_Mem_Acc_4_10)+Ext_Mem_Acc_3_10)+Ext_Mem_Acc_7_9)+Ext_Mem_Acc_6_9)+Ext_Mem_Acc_10_9)+Ext_Mem_Acc_8_9)+Ext_Mem_Acc_9_10)+Ext_Mem_Acc_6_10)+Ext_Mem_Acc_5_10)+Ext_Mem_Acc_8_10)+Ext_Mem_Acc_7_10))")))
Formula 1 simplified : !(G"(Ext_Bus<=(((((((((Memory_2+Memory_1)+Memory_9)+Memory_10)+Memory_7)+Memory_8)+Memory_5)+Memory_6)+Memory_3)+Memory_4))" U "((((((((((OwnMemAcc_4+OwnMemAcc_3)+OwnMemAcc_2)+OwnMemAcc_1)+OwnMemAcc_6)+OwnMemAcc_5)+OwnMemAcc_8)+OwnMemAcc_7)+OwnMemAcc_10)+OwnMemAcc_9)<=(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((Ext_Mem_Acc_2_1+Ext_Mem_Acc_3_1)+Ext_Mem_Acc_4_1)+Ext_Mem_Acc_5_1)+Ext_Mem_Acc_6_1)+Ext_Mem_Acc_7_1)+Ext_Mem_Acc_8_1)+Ext_Mem_Acc_9_1)+Ext_Mem_Acc_10_1)+Ext_Mem_Acc_1_2)+Ext_Mem_Acc_3_2)+Ext_Mem_Acc_4_2)+Ext_Mem_Acc_5_2)+Ext_Mem_Acc_7_2)+Ext_Mem_Acc_6_2)+Ext_Mem_Acc_9_2)+Ext_Mem_Acc_8_2)+Ext_Mem_Acc_1_3)+Ext_Mem_Acc_10_2)+Ext_Mem_Acc_4_3)+Ext_Mem_Acc_2_3)+Ext_Mem_Acc_6_3)+Ext_Mem_Acc_5_3)+Ext_Mem_Acc_8_3)+Ext_Mem_Acc_7_3)+Ext_Mem_Acc_10_3)+Ext_Mem_Acc_9_3)+Ext_Mem_Acc_2_4)+Ext_Mem_Acc_1_4)+Ext_Mem_Acc_6_4)+Ext_Mem_Acc_7_4)+Ext_Mem_Acc_3_4)+Ext_Mem_Acc_5_4)+Ext_Mem_Acc_10_4)+Ext_Mem_Acc_1_5)+Ext_Mem_Acc_8_4)+Ext_Mem_Acc_9_4)+Ext_Mem_Acc_4_5)+Ext_Mem_Acc_6_5)+Ext_Mem_Acc_2_5)+Ext_Mem_Acc_3_5)+Ext_Mem_Acc_9_5)+Ext_Mem_Acc_10_5)+Ext_Mem_Acc_7_5)+Ext_Mem_Acc_8_5)+Ext_Mem_Acc_4_6)+Ext_Mem_Acc_3_6)+Ext_Mem_Acc_2_6)+Ext_Mem_Acc_1_6)+Ext_Mem_Acc_9_6)+Ext_Mem_Acc_8_6)+Ext_Mem_Acc_7_6)+Ext_Mem_Acc_5_6)+Ext_Mem_Acc_3_7)+Ext_Mem_Acc_2_7)+Ext_Mem_Acc_1_7)+Ext_Mem_Acc_10_6)+Ext_Mem_Acc_8_7)+Ext_Mem_Acc_6_7)+Ext_Mem_Acc_5_7)+Ext_Mem_Acc_4_7)+Ext_Mem_Acc_3_8)+Ext_Mem_Acc_4_8)+Ext_Mem_Acc_5_8)+Ext_Mem_Acc_6_8)+Ext_Mem_Acc_9_7)+Ext_Mem_Acc_10_7)+Ext_Mem_Acc_1_8)+Ext_Mem_Acc_2_8)+Ext_Mem_Acc_2_9)+Ext_Mem_Acc_3_9)+Ext_Mem_Acc_4_9)+Ext_Mem_Acc_5_9)+Ext_Mem_Acc_7_8)+Ext_Mem_Acc_9_8)+Ext_Mem_Acc_10_8)+Ext_Mem_Acc_1_9)+Ext_Mem_Acc_2_10)+Ext_Mem_Acc_1_10)+Ext_Mem_Acc_4_10)+Ext_Mem_Acc_3_10)+Ext_Mem_Acc_7_9)+Ext_Mem_Acc_6_9)+Ext_Mem_Acc_10_9)+Ext_Mem_Acc_8_9)+Ext_Mem_Acc_9_10)+Ext_Mem_Acc_6_10)+Ext_Mem_Acc_5_10)+Ext_Mem_Acc_8_10)+Ext_Mem_Acc_7_10))")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
2 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,15.9819,373940,1,0,30,1.03565e+06,33,10,5939,806073,81
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000010-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(G(("(Ext_Bus<=(((((((((OwnMemAcc_4+OwnMemAcc_3)+OwnMemAcc_2)+OwnMemAcc_1)+OwnMemAcc_6)+OwnMemAcc_5)+OwnMemAcc_8)+OwnMemAcc_7)+OwnMemAcc_10)+OwnMemAcc_9))")U("(Ext_Bus<=(((((((((Memory_2+Memory_1)+Memory_9)+Memory_10)+Memory_7)+Memory_8)+Memory_5)+Memory_6)+Memory_3)+Memory_4))")))))
Formula 2 simplified : !G("(Ext_Bus<=(((((((((OwnMemAcc_4+OwnMemAcc_3)+OwnMemAcc_2)+OwnMemAcc_1)+OwnMemAcc_6)+OwnMemAcc_5)+OwnMemAcc_8)+OwnMemAcc_7)+OwnMemAcc_10)+OwnMemAcc_9))" U "(Ext_Bus<=(((((((((Memory_2+Memory_1)+Memory_9)+Memory_10)+Memory_7)+Memory_8)+Memory_5)+Memory_6)+Memory_3)+Memory_4))")
1 unique states visited
0 strongly connected components in search stack
1 transitions explored
1 items max in DFS search stack
178 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,17.76,409728,1,0,40,1.09005e+06,47,21,6038,875517,141
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000010-LTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G("((((((((((Active_7+Active_8)+Active_5)+Active_6)+Active_3)+Active_4)+Active_1)+Active_2)+Active_10)+Active_9)>=1)")))
Formula 3 simplified : !G"((((((((((Active_7+Active_8)+Active_5)+Active_6)+Active_3)+Active_4)+Active_1)+Active_2)+Active_10)+Active_9)>=1)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
149 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,19.2587,448532,1,0,43,1.12884e+06,53,21,6285,908358,177
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SharedMemory-PT-000010-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(G(G(G("((((((((((Memory_2+Memory_1)+Memory_9)+Memory_10)+Memory_7)+Memory_8)+Memory_5)+Memory_6)+Memory_3)+Memory_4)>=3)"))))))
Formula 4 simplified : !G"((((((((((Memory_2+Memory_1)+Memory_9)+Memory_10)+Memory_7)+Memory_8)+Memory_5)+Memory_6)+Memory_3)+Memory_4)>=3)"
1 unique states visited
0 strongly connected components in search stack
1 transitions explored
1 items max in DFS search stack
11 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,19.3681,451172,1,0,43,1.12884e+06,59,21,6329,908358,205
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000010-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((("(Ext_Bus>=2)")U(G(X("((((((((((Memory_2+Memory_1)+Memory_9)+Memory_10)+Memory_7)+Memory_8)+Memory_5)+Memory_6)+Memory_3)+Memory_4)>=2)")))))
Formula 5 simplified : !("(Ext_Bus>=2)" U GX"((((((((((Memory_2+Memory_1)+Memory_9)+Memory_10)+Memory_7)+Memory_8)+Memory_5)+Memory_6)+Memory_3)+Memory_4)>=2)")
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
2 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,19.3953,452348,1,0,43,1.12886e+06,75,21,6358,908496,217
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000010-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(("((((((((((Memory_2+Memory_1)+Memory_9)+Memory_10)+Memory_7)+Memory_8)+Memory_5)+Memory_6)+Memory_3)+Memory_4)>=1)"))
Formula 6 simplified : !"((((((((((Memory_2+Memory_1)+Memory_9)+Memory_10)+Memory_7)+Memory_8)+Memory_5)+Memory_6)+Memory_3)+Memory_4)>=1)"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,19.3967,452612,1,0,43,1.12886e+06,78,21,6369,908496,219
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000010-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("((((((((((Queue_6+Queue_5)+Queue_4)+Queue_3)+Queue_2)+Queue_1)+Queue_10)+Queue_9)+Queue_8)+Queue_7)>=2)"))
Formula 7 simplified : !"((((((((((Queue_6+Queue_5)+Queue_4)+Queue_3)+Queue_2)+Queue_1)+Queue_10)+Queue_9)+Queue_8)+Queue_7)>=2)"
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,19.4007,452876,1,0,43,1.12889e+06,81,21,6380,908624,223
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SharedMemory-PT-000010-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((X(G("(Active_6<=Ext_Mem_Acc_5_2)")))U(("(Queue_5<=Ext_Mem_Acc_6_8)")U("(Ext_Mem_Acc_1_3<=Ext_Mem_Acc_8_2)"))))
Formula 8 simplified : !(XG"(Active_6<=Ext_Mem_Acc_5_2)" U ("(Queue_5<=Ext_Mem_Acc_6_8)" U "(Ext_Mem_Acc_1_3<=Ext_Mem_Acc_8_2)"))
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,19.4028,453468,1,0,43,1.12889e+06,92,21,6390,908624,229
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000010-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(("(Ext_Mem_Acc_5_9<=Ext_Mem_Acc_7_3)"))
Formula 9 simplified : !"(Ext_Mem_Acc_5_9<=Ext_Mem_Acc_7_3)"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,19.4032,453468,1,0,43,1.12889e+06,95,21,6393,908624,231
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000010-LTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(("(Ext_Mem_Acc_10_2<=Ext_Mem_Acc_2_7)"))
Formula 10 simplified : !"(Ext_Mem_Acc_10_2<=Ext_Mem_Acc_2_7)"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,19.4037,453468,1,0,43,1.12889e+06,98,21,6397,908624,233
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000010-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G("(Ext_Mem_Acc_6_2<=Ext_Mem_Acc_5_9)")))
Formula 11 simplified : !G"(Ext_Mem_Acc_6_2<=Ext_Mem_Acc_5_9)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
31 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,19.7147,460860,1,0,55,1.13548e+06,104,21,6402,920269,296
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA SharedMemory-PT-000010-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X("(Memory_7<=Ext_Mem_Acc_8_1)")))
Formula 12 simplified : !X"(Memory_7<=Ext_Mem_Acc_8_1)"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,19.7362,461388,1,0,56,1.1361e+06,107,21,6405,920781,303
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA SharedMemory-PT-000010-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(X(F(X("(Memory_3<=Active_4)"))))))
Formula 13 simplified : !GXFX"(Memory_3<=Active_4)"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
26 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,20.0011,469816,1,0,58,1.15096e+06,116,22,6410,934657,316
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA SharedMemory-PT-000010-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G("(Ext_Mem_Acc_5_3<=Ext_Mem_Acc_2_5)")))
Formula 14 simplified : !G"(Ext_Mem_Acc_5_3<=Ext_Mem_Acc_2_5)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
26 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,20.261,476680,1,0,70,1.1568e+06,122,22,6415,943063,379
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA SharedMemory-PT-000010-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((G("(Ext_Mem_Acc_2_3<=Ext_Mem_Acc_9_7)")))
Formula 15 simplified : !G"(Ext_Mem_Acc_2_3<=Ext_Mem_Acc_9_7)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
31 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,20.5676,484864,1,0,82,1.16389e+06,128,22,6420,953424,442
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA SharedMemory-PT-000010-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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 1527862512867
--------------------
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 LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -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 LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Jun 01, 2018 2:14:48 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -louvain, -smt]
Jun 01, 2018 2:14:48 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2018 2:14:49 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 91 ms
Jun 01, 2018 2:14:49 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 131 places.
Jun 01, 2018 2:14:49 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 210 transitions.
Jun 01, 2018 2:14:49 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 21 ms
Jun 01, 2018 2:14:49 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 122 ms
Jun 01, 2018 2:14:49 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 8 ms
Jun 01, 2018 2:14:49 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
Jun 01, 2018 2:14:49 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 210 transitions.
Jun 01, 2018 2:14:50 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 21 place invariants in 70 ms
Jun 01, 2018 2:14:50 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 131 variables to be positive in 477 ms
Jun 01, 2018 2:14:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 210 transitions.
Jun 01, 2018 2:14:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/210 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2018 2:14:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2018 2:14:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 210 transitions.
Jun 01, 2018 2:14:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2018 2:14:57 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 210 transitions.
Jun 01, 2018 2:14:57 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(0/210) took 106 ms. Total solver calls (SAT/UNSAT): 98(61/37)
Jun 01, 2018 2:15:00 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(23/210) took 3180 ms. Total solver calls (SAT/UNSAT): 1945(1326/619)
Jun 01, 2018 2:15:03 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(48/210) took 6250 ms. Total solver calls (SAT/UNSAT): 3667(2444/1223)
Jun 01, 2018 2:15:06 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(78/210) took 9253 ms. Total solver calls (SAT/UNSAT): 5351(3485/1866)
Jun 01, 2018 2:15:09 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(96/210) took 12281 ms. Total solver calls (SAT/UNSAT): 6792(4710/2082)
Skipping mayMatrices nes/nds SMT solver raised an exception on push().
java.lang.RuntimeException: SMT solver raised an exception on push().
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:464)
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)
Jun 01, 2018 2:15:11 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 22287ms 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="SharedMemory-PT-000010"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstoolsl"
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/SharedMemory-PT-000010.tgz
mv SharedMemory-PT-000010 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 itstoolsl"
echo " Input is SharedMemory-PT-000010, 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 r213-smll-152732264600569"
echo "====================================================================="
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 '
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 ;