About the Execution of ITS-Tools for IBM5964-PT-none
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15750.810 | 6673.00 | 13102.00 | 426.30 | FFFFFFTFFFFTFFFF | 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 372K
-rw-r--r-- 1 mcc users 6.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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 3.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 5.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 171K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is IBM5964-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-smll-152732263100314
=====================================================================
--------------------
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 IBM5964-PT-none-LTLFireability-00
FORMULA_NAME IBM5964-PT-none-LTLFireability-01
FORMULA_NAME IBM5964-PT-none-LTLFireability-02
FORMULA_NAME IBM5964-PT-none-LTLFireability-03
FORMULA_NAME IBM5964-PT-none-LTLFireability-04
FORMULA_NAME IBM5964-PT-none-LTLFireability-05
FORMULA_NAME IBM5964-PT-none-LTLFireability-06
FORMULA_NAME IBM5964-PT-none-LTLFireability-07
FORMULA_NAME IBM5964-PT-none-LTLFireability-08
FORMULA_NAME IBM5964-PT-none-LTLFireability-09
FORMULA_NAME IBM5964-PT-none-LTLFireability-10
FORMULA_NAME IBM5964-PT-none-LTLFireability-11
FORMULA_NAME IBM5964-PT-none-LTLFireability-12
FORMULA_NAME IBM5964-PT-none-LTLFireability-13
FORMULA_NAME IBM5964-PT-none-LTLFireability-14
FORMULA_NAME IBM5964-PT-none-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1527959554925
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 : !(("(((callToTask_s00002190_output_s00000938>=1)&&(callToTask_s00002190_output_s00000956>=1))&&(callToTask_s00002190_output_s00000979>=1))"))
Formula 0 simplified : !"(((callToTask_s00002190_output_s00000938>=1)&&(callToTask_s00002190_output_s00000956>=1))&&(callToTask_s00002190_output_s00000979>=1))"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 139 rows 263 cols
invariant :callToTask_s00002189_output_s00000960 + -1'callToTask_s00002189_output_s00000938 = 0
invariant :merge_s00001290_input_s00001009 + fork_s00001537_activated_s00000991 + process_s00000383__s00005964_input_s00001512 + -1'process_s00000383__s00005964_input_s00001431 = 0
invariant :callToProcess_s00005925_output_s00000956 + -1'callToProcess_s00005925_output_s00000959 = 0
invariant :callToTask_s00002741_output_s00000956 + -1'callToTask_s00002741_output_s00000979 = 0
invariant :callToTask_s00005965_input_s00000950 + -1'callToTask_s00005965_input_s00000952 = 0
invariant :callToTask_s00005968_input_s00000935 + -1'callToTask_s00005968_input_s00000952 = 0
invariant :merge_s00001291_input_s00000987 + -1'merge_s00001291_input_s00000950 = 0
invariant :3'alpha + merge_s00001290_activated + merge_s00001292_activated + callToTask_s00005897_inputCriterion_s00000937_used + merge_s00001290_input_s00000952 + merge_s00001290_input_s00000935 + merge_s00001292_input_s00000952 + merge_s00001292_input_s00000935 + merge_s00001292_input_s00000986 + decision_s00001616_activated + -2'process_s00000383__s00005964_input_s00001609 + callToTask_s00005897_input_s00000986 + callToTask_s00005897_output_s00000979 + callToProcess_s00002538_input_s00000952 + process_s00000383__s00005964_input_s00001512 + process_s00000383__s00005964_input_s00001431 + callToProcess_s00005925_input_s00000986 + fork_s00001537_activated_s00000993 + callToProcess_s00005925_output_s00000959 + callToProcess_s00005925_inputCriterion_s00000937_used = 3
invariant :callToTask_s00005968_input_s00000950 + -1'callToTask_s00005968_input_s00000952 = 0
invariant :callToTask_s00002526_output_s00000981 + -1'callToTask_s00002526_output_s00000938 = 0
invariant :callToTask_s00001971_input_s00000985 + -1'callToTask_s00001971_input_s00000952 = 0
invariant :callToProcess_s00001273_output_s00000938 + -1'callToProcess_s00001273_output_s00000956 + process_s00000383__s00005964_outputCriterion_s00000939_omega = 0
invariant :callToTask_s00005967_output_s00000956 + -1'callToTask_s00005967_output_s00000979 = 0
invariant :callToTask_s00005972_input_s00000935 + -1'callToTask_s00005972_input_s00000950 = 0
invariant :callToTask_s00001746_input_s00000987 + -1'callToTask_s00001746_input_s00000952 = 0
invariant :join_s00001295_activated_s00000946 + fork_s00001293_activated_s00000991 + -1'join_s00001295_activated_s00000948 + -1'fork_s00001293_activated_s00000993 + -1'join_s00001295_input_s00000985 + join_s00001295_input_s00000935 = 0
invariant :callToTask_s00005970_output_s00000981 + -1'callToTask_s00005970_output_s00000979 = 0
invariant :callToProcess_s00002411_output_s00000956 + -1'callToProcess_s00002411_output_s00000938 = 0
invariant :callToTask_s00005969_output_s00000938 + -1'callToTask_s00005969_output_s00000959 = 0
invariant :callToTask_s00001632_output_s00000959 + -1'callToTask_s00001632_output_s00000979 = 0
invariant :callToTask_s00002741_inputCriterion_s00000937_used + -1'join_s00001294_activated_s00000946 + -1'fork_s00001536_activated_s00000991 + join_s00001294_activated_s00000948 + fork_s00001536_activated_s00000993 + callToTask_s00002741_output_s00000979 + callToTask_s00002741_input_s00000985 + -1'callToProcess_s00002411_input_s00000985 + -1'callToProcess_s00002411_output_s00000938 + -1'callToProcess_s00002411_inputCriterion_s00000937_used = 0
invariant :callToProcess_s00002538_output_s00000961 + -1'callToProcess_s00002538_output_s00000938 = 0
invariant :callToTask_s00002741_input_s00000935 + -1'callToTask_s00002741_input_s00000985 = 0
invariant :callToTask_s00002427_input_s00000952 + -1'callToTask_s00002427_input_s00000950 = 0
invariant :join_s00001295_input_s00000952 + -1'join_s00001295_input_s00000935 = 0
invariant :callToTask_s00005967_input_s00000935 + -1'callToTask_s00005967_input_s00000952 = 0
invariant :callToTask_s00001971_input_s00000935 + -1'callToTask_s00001971_input_s00000952 = 0
invariant :callToTask_s00002186_input_s00000950 + -1'callToTask_s00002186_input_s00001012 = 0
invariant :-1'alpha + 2'callToTask_s00002427_inputCriterion_s00000937_used + decision_s00000989_activated + 2'join_s00001294_activated_s00000946 + 2'fork_s00001536_activated_s00000991 + endNode_s00000942_input_default + callToTask_s00002427_input_s00001013 + -2'process_s00000383__s00005964_input_s00000936 + process_s00000383__s00005964_input_s00001609 + 2'callToTask_s00002427_output_s00000979 + 2'callToTask_s00001971_input_s00000952 + 2'callToProcess_s00002411_input_s00000985 + callToTask_s00002427_input_s00000950 + 2'callToProcess_s00002411_output_s00000938 + callToProcess_s00002538_output_s00000938 + 2'callToProcess_s00002411_inputCriterion_s00000937_used + callToProcess_s00002538_inputCriterion_s00000937_used = -1
invariant :callToProcess_s00002411_input_s00000935 + -1'callToProcess_s00002411_input_s00000985 = 0
invariant :callToProcess_s00005925_input_s00000952 + -1'callToProcess_s00005925_input_s00000986 = 0
invariant :callToProcess_s00002538_input_s00001011 + -1'callToProcess_s00002538_input_s00000952 = 0
invariant :merge_s00001290_input_s00000950 + -1'process_s00000383__s00005964_input_s00001431 = 0
invariant :merge_s00001292_input_s00000950 + -1'merge_s00001292_input_s00000986 + -1'process_s00000383__s00005964_input_s00001512 + -1'fork_s00001537_activated_s00000993 = 0
invariant :callToTask_s00001632_output_s00000938 + -1'callToTask_s00001632_output_s00000979 = 0
invariant :callToTask_s00005969_output_s00000960 + -1'callToTask_s00005969_output_s00000959 = 0
invariant :join_s00001295_input_s00000987 + -1'join_s00001295_input_s00000985 = 0
invariant :callToTask_s00001746_output_s00000960 + -1'callToTask_s00001746_output_s00000938 = 0
invariant :callToTask_s00002183_output_s00000981 + -1'callToTask_s00002183_output_s00000938 = 0
invariant :callToTask_s00005972_input_s00001009 + -1'callToTask_s00005972_input_s00000950 = 0
invariant :callToProcess_s00004075_input_s00000935 + -1'callToProcess_s00004075_input_s00000986 = 0
invariant :callToTask_s00005970_output_s00000938 + -1'callToTask_s00005970_output_s00000979 = 0
invariant :callToTask_s00005971_output_s00000956 + -1'callToTask_s00005971_output_s00000959 = 0
invariant :callToProcess_s00002411_output_s00000981 + -1'callToProcess_s00002411_output_s00000938 = 0
invariant :callToTask_s00005970_output_s00000956 + -1'callToTask_s00005970_output_s00000979 = 0
invariant :join_s00001295_input_s00000986 + -1'join_s00001295_input_s00000935 = 0
invariant :merge_s00001120_input_s00001011 + -1'merge_s00001120_input_s00000935 = 0
invariant :callToTask_s00005966_output_s00000956 + -1'callToTask_s00005966_output_s00000979 = 0
invariant :callToProcess_s00002316_output_s00000938 + -1'callToProcess_s00002316_output_s00000959 = 0
invariant :merge_s00001120_input_s00001010 + -1'merge_s00001120_input_s00001013 = 0
invariant :callToTask_s00002427_output_s00000938 + -1'callToTask_s00002427_output_s00000979 = 0
invariant :callToTask_s00002526_input_s00000986 + -1'callToTask_s00002526_input_s00000935 = 0
invariant :merge_s00001120_input_s00000988 + -1'merge_s00001120_input_s00000935 = 0
invariant :merge_s00001291_input_s00000952 + -1'merge_s00001291_input_s00000935 = 0
invariant :callToTask_s00001632_output_s00000956 + -1'callToTask_s00001632_output_s00000979 = 0
invariant :callToTask_s00001971_input_s00000950 + -1'callToTask_s00001971_input_s00000952 = 0
invariant :merge_s00001120_input_s00000987 + -1'merge_s00001120_input_s00001013 = 0
invariant :join_s00001295_input_s00000950 + -1'join_s00001295_input_s00000985 = 0
invariant :callToTask_s00002186_output_s00000938 + -1'callToTask_s00002186_output_s00000979 = 0
invariant :callToTask_s00002185_input_s00000950 + -1'callToTask_s00002185_input_s00000952 = 0
invariant :callToTask_s00005970_input_s00000950 + -1'callToTask_s00005970_input_s00000952 = 0
invariant :callToTask_s00002526_output_s00000956 + -1'callToTask_s00002526_output_s00000938 = 0
invariant :callToTask_s00002741_output_s00000981 + -1'callToTask_s00002741_output_s00000979 = 0
invariant :merge_s00000945_input_s00000952 + -1'merge_s00000945_input_s00000935 = 0
invariant :callToTask_s00002427_input_s00001203 + -1'callToTask_s00002427_input_s00000950 = 0
invariant :callToTask_s00001305_input_s00000935 + -1'callToTask_s00001305_input_s00000950 = 0
invariant :callToProcess_s00005925_input_s00000985 + -1'callToProcess_s00005925_input_s00000986 = 0
invariant :merge_s00003354_activated + -1'callToTask_s00005968_output_s00000979 + callToTask_s00005968_output_s00000938 + -1'callToTask_s00005972_output_s00000979 + callToTask_s00005972_output_s00000938 + callToTask_s00002185_output_s00000938 + -1'callToTask_s00002185_output_s00000956 + process_s00000383__s00005964_output_s00001610 + process_s00000383__s00005964_outputCriterion_s00000939_omega = 0
invariant :merge_s00001291_input_s00001009 + -1'merge_s00001291_input_s00000950 = 0
invariant :callToTask_s00005897_output_s00000938 + -1'callToTask_s00005897_output_s00000979 = 0
invariant :callToTask_s00002186_input_s00001513 + -1'callToTask_s00002186_input_s00001012 = 0
invariant :callToProcess_s00002538_output_s00000956 + -1'callToProcess_s00002538_output_s00000938 = 0
invariant :callToTask_s00005971_output_s00000938 + -1'callToTask_s00005971_output_s00000959 = 0
invariant :callToTask_s00005849_input_s00000985 + -1'callToTask_s00005849_input_s00000952 = 0
invariant :callToTask_s00002185_input_s00000935 + -1'callToTask_s00002185_input_s00000952 = 0
invariant :merge_s00001066_input_s00000987 + -1'merge_s00001066_input_s00000985 = 0
invariant :callToProcess_s00004075_output_s00000956 + -1'callToProcess_s00004075_output_s00000938 + -1'process_s00000383__s00005964_outputCriterion_s00000939_omega = 0
invariant :callToProcess_s00004075_input_s00000950 + -1'callToProcess_s00004075_input_s00000986 = 0
invariant :callToTask_s00005970_input_s00000935 + -1'callToTask_s00005970_input_s00000952 = 0
invariant :merge_s00001120_input_s00001012 + -1'merge_s00001120_input_s00001513 = 0
invariant :callToTask_s00002181_output_s00000938 + -1'callToTask_s00002181_output_s00000979 = 0
invariant :callToTask_s00005969_input_s00000985 + -1'callToTask_s00005969_input_s00000935 = 0
invariant :alpha + merge_s00001120_activated + merge_s00001291_activated + merge_s00001066_activated + merge_s00000945_activated + callToProcess_s00002316_inputCriterion_s00000937_used + callToTask_s00005969_inputCriterion_s00000937_used + callToTask_s00005968_inputCriterion_s00000937_used + callToTask_s00005967_inputCriterion_s00000937_used + callToTask_s00005849_inputCriterion_s00000937_used + callToTask_s00005966_inputCriterion_s00000937_used + callToTask_s00005965_inputCriterion_s00000937_used + callToTask_s00005972_inputCriterion_s00000937_used + callToTask_s00005971_inputCriterion_s00000937_used + callToTask_s00005970_inputCriterion_s00000937_used + callToTask_s00002189_inputCriterion_s00000937_used + callToTask_s00001746_inputCriterion_s00000937_used + callToTask_s00001971_inputCriterion_s00000937_used + callToTask_s00002186_inputCriterion_s00000937_used + callToTask_s00002185_inputCriterion_s00000937_used + callToTask_s00002526_inputCriterion_s00000937_used + callToTask_s00002183_inputCriterion_s00000937_used + callToTask_s00001632_inputCriterion_s00000937_used + callToTask_s00002181_inputCriterion_s00000937_used + callToTask_s00002190_inputCriterion_s00000937_used + decision_s00001615_activated + decision_s00001617_activated + decision_s00001286_activated + decision_s00001287_activated + decision_s00001288_activated + decision_s00001289_activated + decision_s00000999_activated + fork_s00001067_activated_s00000991 + join_s00001295_activated_s00000948 + process_s00000383__s00005964_input_s00000936 + callToTask_s00005968_output_s00000979 + callToTask_s00005972_output_s00000979 + callToTask_s00005965_output_s00000956 + callToTask_s00002185_output_s00000956 + callToTask_s00005969_input_s00000935 + callToTask_s00002183_output_s00000938 + callToTask_s00002526_output_s00000938 + callToTask_s00005968_input_s00000952 + callToTask_s00005967_input_s00000952 + callToTask_s00005849_input_s00000952 + callToTask_s00002190_output_s00000979 + callToTask_s00002181_output_s00000979 + callToTask_s00001632_output_s00000979 + callToTask_s00001746_output_s00000938 + callToTask_s00002189_output_s00000938 + callToTask_s00005965_input_s00000952 + callToTask_s00002186_output_s00000979 + callToTask_s00001971_output_s00000979 + callToTask_s00005971_output_s00000959 + callToTask_s00005970_output_s00000979 + callToTask_s00005970_input_s00000952 + callToTask_s00005972_input_s00000950 + callToTask_s00005849_output_s00000959 + callToTask_s00005966_output_s00000979 + callToTask_s00005969_output_s00000959 + callToTask_s00005967_output_s00000979 + callToTask_s00001746_input_s00000952 + callToTask_s00002185_input_s00000952 + callToTask_s00002526_input_s00000935 + callToProcess_s00004075_input_s00000986 + callToTask_s00002186_input_s00001012 + callToProcess_s00002316_output_s00000959 + callToProcess_s00004075_output_s00000938 + fork_s00001293_activated_s00000993 + merge_s00000945_input_s00000985 + merge_s00000945_input_s00000935 + merge_s00001066_input_s00000985 + merge_s00001291_input_s00000935 + merge_s00001291_input_s00000950 + merge_s00001120_input_s00000935 + merge_s00001120_input_s00001513 + merge_s00001120_input_s00001013 + join_s00001295_input_s00000985 + fork_s00001293_input_s00000952 + fork_s00001067_input_s00000952 + callToProcess_s00004075_inputCriterion_s00000937_used + process_s00000383__s00005964_outputCriterion_s00000939_omega = 1
invariant :callToTask_s00005967_output_s00000938 + -1'callToTask_s00005967_output_s00000979 = 0
invariant :callToTask_s00005972_input_s00000952 + -1'callToTask_s00005972_input_s00000950 = 0
invariant :callToTask_s00002183_output_s00000962 + -1'callToTask_s00002183_output_s00000938 = 0
invariant :callToTask_s00005965_input_s00000935 + -1'callToTask_s00005965_input_s00000952 = 0
invariant :merge_s00001120_input_s00000952 + -1'merge_s00001120_input_s00001013 = 0
invariant :callToTask_s00001971_output_s00000938 + -1'callToTask_s00001971_output_s00000979 = 0
invariant :callToTask_s00005966_output_s00000938 + -1'callToTask_s00005966_output_s00000979 = 0
invariant :callToTask_s00001746_input_s00000935 + -1'callToTask_s00001746_input_s00000952 = 0
invariant :merge_s00000945_input_s00000950 + -1'merge_s00000945_input_s00000985 = 0
invariant :callToTask_s00002190_output_s00000956 + -1'callToTask_s00002190_output_s00000979 = 0
invariant :callToTask_s00002183_output_s00000956 + -1'callToTask_s00002183_output_s00000938 = 0
invariant :callToProcess_s00002411_input_s00000950 + -1'callToProcess_s00002411_input_s00000985 = 0
invariant :callToProcess_s00002538_input_s00000950 + -1'callToProcess_s00002538_input_s00000952 = 0
invariant :callToTask_s00001305_input_s00001009 + -1'callToTask_s00001305_input_s00000950 = 0
invariant :callToTask_s00001746_output_s00000956 + -1'callToTask_s00001746_output_s00000938 = 0
invariant :callToTask_s00002190_output_s00000938 + -1'callToTask_s00002190_output_s00000979 = 0
invariant :fork_s00001293_input_s00000950 + -1'fork_s00001293_input_s00000952 = 0
invariant :callToTask_s00005967_input_s00000950 + -1'callToTask_s00005967_input_s00000952 = 0
invariant :fork_s00001067_input_s00000950 + -1'fork_s00001067_input_s00000952 = 0
invariant :callToTask_s00005897_input_s00000950 + -1'callToTask_s00005897_input_s00000986 = 0
invariant :callToProcess_s00005925_output_s00000938 + -1'callToProcess_s00005925_output_s00000959 = 0
invariant :callToTask_s00005849_output_s00000960 + -1'callToTask_s00005849_output_s00000959 = 0
invariant :merge_s00001066_input_s00000950 + -1'merge_s00001066_input_s00000985 = 0
invariant :merge_s00001369_activated + -1'callToTask_s00005968_output_s00000979 + callToTask_s00005968_output_s00000956 + callToTask_s00005965_output_s00000938 + -1'callToTask_s00005965_output_s00000956 + process_s00000383__s00005964_output_s00001463 + process_s00000383__s00005964_outputCriterion_s00000939_omega = 0
invariant :merge_s00001120_input_s00000950 + -1'merge_s00001120_input_s00001513 = 0
invariant :callToTask_s00005897_output_s00000956 + -1'callToTask_s00005897_output_s00000979 = 0
invariant :callToTask_s00002526_input_s00000950 + -1'callToTask_s00002526_input_s00000935 = 0
invariant :fork_s00001293_input_s00000935 + -1'fork_s00001293_input_s00000952 = 0
invariant :callToTask_s00002186_output_s00000962 + -1'callToTask_s00002186_output_s00000979 = 0
invariant :callToTask_s00002741_input_s00000986 + -1'callToTask_s00002741_input_s00000985 = 0
invariant :callToTask_s00005849_output_s00000938 + -1'callToTask_s00005849_output_s00000959 = 0
invariant :merge_s00000945_input_s00000986 + -1'merge_s00000945_input_s00000935 = 0
invariant :callToTask_s00002741_output_s00000960 + -1'callToTask_s00002741_output_s00000979 = 0
invariant :callToTask_s00001746_input_s00000950 + -1'callToTask_s00001746_input_s00000952 = 0
invariant :callToTask_s00001971_output_s00000956 + -1'callToTask_s00001971_output_s00000979 = 0
invariant :callToTask_s00005849_input_s00000950 + -1'callToTask_s00005849_input_s00000952 = 0
invariant :fork_s00001067_input_s00000935 + -1'fork_s00001067_input_s00000952 = 0
invariant :callToTask_s00001971_output_s00000981 + -1'callToTask_s00001971_output_s00000979 = 0
invariant :callToTask_s00002186_input_s00000935 + -1'callToTask_s00002186_input_s00001012 = 0
invariant :callToTask_s00005969_input_s00000952 + -1'callToTask_s00005969_input_s00000935 = 0
invariant :merge_s00001291_input_s00000986 + -1'merge_s00001291_input_s00000935 = 0
invariant :callToTask_s00002181_output_s00000956 + -1'callToTask_s00002181_output_s00000979 = 0
invariant :callToTask_s00002186_input_s00001011 + -1'callToTask_s00002186_input_s00001012 = 0
invariant :callToTask_s00002427_output_s00000956 + -1'callToTask_s00002427_output_s00000979 = 0
invariant :merge_s00000945_input_s00000987 + -1'merge_s00000945_input_s00000985 = 0
Reverse transition relation is NOT exact ! Due to transitions merge_s00001292_activate_s00000949, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :114/24/1/139
Computing Next relation with stutter on 10 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
95 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,0.994136,36152,1,0,94,49564,188,110,4336,39819,310
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((X(G("(callToTask_s00005972_output_s00000938>=1)"))))
Formula 1 simplified : !XG"(callToTask_s00005972_output_s00000938>=1)"
Computing Next relation with stutter on 10 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,0.997116,36420,1,0,95,49798,194,111,4338,40082,323
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F(G(G(G(X("(callToTask_s00001971_inputCriterion_s00000937_used>=1)")))))))
Formula 2 simplified : !FGX"(callToTask_s00001971_inputCriterion_s00000937_used>=1)"
Computing Next relation with stutter on 10 deadlock states
44 unique states visited
43 strongly connected components in search stack
45 transitions explored
44 items max in DFS search stack
10 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,1.10711,39704,1,0,95,56116,199,160,4340,79040,575
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X((("(callToTask_s00001971_inputCriterion_s00000937_used>=1)")U("(((((((callToProcess_s00002538_input_s00000950>=1)&&(callToProcess_s00002538_input_s00000952>=1))&&(callToProcess_s00002538_input_s00001011>=1))&&(callToTask_s00005897_output_s00000938>=1))&&(callToTask_s00005897_output_s00000956>=1))&&(callToTask_s00005897_output_s00000979>=1))&&(process_s00000383__s00005964_input_s00001609>=1))"))U(("(decision_s00001616_activated>=1)")U("((join_s00001295_activated_s00000946>=1)&&(join_s00001295_activated_s00000948>=1))")))))
Formula 3 simplified : !X(("(callToTask_s00001971_inputCriterion_s00000937_used>=1)" U "(((((((callToProcess_s00002538_input_s00000950>=1)&&(callToProcess_s00002538_input_s00000952>=1))&&(callToProcess_s00002538_input_s00001011>=1))&&(callToTask_s00005897_output_s00000938>=1))&&(callToTask_s00005897_output_s00000956>=1))&&(callToTask_s00005897_output_s00000979>=1))&&(process_s00000383__s00005964_input_s00001609>=1))") U ("(decision_s00001616_activated>=1)" U "((join_s00001295_activated_s00000946>=1)&&(join_s00001295_activated_s00000948>=1))"))
Computing Next relation with stutter on 10 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,1.1131,41544,1,0,95,56116,232,160,4390,79042,584
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((((G("(((join_s00001295_input_s00000950>=1)&&(join_s00001295_input_s00000985>=1))&&(join_s00001295_input_s00000987>=1))"))U(G("((((callToTask_s00005970_output_s00000938>=1)&&(callToTask_s00005970_output_s00000956>=1))&&(callToTask_s00005970_output_s00000979>=1))&&(callToTask_s00005970_output_s00000981>=1))")))U("(decision_s00001286_activated>=1)")))
Formula 4 simplified : !((G"(((join_s00001295_input_s00000950>=1)&&(join_s00001295_input_s00000985>=1))&&(join_s00001295_input_s00000987>=1))" U G"((((callToTask_s00005970_output_s00000938>=1)&&(callToTask_s00005970_output_s00000956>=1))&&(callToTask_s00005970_output_s00000979>=1))&&(callToTask_s00005970_output_s00000981>=1))") U "(decision_s00001286_activated>=1)")
Computing Next relation with stutter on 10 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,1.119,42104,1,0,95,56116,256,160,4432,79050,594
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X(G("(callToTask_s00001971_inputCriterion_s00000937_used>=1)"))))
Formula 5 simplified : !XG"(callToTask_s00001971_inputCriterion_s00000937_used>=1)"
Computing Next relation with stutter on 10 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,1.11966,42104,1,0,95,56116,259,160,4432,79050,599
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((((G("(((merge_s00001290_input_s00000950>=1)&&(merge_s00001290_input_s00001009>=1))&&(process_s00000383__s00005964_input_s00001431>=1))"))U(F("((((callToTask_s00001746_input_s00000935>=1)&&(callToTask_s00001746_input_s00000950>=1))&&(callToTask_s00001746_input_s00000952>=1))&&(callToTask_s00001746_input_s00000987>=1))")))U((F("(decision_s00001286_activated>=1)"))U(F("(fork_s00001537_activated_s00000991>=1)")))))
Formula 6 simplified : !((G"(((merge_s00001290_input_s00000950>=1)&&(merge_s00001290_input_s00001009>=1))&&(process_s00000383__s00005964_input_s00001431>=1))" U F"((((callToTask_s00001746_input_s00000935>=1)&&(callToTask_s00001746_input_s00000950>=1))&&(callToTask_s00001746_input_s00000952>=1))&&(callToTask_s00001746_input_s00000987>=1))") U (F"(decision_s00001286_activated>=1)" U F"(fork_s00001537_activated_s00000991>=1)"))
Computing Next relation with stutter on 10 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
4 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,1.15959,43212,1,0,219,62737,268,237,4433,90313,857
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(("(merge_s00001290_input_s00000935>=1)"))
Formula 7 simplified : !"(merge_s00001290_input_s00000935>=1)"
Computing Next relation with stutter on 10 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,1.1602,43476,1,0,219,62737,271,237,4434,90313,859
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((F(X(G(F(X("(merge_s00003354_activated>=1)")))))))
Formula 8 simplified : !FXGFX"(merge_s00003354_activated>=1)"
Computing Next relation with stutter on 10 deadlock states
45 unique states visited
45 strongly connected components in search stack
46 transitions explored
45 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,1.16124,43476,1,0,219,62737,280,237,4436,90314,865
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((G(F(X("(callToProcess_s00002538_inputCriterion_s00000937_used>=1)")))))
Formula 9 simplified : !GFX"(callToProcess_s00002538_inputCriterion_s00000937_used>=1)"
Computing Next relation with stutter on 10 deadlock states
45 unique states visited
45 strongly connected components in search stack
46 transitions explored
45 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,1.16202,43476,1,0,219,62737,289,237,4437,90315,871
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((G(G(X(("((((merge_s00001120_input_s00000952>=1)&&(merge_s00001120_input_s00000987>=1))&&(merge_s00001120_input_s00001010>=1))&&(merge_s00001120_input_s00001013>=1))")U("((callToProcess_s00002316_output_s00000938>=1)&&(callToProcess_s00002316_output_s00000959>=1))"))))))
Formula 10 simplified : !GX("((((merge_s00001120_input_s00000952>=1)&&(merge_s00001120_input_s00000987>=1))&&(merge_s00001120_input_s00001010>=1))&&(merge_s00001120_input_s00001013>=1))" U "((callToProcess_s00002316_output_s00000938>=1)&&(callToProcess_s00002316_output_s00000959>=1))")
Computing Next relation with stutter on 10 deadlock states
46 unique states visited
46 strongly connected components in search stack
47 transitions explored
46 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,1.16414,43740,1,0,219,62737,299,237,4460,90321,875
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((F("(((callToProcess_s00005925_output_s00000938>=1)&&(callToProcess_s00005925_output_s00000956>=1))&&(callToProcess_s00005925_output_s00000959>=1))")))
Formula 11 simplified : !F"(((callToProcess_s00005925_output_s00000938>=1)&&(callToProcess_s00005925_output_s00000956>=1))&&(callToProcess_s00005925_output_s00000959>=1))"
Computing Next relation with stutter on 10 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
15 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,1.31087,47948,1,0,318,87808,308,299,4465,116054,1090
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G("(callToTask_s00002181_inputCriterion_s00000937_used>=1)")))
Formula 12 simplified : !G"(callToTask_s00002181_inputCriterion_s00000937_used>=1)"
Computing Next relation with stutter on 10 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,1.31192,48212,1,0,318,87808,314,299,4467,116055,1095
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(("((((callToProcess_s00001273_output_s00000938>=1)&&(callToProcess_s00004075_output_s00000938>=1))&&(process_s00000383__s00005964_output_s00001463>=1))&&(process_s00000383__s00005964_output_s00001610>=1))"))
Formula 13 simplified : !"((((callToProcess_s00001273_output_s00000938>=1)&&(callToProcess_s00004075_output_s00000938>=1))&&(process_s00000383__s00005964_output_s00001463>=1))&&(process_s00000383__s00005964_output_s00001610>=1))"
Computing Next relation with stutter on 10 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,1.31304,48212,1,0,318,87808,317,299,4478,116059,1097
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((G(X((F("((((callToTask_s00002427_input_s00000950>=1)&&(callToTask_s00002427_input_s00000952>=1))&&(callToTask_s00002427_input_s00001013>=1))&&(callToTask_s00002427_input_s00001203>=1))"))U("(callToProcess_s00002316_inputCriterion_s00000937_used>=1)")))))
Formula 14 simplified : !GX(F"((((callToTask_s00002427_input_s00000950>=1)&&(callToTask_s00002427_input_s00000952>=1))&&(callToTask_s00002427_input_s00001013>=1))&&(callToTask_s00002427_input_s00001203>=1))" U "(callToProcess_s00002316_inputCriterion_s00000937_used>=1)")
Computing Next relation with stutter on 10 deadlock states
44 unique states visited
44 strongly connected components in search stack
45 transitions explored
44 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,1.31481,48212,1,0,318,87808,327,299,4489,116064,1102
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !(("(fork_s00001293_activated_s00000993>=1)"))
Formula 15 simplified : !"(fork_s00001293_activated_s00000993>=1)"
Computing Next relation with stutter on 10 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,1.31543,48212,1,0,318,87808,330,299,4491,116065,1104
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA IBM5964-PT-none-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
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 1527959561598
--------------------
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
Jun 02, 2018 5:12:37 PM 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]
Jun 02, 2018 5:12:38 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 5:12:38 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 124 ms
Jun 02, 2018 5:12:38 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 263 places.
Jun 02, 2018 5:12:38 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 139 transitions.
Jun 02, 2018 5:12:38 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 25 ms
Jun 02, 2018 5:12:38 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 124 ms
Jun 02, 2018 5:12:38 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 10 ms
Jun 02, 2018 5:12:38 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 02, 2018 5:12:39 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 139 transitions.
Jun 02, 2018 5:12:39 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 128 place invariants in 140 ms
Jun 02, 2018 5:12:40 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 263 variables to be positive in 885 ms
Jun 02, 2018 5:12:40 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 139 transitions.
Jun 02, 2018 5:12:40 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/139 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 5:12:40 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 5:12:40 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 139 transitions.
Jun 02, 2018 5:12:40 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 5:12:40 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (>= (select s0 58) 1) (= (store (store (store (store (store s0 246 (+ (select s0 246) 1)) 249 (+ (select s0 249) 1)) 58 (- (select s0 58) 1)) 243 (+ (select s0 243) 1)) 21 (+ (select s0 21) 1)) s1))) with error
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:755)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
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 02, 2018 5:12:40 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1512ms 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="IBM5964-PT-none"
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/IBM5964-PT-none.tgz
mv IBM5964-PT-none 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 IBM5964-PT-none, 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 r212-smll-152732263100314"
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 '
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 ;