About the Execution of ITS-LoLa for BridgeAndVehicles-COL-V80P50N10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15743.160 | 3600000.00 | 151046.00 | 135.50 | FFTFTF?FFTFTFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r182-oct2-158987913600270.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BridgeAndVehicles-COL-V80P50N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913600270
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 3.6K Mar 26 02:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 22:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 22:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 25 17:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 25 17:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Mar 25 14:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 25 14:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 45K Mar 24 05:37 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1591140486413
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 23:28:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 23:28:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 23:28:08] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-02 23:28:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 584 ms
[2020-06-02 23:28:09] [INFO ] sort/places :
sens->CONTROLEUR,CHOIX,VIDANGE,
compteur->COMPTEUR,
Dot->CAPACITE,SORTI_A,ROUTE_A,ATTENTE_A,SUR_PONT_A,SUR_PONT_B,ATTENTE_B,ROUTE_B,SORTI_B,
voitureA->NB_ATTENTE_A,
voitureB->NB_ATTENTE_B,
[2020-06-02 23:28:09] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 188 PT places and 289218.0 transition bindings in 20 ms.
[2020-06-02 23:28:09] [INFO ] Computed order based on color domains.
[2020-06-02 23:28:09] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions in 63 ms.
[2020-06-02 23:28:09] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 168 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 14 resets, run finished after 181 ms. (steps per millisecond=55 ) properties seen :[1, 0, 0, 0, 0, 0, 1, 0, 1, 1]
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 1, 0]
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0]
[2020-06-02 23:28:09] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2020-06-02 23:28:09] [INFO ] Computed 7 place invariants in 18 ms
[2020-06-02 23:28:10] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned unsat
[2020-06-02 23:28:10] [INFO ] [Real]Absence check using 7 positive place invariants in 54 ms returned unsat
[2020-06-02 23:28:10] [INFO ] [Real]Absence check using 7 positive place invariants in 23 ms returned sat
[2020-06-02 23:28:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:28:10] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2020-06-02 23:28:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:28:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2020-06-02 23:28:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:28:10] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2020-06-02 23:28:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-02 23:28:10] [INFO ] [Nat]Added 22 Read/Feed constraints in 76 ms returned sat
[2020-06-02 23:28:11] [INFO ] Deduced a trap composed of 5 places in 817 ms
[2020-06-02 23:28:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1005 ms
[2020-06-02 23:28:12] [INFO ] Computed and/alt/rep : 2105/40609/367 causal constraints in 118 ms.
[2020-06-02 23:28:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t109 0) (and (or (and (> t110 0) (< o110 o109)) (and (> t192 0) (< o192 o109))) (or (and (> t165 0) (< o165 o109)) (and (> t166 0) (< o166 o109)) (and (> t167 0) (< o167 o109)) (and (> t168 0) (< o168 o109)) (and (> t169 0) (< o169 o109)) (and (> t170 0) (< o170 o109)) (and (> t171 0) (< o171 o109)) (and (> t172 0) (< o172 o109)) (and (> t173 0) (< o173 o109)) (and (> t174 0) (< o174 o109)) (and (> t175 0) (< o175 o109)) (and (> t176 0) (< o176 o109)) (and (> t177 0) (< o177 o109)) (and (> t178 0) (< o178 o109)) (and (> t179 0) (< o179 o109)) (and (> t180 0) (< o180 o109)) (and (> t181 0) (< o181 o109)) (and (> t182 0) (< o182 o109)) (and (> t183 0) (< o183 o109)) (and (> t184 0) (< o184 o109)) (and (> t185 0) (< o185 o109)) (and (> t186 0) (< o186 o109)) (and (> t187 0) (< o187 o109)) (and (> t188 0) (< o188 o109)) (and (> t189 0) (< o189 o109)) (and (> t190 0) (< o190 o109)) (and (> t191 0) (< o191 o109)) (and (> t192 0) (< o192 o109)) (and (> t193 0) (< o193 o109)) (and (> t194 0) (< o194 o109)) (and (> t195 0) (< o195 o109)) (and (> t196 0) (< o196 o109)) (and (> t197 0) (< o197 o109)) (and (> t198 0) (< o198 o109)) (and (> t199 0) (< o199 o109)) (and (> t200 0) (< o200 o109)) (and (> t201 0) (< o201 o109)) (and (> t202 0) (< o202 o109)) (and (> t203 0) (< o203 o109)) (and (> t204 0) (< o204 o109)) (and (> t205 0) (< o205 o109)) (and (> t206 0) (< o206 o109)) (and (> t207 0) (< o207 o109)) (and (> t208 0) (< o208 o109)) (and (> t209 0) (< o209 o109)) (and (> t210 0) (< o210 o109)) (and (> t211 0) (< o211 o109)) (and (> t212 0) (< o212 o109)) (and (> t213 0) (< o213 o109)) (and (> t214 0) (< o214 o109)) (and (> t215 0) (< o215 o109)) (and (> t216 0) (< o216 o109)) (and (> t217 0) (< o217 o109)) (and (> t218 0) (< o218 o109)) (and (> t219 0) (< o219 o109)) (and (> t220 0) (< o220 o109)) (and (> t221 0) (< o221 o109)) (and (> t222 0) (< o222 o109)) (and (> t223 0) (< o223 o109)) (and (> t224 0) (< o224 o109)) (and (> t225 0) (< o225 o109)) (and (> t226 0) (< o226 o109)) (and (> t227 0) (< o227 o109)) (and (> t228 0) (< o228 o109)) (and (> t229 0) (< o229 o109)) (and (> t230 0) (< o230 o109)) (and (> t231 0) (< o231 o109)) (and (> t232 0) (< o232 o109)) (and (> t233 0) (< o233 o109)) (and (> t234 0) (< o234 o109)) (and (> t235 0) (< o235 o109)) (and (> t236 0) (< o236 o109)) (and (> t237 0) (< o237 o109)) (and (> t238 0) (< o238 o109)) (and (> t239 0) (< o239 o109)) (and (> t240 0) (< o240 o109)) (and (> t241 0) (< o241 o109)) (and (> t242 0) (< o242 o109)) (and (> t243 0) (< o243 o109)) (and (> t244 0) (< o244 o109)) (and (> t245 0) (< o245 o109))) (or (and (> t256 0) (< o256 o109)) (and (> t257 0) (< o257 o109)) (and (> t258 0) (< o258 o109)) (and (> t259 0) (< o259 o109)) (and (> t260 0) (< o260 o109)) (and (> t261 0) (< o261 o109)) (and (> t262 0) (< o262 o109)) (and (> t263 0) (< o263 o109)) (and (> t264 0) (< o264 o109)) (and (> t265 0) (< o265 o109)))))") while checking expression at index 2
[2020-06-02 23:28:15] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-02 23:28:15] [INFO ] [Real]Absence check using 7 positive place invariants in 17 ms returned unsat
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 188/188 places, 2108/2108 transitions.
Discarding 2 places :
Also discarding 0 output transitions
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.27 ms
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 186 transition count 2108
Deduced a syphon composed of 1 places in 25 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 2107
Applied a total of 4 rules in 371 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2020-06-02 23:28:16] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2020-06-02 23:28:16] [INFO ] Computed 5 place invariants in 3 ms
[2020-06-02 23:28:17] [INFO ] Dead Transitions using invariants and state equation in 1267 ms returned []
Finished structural reductions, in 1 iterations. Remains : 185/188 places, 2107/2108 transitions.
Incomplete random walk after 1000000 steps, including 1423 resets, run finished after 5232 ms. (steps per millisecond=191 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 546 resets, run finished after 1862 ms. (steps per millisecond=537 ) properties seen :[0]
Interrupted probabilistic random walk after 5602466 steps, run timeout after 30001 ms. (steps per millisecond=186 ) properties seen :[0]
Probabilistic random walk after 5602466 steps, saw 1503207 distinct states, run finished after 30001 ms. (steps per millisecond=186 ) properties seen :[0]
[2020-06-02 23:28:54] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2020-06-02 23:28:54] [INFO ] Computed 5 place invariants in 5 ms
[2020-06-02 23:28:54] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-02 23:28:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:28:54] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2020-06-02 23:28:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:28:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-06-02 23:28:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:28:54] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2020-06-02 23:28:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-02 23:28:55] [INFO ] [Nat]Added 22 Read/Feed constraints in 207 ms returned sat
[2020-06-02 23:28:55] [INFO ] Deduced a trap composed of 5 places in 159 ms
[2020-06-02 23:28:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2020-06-02 23:28:55] [INFO ] Computed and/alt/rep : 2104/40609/366 causal constraints in 59 ms.
[2020-06-02 23:29:17] [INFO ] Added : 265 causal constraints over 53 iterations in 21905 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 192 ms.
Incomplete Parikh walk after 50400 steps, including 724 resets, run finished after 239 ms. (steps per millisecond=210 ) properties seen :[0] could not realise parikh vector
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 229 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 185/185 places, 2107/2107 transitions.
Starting structural reductions, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 387 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2020-06-02 23:29:18] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2020-06-02 23:29:18] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 23:29:18] [INFO ] Implicit Places using invariants in 515 ms returned []
[2020-06-02 23:29:18] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2020-06-02 23:29:18] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 23:29:19] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-02 23:29:20] [INFO ] Implicit Places using invariants and state equation in 1752 ms returned []
Implicit Place search using SMT with State Equation took 2293 ms to find 0 implicit places.
[2020-06-02 23:29:20] [INFO ] Redundant transitions in 98 ms returned []
[2020-06-02 23:29:20] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2020-06-02 23:29:20] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 23:29:22] [INFO ] Dead Transitions using invariants and state equation in 1386 ms returned []
Finished structural reductions, in 1 iterations. Remains : 185/185 places, 2107/2107 transitions.
Incomplete random walk after 100001 steps, including 142 resets, run finished after 498 ms. (steps per millisecond=200 ) properties seen :[0]
[2020-06-02 23:29:22] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2020-06-02 23:29:22] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 23:29:22] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-06-02 23:29:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:29:22] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2020-06-02 23:29:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:29:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-06-02 23:29:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:29:23] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2020-06-02 23:29:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-02 23:29:23] [INFO ] [Nat]Added 22 Read/Feed constraints in 199 ms returned sat
[2020-06-02 23:29:23] [INFO ] Deduced a trap composed of 5 places in 213 ms
[2020-06-02 23:29:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2020-06-02 23:29:23] [INFO ] Computed and/alt/rep : 2104/40609/366 causal constraints in 44 ms.
[2020-06-02 23:29:42] [INFO ] Added : 265 causal constraints over 53 iterations in 19398 ms. Result :(error "Solver has unexpectedly terminated")
Ensure Unique test removed 1738 transitions
Reduce isomorphic transitions removed 1738 transitions.
Iterating post reduction 0 with 1738 rules applied. Total rules applied 1738 place count 185 transition count 369
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1742 place count 183 transition count 367
Applied a total of 1742 rules in 17 ms. Remains 183 /185 variables (removed 2) and now considering 367/2107 (removed 1740) transitions.
// Phase 1: matrix 367 rows 183 cols
[2020-06-02 23:29:42] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 23:29:43] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-06-02 23:29:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:29:43] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2020-06-02 23:29:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:29:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 54 ms returned sat
[2020-06-02 23:29:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:29:43] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2020-06-02 23:29:43] [INFO ] Computed and/alt/rep : 364/16668/364 causal constraints in 25 ms.
[2020-06-02 23:30:03] [INFO ] Added : 300 causal constraints over 60 iterations in 20540 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 244 ms.
[2020-06-02 23:30:04] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 1 ms.
[2020-06-02 23:30:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 21 ms.
[2020-06-02 23:30:04] [INFO ] Flatten gal took : 158 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ BridgeAndVehicles-COL-V80P50N10 @ 3570 seconds
vrfy: finished
info: timeLeft: 3562
rslt: Output for ReachabilityCardinality @ BridgeAndVehicles-COL-V80P50N10
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 23:30:04 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 72888,
"runtime": 8.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((2 <= p0) OR ((p82 <= 1) AND (3 <= p83)))))",
"processed_size": 51,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 15946,
"conflict_clusters": 2,
"places": 185,
"places_significant": 180,
"singleton_clusters": 0,
"transitions": 2107
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2292/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5920
lola: finding significant places
lola: 185 places, 2107 transitions, 180 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: A (G (((2 <= p0) OR ((p82 <= 1) AND (3 <= p83)))))
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((2 <= p0) OR ((p82 <= 1) AND (3 <= p83)))))
lola: processed formula length: 51
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p0 <= 1) AND ((2 <= p82) OR (p83 <= 2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: local time limit reached - aborting
lola: memory consumption: 72888 KB
lola: time consumption: 8 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
rslt: finished
--------------------
content from stderr:
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="BridgeAndVehicles-COL-V80P50N10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
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
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is BridgeAndVehicles-COL-V80P50N10, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987913600270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V80P50N10.tgz
mv BridgeAndVehicles-COL-V80P50N10 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;