Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813695000667.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CANConstruction-PT-070, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695000667
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.8M
-rw-r--r-- 1 mcc users 11K Feb 25 22:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 22:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 21:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 21:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 25 22:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 22:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 22:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 7.3M Mar 5 18:22 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 CANConstruction-PT-070-LTLCardinality-00
FORMULA_NAME CANConstruction-PT-070-LTLCardinality-01
FORMULA_NAME CANConstruction-PT-070-LTLCardinality-02
FORMULA_NAME CANConstruction-PT-070-LTLCardinality-03
FORMULA_NAME CANConstruction-PT-070-LTLCardinality-04
FORMULA_NAME CANConstruction-PT-070-LTLCardinality-05
FORMULA_NAME CANConstruction-PT-070-LTLCardinality-06
FORMULA_NAME CANConstruction-PT-070-LTLCardinality-07
FORMULA_NAME CANConstruction-PT-070-LTLCardinality-08
FORMULA_NAME CANConstruction-PT-070-LTLCardinality-09
FORMULA_NAME CANConstruction-PT-070-LTLCardinality-10
FORMULA_NAME CANConstruction-PT-070-LTLCardinality-11
FORMULA_NAME CANConstruction-PT-070-LTLCardinality-12
FORMULA_NAME CANConstruction-PT-070-LTLCardinality-13
FORMULA_NAME CANConstruction-PT-070-LTLCardinality-14
FORMULA_NAME CANConstruction-PT-070-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678655085496

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-070
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 21:04:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 21:04:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 21:04:47] [INFO ] Load time of PNML (sax parser for PT used): 378 ms
[2023-03-12 21:04:47] [INFO ] Transformed 10642 places.
[2023-03-12 21:04:47] [INFO ] Transformed 20160 transitions.
[2023-03-12 21:04:47] [INFO ] Parsed PT model containing 10642 places and 20160 transitions and 60200 arcs in 522 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANConstruction-PT-070-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-070-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 out of 10642 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10642/10642 places, 20160/20160 transitions.
Discarding 4734 places :
Symmetric choice reduction at 0 with 4734 rule applications. Total rules 4734 place count 5908 transition count 10692
Iterating global reduction 0 with 4734 rules applied. Total rules applied 9468 place count 5908 transition count 10692
Applied a total of 9468 rules in 2501 ms. Remains 5908 /10642 variables (removed 4734) and now considering 10692/20160 (removed 9468) transitions.
// Phase 1: matrix 10692 rows 5908 cols
[2023-03-12 21:04:50] [INFO ] Computed 141 place invariants in 232 ms
[2023-03-12 21:04:54] [INFO ] Implicit Places using invariants in 4145 ms returned []
Implicit Place search using SMT only with invariants took 4183 ms to find 0 implicit places.
[2023-03-12 21:04:54] [INFO ] Invariant cache hit.
[2023-03-12 21:05:00] [INFO ] Dead Transitions using invariants and state equation in 6014 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5908/10642 places, 10692/20160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12705 ms. Remains : 5908/10642 places, 10692/20160 transitions.
Support contains 64 out of 5908 places after structural reductions.
[2023-03-12 21:05:01] [INFO ] Flatten gal took : 458 ms
[2023-03-12 21:05:01] [INFO ] Flatten gal took : 288 ms
[2023-03-12 21:05:02] [INFO ] Input system was already deterministic with 10692 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 621 ms. (steps per millisecond=16 ) properties (out of 36) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Running SMT prover for 30 properties.
[2023-03-12 21:05:03] [INFO ] Invariant cache hit.
[2023-03-12 21:05:07] [INFO ] After 3986ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2023-03-12 21:05:11] [INFO ] [Nat]Absence check using 71 positive place invariants in 168 ms returned sat
[2023-03-12 21:05:11] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 68 ms returned sat
[2023-03-12 21:05:22] [INFO ] After 9977ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :18
[2023-03-12 21:05:22] [INFO ] State equation strengthened by 9730 read => feed constraints.
[2023-03-12 21:05:32] [INFO ] After 9306ms SMT Verify possible using 9730 Read/Feed constraints in natural domain returned unsat :12 sat :17
[2023-03-12 21:05:32] [INFO ] After 9310ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :17
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-12 21:05:32] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :17
Fused 30 Parikh solutions to 18 different solutions.
Parikh walk visited 3 properties in 465 ms.
Support contains 28 out of 5908 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5908/5908 places, 10692/10692 transitions.
Drop transitions removed 486 transitions
Trivial Post-agglo rules discarded 486 transitions
Performed 486 trivial Post agglomeration. Transition count delta: 486
Iterating post reduction 0 with 486 rules applied. Total rules applied 486 place count 5908 transition count 10206
Reduce places removed 486 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 488 rules applied. Total rules applied 974 place count 5422 transition count 10204
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 976 place count 5420 transition count 10204
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 976 place count 5420 transition count 10203
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 978 place count 5419 transition count 10203
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 994 place count 5403 transition count 10171
Iterating global reduction 3 with 16 rules applied. Total rules applied 1010 place count 5403 transition count 10171
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 2 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 1148 place count 5334 transition count 10102
Free-agglomeration rule applied 121 times.
Iterating global reduction 3 with 121 rules applied. Total rules applied 1269 place count 5334 transition count 9981
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 3 with 121 rules applied. Total rules applied 1390 place count 5213 transition count 9981
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 4 with 19 rules applied. Total rules applied 1409 place count 5213 transition count 9981
Applied a total of 1409 rules in 4820 ms. Remains 5213 /5908 variables (removed 695) and now considering 9981/10692 (removed 711) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4822 ms. Remains : 5213/5908 places, 9981/10692 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 9981 rows 5213 cols
[2023-03-12 21:05:38] [INFO ] Computed 141 place invariants in 71 ms
[2023-03-12 21:05:39] [INFO ] [Real]Absence check using 71 positive place invariants in 112 ms returned sat
[2023-03-12 21:05:39] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 57 ms returned sat
[2023-03-12 21:05:39] [INFO ] After 1571ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 21:05:40] [INFO ] [Nat]Absence check using 71 positive place invariants in 91 ms returned sat
[2023-03-12 21:05:40] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 42 ms returned sat
[2023-03-12 21:05:47] [INFO ] After 6207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 21:05:47] [INFO ] State equation strengthened by 9808 read => feed constraints.
[2023-03-12 21:05:52] [INFO ] After 4865ms SMT Verify possible using 9808 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-12 21:05:58] [INFO ] After 10647ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 4204 ms.
[2023-03-12 21:06:02] [INFO ] After 23000ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 5 properties in 70 ms.
Support contains 9 out of 5213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5213/5213 places, 9981/9981 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 5204 transition count 9972
Applied a total of 18 rules in 1895 ms. Remains 5204 /5213 variables (removed 9) and now considering 9972/9981 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1895 ms. Remains : 5204/5213 places, 9972/9981 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 9972 rows 5204 cols
[2023-03-12 21:06:05] [INFO ] Computed 141 place invariants in 107 ms
[2023-03-12 21:06:06] [INFO ] [Real]Absence check using 71 positive place invariants in 110 ms returned sat
[2023-03-12 21:06:06] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 52 ms returned sat
[2023-03-12 21:06:06] [INFO ] After 1001ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 21:06:06] [INFO ] [Nat]Absence check using 71 positive place invariants in 80 ms returned sat
[2023-03-12 21:06:07] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 41 ms returned sat
[2023-03-12 21:06:11] [INFO ] After 4278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 21:06:11] [INFO ] State equation strengthened by 9816 read => feed constraints.
[2023-03-12 21:06:13] [INFO ] After 2069ms SMT Verify possible using 9816 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 21:06:15] [INFO ] After 3516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1209 ms.
[2023-03-12 21:06:16] [INFO ] After 10194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 4 ms.
Support contains 4 out of 5204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5204/5204 places, 9972/9972 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 5201 transition count 9969
Applied a total of 6 rules in 1639 ms. Remains 5201 /5204 variables (removed 3) and now considering 9969/9972 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1639 ms. Remains : 5201/5204 places, 9969/9972 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 9969 rows 5201 cols
[2023-03-12 21:06:18] [INFO ] Computed 141 place invariants in 94 ms
[2023-03-12 21:06:19] [INFO ] After 654ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 21:06:19] [INFO ] [Nat]Absence check using 71 positive place invariants in 77 ms returned sat
[2023-03-12 21:06:19] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 43 ms returned sat
[2023-03-12 21:06:23] [INFO ] After 3811ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 21:06:23] [INFO ] State equation strengthened by 9819 read => feed constraints.
[2023-03-12 21:06:24] [INFO ] After 1046ms SMT Verify possible using 9819 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 21:06:25] [INFO ] After 1505ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 358 ms.
[2023-03-12 21:06:25] [INFO ] After 6596ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Parikh walk visited 1 properties in 3 ms.
FORMULA CANConstruction-PT-070-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 12 atomic propositions for a total of 13 simplifications.
FORMULA CANConstruction-PT-070-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-070-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-070-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-070-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 281 stabilizing places and 350 stable transitions
FORMULA CANConstruction-PT-070-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&F(p1))))'
Support contains 5 out of 5908 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5908/5908 places, 10692/10692 transitions.
Drop transitions removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 5908 transition count 10202
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 5418 transition count 10202
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 1005 place count 5393 transition count 10152
Iterating global reduction 2 with 25 rules applied. Total rules applied 1030 place count 5393 transition count 10152
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 1170 place count 5323 transition count 10082
Applied a total of 1170 rules in 3402 ms. Remains 5323 /5908 variables (removed 585) and now considering 10082/10692 (removed 610) transitions.
// Phase 1: matrix 10082 rows 5323 cols
[2023-03-12 21:06:29] [INFO ] Computed 141 place invariants in 84 ms
[2023-03-12 21:06:33] [INFO ] Implicit Places using invariants in 3695 ms returned []
Implicit Place search using SMT only with invariants took 3696 ms to find 0 implicit places.
[2023-03-12 21:06:33] [INFO ] Invariant cache hit.
[2023-03-12 21:06:39] [INFO ] Dead Transitions using invariants and state equation in 5876 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5323/5908 places, 10082/10692 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12978 ms. Remains : 5323/5908 places, 10082/10692 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CANConstruction-PT-070-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s1786 s1515), p1:(AND (LEQ 1 s5221) (LEQ s2760 s3656))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 570 steps with 0 reset in 22 ms.
FORMULA CANConstruction-PT-070-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-070-LTLCardinality-02 finished in 13267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 3 out of 5908 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5908/5908 places, 10692/10692 transitions.
Drop transitions removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 488 place count 5908 transition count 10204
Reduce places removed 488 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 489 rules applied. Total rules applied 977 place count 5420 transition count 10203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 978 place count 5419 transition count 10203
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1002 place count 5395 transition count 10155
Iterating global reduction 3 with 24 rules applied. Total rules applied 1026 place count 5395 transition count 10155
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 1166 place count 5325 transition count 10085
Applied a total of 1166 rules in 2632 ms. Remains 5325 /5908 variables (removed 583) and now considering 10085/10692 (removed 607) transitions.
// Phase 1: matrix 10085 rows 5325 cols
[2023-03-12 21:06:42] [INFO ] Computed 141 place invariants in 96 ms
[2023-03-12 21:06:45] [INFO ] Implicit Places using invariants in 3609 ms returned []
Implicit Place search using SMT only with invariants took 3610 ms to find 0 implicit places.
[2023-03-12 21:06:45] [INFO ] Invariant cache hit.
[2023-03-12 21:06:51] [INFO ] Dead Transitions using invariants and state equation in 5737 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5325/5908 places, 10085/10692 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11981 ms. Remains : 5325/5908 places, 10085/10692 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-070-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(LEQ s3332 s387), p0:(LEQ 1 s1280)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 162 reset in 1554 ms.
Product exploration explored 100000 steps with 162 reset in 1586 ms.
Computed a total of 213 stabilizing places and 211 stable transitions
Computed a total of 213 stabilizing places and 211 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 199 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 242 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 5325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5325/5325 places, 10085/10085 transitions.
Applied a total of 0 rules in 905 ms. Remains 5325 /5325 variables (removed 0) and now considering 10085/10085 (removed 0) transitions.
[2023-03-12 21:06:55] [INFO ] Invariant cache hit.
[2023-03-12 21:06:59] [INFO ] Implicit Places using invariants in 3430 ms returned []
Implicit Place search using SMT only with invariants took 3431 ms to find 0 implicit places.
[2023-03-12 21:06:59] [INFO ] Invariant cache hit.
[2023-03-12 21:07:05] [INFO ] Dead Transitions using invariants and state equation in 6011 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10348 ms. Remains : 5325/5325 places, 10085/10085 transitions.
Computed a total of 213 stabilizing places and 211 stable transitions
Computed a total of 213 stabilizing places and 211 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 149 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 16 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 106492 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 106492 steps, saw 84870 distinct states, run finished after 3002 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 21:07:08] [INFO ] Invariant cache hit.
[2023-03-12 21:07:09] [INFO ] After 754ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 21:07:10] [INFO ] [Nat]Absence check using 71 positive place invariants in 144 ms returned sat
[2023-03-12 21:07:10] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 59 ms returned sat
[2023-03-12 21:07:15] [INFO ] After 4377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 21:07:15] [INFO ] State equation strengthened by 9800 read => feed constraints.
[2023-03-12 21:07:16] [INFO ] After 1717ms SMT Verify possible using 9800 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 21:07:18] [INFO ] After 3092ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 976 ms.
[2023-03-12 21:07:19] [INFO ] After 9412ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 30 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=10 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 260 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 161 reset in 1610 ms.
Product exploration explored 100000 steps with 160 reset in 1823 ms.
Support contains 3 out of 5325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5325/5325 places, 10085/10085 transitions.
Applied a total of 0 rules in 937 ms. Remains 5325 /5325 variables (removed 0) and now considering 10085/10085 (removed 0) transitions.
[2023-03-12 21:07:23] [INFO ] Invariant cache hit.
[2023-03-12 21:07:27] [INFO ] Implicit Places using invariants in 3813 ms returned []
Implicit Place search using SMT only with invariants took 3819 ms to find 0 implicit places.
[2023-03-12 21:07:27] [INFO ] Invariant cache hit.
[2023-03-12 21:07:33] [INFO ] Dead Transitions using invariants and state equation in 6047 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10804 ms. Remains : 5325/5325 places, 10085/10085 transitions.
Treatment of property CANConstruction-PT-070-LTLCardinality-03 finished in 55125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G(p1)))))'
Support contains 3 out of 5908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5908/5908 places, 10692/10692 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 5883 transition count 10642
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 5883 transition count 10642
Applied a total of 50 rules in 1868 ms. Remains 5883 /5908 variables (removed 25) and now considering 10642/10692 (removed 50) transitions.
// Phase 1: matrix 10642 rows 5883 cols
[2023-03-12 21:07:36] [INFO ] Computed 141 place invariants in 107 ms
[2023-03-12 21:07:40] [INFO ] Implicit Places using invariants in 3789 ms returned []
Implicit Place search using SMT only with invariants took 3790 ms to find 0 implicit places.
[2023-03-12 21:07:40] [INFO ] Invariant cache hit.
[2023-03-12 21:07:46] [INFO ] Dead Transitions using invariants and state equation in 6045 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5883/5908 places, 10642/10692 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11704 ms. Remains : 5883/5908 places, 10642/10692 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : CANConstruction-PT-070-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LEQ s1361 s3733) (LEQ 1 s3684)), p0:(LEQ s1361 s3733)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7066 steps with 5 reset in 135 ms.
FORMULA CANConstruction-PT-070-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-070-LTLCardinality-05 finished in 12027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 5908 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5908/5908 places, 10692/10692 transitions.
Drop transitions removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 5908 transition count 10202
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 5418 transition count 10202
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 1006 place count 5392 transition count 10150
Iterating global reduction 2 with 26 rules applied. Total rules applied 1032 place count 5392 transition count 10150
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 1172 place count 5322 transition count 10080
Applied a total of 1172 rules in 2703 ms. Remains 5322 /5908 variables (removed 586) and now considering 10080/10692 (removed 612) transitions.
// Phase 1: matrix 10080 rows 5322 cols
[2023-03-12 21:07:49] [INFO ] Computed 141 place invariants in 94 ms
[2023-03-12 21:07:52] [INFO ] Implicit Places using invariants in 3592 ms returned []
Implicit Place search using SMT only with invariants took 3593 ms to find 0 implicit places.
[2023-03-12 21:07:52] [INFO ] Invariant cache hit.
[2023-03-12 21:07:58] [INFO ] Dead Transitions using invariants and state equation in 5949 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5322/5908 places, 10080/10692 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12246 ms. Remains : 5322/5908 places, 10080/10692 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-070-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1430 s2332)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 163 reset in 1544 ms.
Product exploration explored 100000 steps with 161 reset in 1627 ms.
Computed a total of 212 stabilizing places and 210 stable transitions
Computed a total of 212 stabilizing places and 210 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 199420 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 199420 steps, saw 172788 distinct states, run finished after 3002 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 21:08:05] [INFO ] Invariant cache hit.
[2023-03-12 21:08:06] [INFO ] After 547ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 21:08:06] [INFO ] [Nat]Absence check using 71 positive place invariants in 129 ms returned sat
[2023-03-12 21:08:06] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 52 ms returned sat
[2023-03-12 21:08:10] [INFO ] After 4137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 21:08:11] [INFO ] State equation strengthened by 9800 read => feed constraints.
[2023-03-12 21:08:12] [INFO ] After 1178ms SMT Verify possible using 9800 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 21:08:12] [INFO ] After 1680ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 403 ms.
[2023-03-12 21:08:13] [INFO ] After 7080ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 17 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 5322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5322/5322 places, 10080/10080 transitions.
Applied a total of 0 rules in 943 ms. Remains 5322 /5322 variables (removed 0) and now considering 10080/10080 (removed 0) transitions.
[2023-03-12 21:08:14] [INFO ] Invariant cache hit.
[2023-03-12 21:08:21] [INFO ] Implicit Places using invariants in 7350 ms returned []
Implicit Place search using SMT only with invariants took 7357 ms to find 0 implicit places.
[2023-03-12 21:08:21] [INFO ] Invariant cache hit.
[2023-03-12 21:08:28] [INFO ] Dead Transitions using invariants and state equation in 6734 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15035 ms. Remains : 5322/5322 places, 10080/10080 transitions.
Computed a total of 212 stabilizing places and 210 stable transitions
Computed a total of 212 stabilizing places and 210 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6861 steps, including 10 resets, run visited all 1 properties in 134 ms. (steps per millisecond=51 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 193 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 158 reset in 1756 ms.
Product exploration explored 100000 steps with 163 reset in 1850 ms.
Support contains 2 out of 5322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5322/5322 places, 10080/10080 transitions.
Applied a total of 0 rules in 1037 ms. Remains 5322 /5322 variables (removed 0) and now considering 10080/10080 (removed 0) transitions.
[2023-03-12 21:08:34] [INFO ] Invariant cache hit.
[2023-03-12 21:08:40] [INFO ] Implicit Places using invariants in 6595 ms returned []
Implicit Place search using SMT only with invariants took 6597 ms to find 0 implicit places.
[2023-03-12 21:08:40] [INFO ] Invariant cache hit.
[2023-03-12 21:08:47] [INFO ] Dead Transitions using invariants and state equation in 6424 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14061 ms. Remains : 5322/5322 places, 10080/10080 transitions.
Treatment of property CANConstruction-PT-070-LTLCardinality-06 finished in 60886 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 5908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5908/5908 places, 10692/10692 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 5884 transition count 10644
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 5884 transition count 10644
Applied a total of 48 rules in 1981 ms. Remains 5884 /5908 variables (removed 24) and now considering 10644/10692 (removed 48) transitions.
// Phase 1: matrix 10644 rows 5884 cols
[2023-03-12 21:08:49] [INFO ] Computed 141 place invariants in 79 ms
[2023-03-12 21:08:53] [INFO ] Implicit Places using invariants in 3991 ms returned []
Implicit Place search using SMT only with invariants took 3992 ms to find 0 implicit places.
[2023-03-12 21:08:53] [INFO ] Invariant cache hit.
[2023-03-12 21:08:59] [INFO ] Dead Transitions using invariants and state equation in 6178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5884/5908 places, 10644/10692 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12153 ms. Remains : 5884/5908 places, 10644/10692 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CANConstruction-PT-070-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s5109 s1330)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3487 ms.
Product exploration explored 100000 steps with 50000 reset in 3411 ms.
Computed a total of 281 stabilizing places and 350 stable transitions
Computed a total of 281 stabilizing places and 350 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-070-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-070-LTLCardinality-11 finished in 19276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 4 out of 5908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5908/5908 places, 10692/10692 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 5884 transition count 10644
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 5884 transition count 10644
Applied a total of 48 rules in 1917 ms. Remains 5884 /5908 variables (removed 24) and now considering 10644/10692 (removed 48) transitions.
// Phase 1: matrix 10644 rows 5884 cols
[2023-03-12 21:09:08] [INFO ] Computed 141 place invariants in 97 ms
[2023-03-12 21:09:12] [INFO ] Implicit Places using invariants in 4193 ms returned []
Implicit Place search using SMT only with invariants took 4195 ms to find 0 implicit places.
[2023-03-12 21:09:12] [INFO ] Invariant cache hit.
[2023-03-12 21:09:18] [INFO ] Dead Transitions using invariants and state equation in 6286 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5884/5908 places, 10644/10692 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12400 ms. Remains : 5884/5908 places, 10644/10692 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : CANConstruction-PT-070-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ s1519 s1770), p0:(LEQ s4744 s3479)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3344 ms.
Product exploration explored 100000 steps with 50000 reset in 3360 ms.
Computed a total of 281 stabilizing places and 350 stable transitions
Computed a total of 281 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 6 factoid took 137 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-070-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-070-LTLCardinality-12 finished in 19367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(F(p1) U p2)))))'
Support contains 6 out of 5908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5908/5908 places, 10692/10692 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 5885 transition count 10646
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 5885 transition count 10646
Applied a total of 46 rules in 1951 ms. Remains 5885 /5908 variables (removed 23) and now considering 10646/10692 (removed 46) transitions.
// Phase 1: matrix 10646 rows 5885 cols
[2023-03-12 21:09:28] [INFO ] Computed 141 place invariants in 98 ms
[2023-03-12 21:09:32] [INFO ] Implicit Places using invariants in 4105 ms returned []
Implicit Place search using SMT only with invariants took 4106 ms to find 0 implicit places.
[2023-03-12 21:09:32] [INFO ] Invariant cache hit.
[2023-03-12 21:09:38] [INFO ] Dead Transitions using invariants and state equation in 6505 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5885/5908 places, 10646/10692 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12563 ms. Remains : 5885/5908 places, 10646/10692 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-070-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s1380 s4952), p2:(LEQ s2805 s5767), p1:(LEQ s3861 s167)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3247 ms.
Product exploration explored 100000 steps with 50000 reset in 3258 ms.
Computed a total of 281 stabilizing places and 350 stable transitions
Computed a total of 281 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1)))))), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p2))))
Knowledge based reduction with 10 factoid took 229 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-070-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-070-LTLCardinality-13 finished in 19554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||(p1&&G(p2)))))'
Support contains 6 out of 5908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5908/5908 places, 10692/10692 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 5884 transition count 10644
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 5884 transition count 10644
Applied a total of 48 rules in 1917 ms. Remains 5884 /5908 variables (removed 24) and now considering 10644/10692 (removed 48) transitions.
// Phase 1: matrix 10644 rows 5884 cols
[2023-03-12 21:09:47] [INFO ] Computed 141 place invariants in 109 ms
[2023-03-12 21:09:51] [INFO ] Implicit Places using invariants in 3816 ms returned []
Implicit Place search using SMT only with invariants took 3817 ms to find 0 implicit places.
[2023-03-12 21:09:51] [INFO ] Invariant cache hit.
[2023-03-12 21:09:57] [INFO ] Dead Transitions using invariants and state equation in 5847 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5884/5908 places, 10644/10692 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11582 ms. Remains : 5884/5908 places, 10644/10692 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-070-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ s4227 s5618), p1:(GT 1 s3447), p2:(AND (LEQ 1 s107) (GT s5673 s4695))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2464 ms.
Product exploration explored 100000 steps with 33333 reset in 2422 ms.
Computed a total of 281 stabilizing places and 350 stable transitions
Computed a total of 281 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p1 p2))), (X (OR (NOT p1) (NOT p2))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 6 factoid took 103 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-070-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-070-LTLCardinality-15 finished in 16815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-12 21:10:02] [INFO ] Flatten gal took : 292 ms
[2023-03-12 21:10:02] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 21:10:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5908 places, 10692 transitions and 41264 arcs took 46 ms.
Total runtime 315949 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/996/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/996/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CANConstruction-PT-070-LTLCardinality-03
Could not compute solution for formula : CANConstruction-PT-070-LTLCardinality-06

BK_STOP 1678655416119

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name CANConstruction-PT-070-LTLCardinality-03
ltl formula formula --ltl=/tmp/996/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5908 places, 10692 transitions and 41264 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.210 real 0.360 user 0.380 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/996/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/996/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/996/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/996/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name CANConstruction-PT-070-LTLCardinality-06
ltl formula formula --ltl=/tmp/996/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5908 places, 10692 transitions and 41264 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.220 real 0.450 user 0.310 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/996/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/996/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/996/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/996/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

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="CANConstruction-PT-070"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is CANConstruction-PT-070, 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 r041-tajo-167813695000667"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-070.tgz
mv CANConstruction-PT-070 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;