fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r039-tajo-167813692900676
Last Updated
May 14, 2023

About the Execution of LoLa+red for CANConstruction-PT-080

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1607.972 338906.00 394633.00 1165.00 FTFFFFFTFFFTFFFF normal

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.r039-tajo-167813692900676.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 lolaxred
Input is CANConstruction-PT-080, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692900676
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 10M
-rw-r--r-- 1 mcc users 11K Feb 25 22:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 22:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 25 22:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:26 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 9.5M 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-080-LTLFireability-00
FORMULA_NAME CANConstruction-PT-080-LTLFireability-01
FORMULA_NAME CANConstruction-PT-080-LTLFireability-02
FORMULA_NAME CANConstruction-PT-080-LTLFireability-03
FORMULA_NAME CANConstruction-PT-080-LTLFireability-04
FORMULA_NAME CANConstruction-PT-080-LTLFireability-05
FORMULA_NAME CANConstruction-PT-080-LTLFireability-06
FORMULA_NAME CANConstruction-PT-080-LTLFireability-07
FORMULA_NAME CANConstruction-PT-080-LTLFireability-08
FORMULA_NAME CANConstruction-PT-080-LTLFireability-09
FORMULA_NAME CANConstruction-PT-080-LTLFireability-10
FORMULA_NAME CANConstruction-PT-080-LTLFireability-11
FORMULA_NAME CANConstruction-PT-080-LTLFireability-12
FORMULA_NAME CANConstruction-PT-080-LTLFireability-13
FORMULA_NAME CANConstruction-PT-080-LTLFireability-14
FORMULA_NAME CANConstruction-PT-080-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678504902190

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-080
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:21:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 03:21:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:21:45] [INFO ] Load time of PNML (sax parser for PT used): 565 ms
[2023-03-11 03:21:45] [INFO ] Transformed 13762 places.
[2023-03-11 03:21:45] [INFO ] Transformed 26240 transitions.
[2023-03-11 03:21:45] [INFO ] Parsed PT model containing 13762 places and 26240 transitions and 78400 arcs in 733 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANConstruction-PT-080-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-080-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-080-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 13762 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13762/13762 places, 26240/26240 transitions.
Discarding 6229 places :
Symmetric choice reduction at 0 with 6229 rule applications. Total rules 6229 place count 7533 transition count 13782
Iterating global reduction 0 with 6229 rules applied. Total rules applied 12458 place count 7533 transition count 13782
Applied a total of 12458 rules in 3798 ms. Remains 7533 /13762 variables (removed 6229) and now considering 13782/26240 (removed 12458) transitions.
// Phase 1: matrix 13782 rows 7533 cols
[2023-03-11 03:21:50] [INFO ] Computed 161 place invariants in 237 ms
[2023-03-11 03:21:56] [INFO ] Implicit Places using invariants in 5902 ms returned []
Implicit Place search using SMT only with invariants took 6614 ms to find 0 implicit places.
[2023-03-11 03:21:56] [INFO ] Invariant cache hit.
[2023-03-11 03:22:05] [INFO ] Dead Transitions using invariants and state equation in 8921 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7533/13762 places, 13782/26240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19339 ms. Remains : 7533/13762 places, 13782/26240 transitions.
Support contains 46 out of 7533 places after structural reductions.
[2023-03-11 03:22:05] [INFO ] Flatten gal took : 597 ms
[2023-03-11 03:22:06] [INFO ] Flatten gal took : 465 ms
[2023-03-11 03:22:07] [INFO ] Input system was already deterministic with 13782 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 530 ms. (steps per millisecond=18 ) properties (out of 30) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Running SMT prover for 17 properties.
[2023-03-11 03:22:08] [INFO ] Invariant cache hit.
[2023-03-11 03:22:11] [INFO ] [Real]Absence check using 81 positive place invariants in 222 ms returned sat
[2023-03-11 03:22:11] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 98 ms returned sat
[2023-03-11 03:22:24] [INFO ] After 10584ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9 real:8
[2023-03-11 03:22:24] [INFO ] State equation strengthened by 12720 read => feed constraints.
[2023-03-11 03:22:30] [INFO ] After 6213ms SMT Verify possible using 12720 Read/Feed constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-11 03:22:30] [INFO ] After 22746ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-11 03:22:34] [INFO ] [Nat]Absence check using 81 positive place invariants in 183 ms returned sat
[2023-03-11 03:22:34] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 96 ms returned sat
[2023-03-11 03:22:49] [INFO ] After 13199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-11 03:22:55] [INFO ] After 6011ms SMT Verify possible using 12720 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-11 03:22:55] [INFO ] After 6014ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-11 03:22:55] [INFO ] After 25044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 7 properties in 456 ms.
Support contains 14 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 13782/13782 transitions.
Drop transitions removed 553 transitions
Trivial Post-agglo rules discarded 553 transitions
Performed 553 trivial Post agglomeration. Transition count delta: 553
Iterating post reduction 0 with 553 rules applied. Total rules applied 553 place count 7533 transition count 13229
Reduce places removed 553 places and 0 transitions.
Iterating post reduction 1 with 553 rules applied. Total rules applied 1106 place count 6980 transition count 13229
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1106 place count 6980 transition count 13226
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1112 place count 6977 transition count 13226
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1117 place count 6972 transition count 13216
Iterating global reduction 2 with 5 rules applied. Total rules applied 1122 place count 6972 transition count 13216
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 7 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 1276 place count 6895 transition count 13139
Free-agglomeration rule applied 148 times.
Iterating global reduction 2 with 148 rules applied. Total rules applied 1424 place count 6895 transition count 12991
Reduce places removed 148 places and 0 transitions.
Iterating post reduction 2 with 148 rules applied. Total rules applied 1572 place count 6747 transition count 12991
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1576 place count 6747 transition count 12987
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1580 place count 6743 transition count 12987
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 1595 place count 6743 transition count 12987
Applied a total of 1595 rules in 10438 ms. Remains 6743 /7533 variables (removed 790) and now considering 12987/13782 (removed 795) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10441 ms. Remains : 6743/7533 places, 12987/13782 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 12987 rows 6743 cols
[2023-03-11 03:23:07] [INFO ] Computed 161 place invariants in 91 ms
[2023-03-11 03:23:09] [INFO ] [Real]Absence check using 81 positive place invariants in 181 ms returned sat
[2023-03-11 03:23:09] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 75 ms returned sat
[2023-03-11 03:23:17] [INFO ] After 7518ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:3
[2023-03-11 03:23:17] [INFO ] State equation strengthened by 12806 read => feed constraints.
[2023-03-11 03:23:20] [INFO ] After 3152ms SMT Verify possible using 12806 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 03:23:20] [INFO ] After 13322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 03:23:22] [INFO ] [Nat]Absence check using 81 positive place invariants in 182 ms returned sat
[2023-03-11 03:23:22] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 73 ms returned sat
[2023-03-11 03:23:30] [INFO ] After 7454ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-11 03:23:35] [INFO ] After 5078ms SMT Verify possible using 12806 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-11 03:23:41] [INFO ] After 10146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 3212 ms.
[2023-03-11 03:23:44] [INFO ] After 23291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 16 ms.
Support contains 8 out of 6743 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6743/6743 places, 12987/12987 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 6740 transition count 12984
Applied a total of 6 rules in 2742 ms. Remains 6740 /6743 variables (removed 3) and now considering 12984/12987 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2742 ms. Remains : 6740/6743 places, 12984/12987 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 12984 rows 6740 cols
[2023-03-11 03:23:47] [INFO ] Computed 161 place invariants in 103 ms
[2023-03-11 03:23:48] [INFO ] [Real]Absence check using 81 positive place invariants in 185 ms returned sat
[2023-03-11 03:23:48] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 76 ms returned sat
[2023-03-11 03:23:55] [INFO ] After 6173ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-11 03:23:55] [INFO ] State equation strengthened by 12808 read => feed constraints.
[2023-03-11 03:23:58] [INFO ] After 2521ms SMT Verify possible using 12808 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:23:58] [INFO ] After 10512ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:23:59] [INFO ] [Nat]Absence check using 81 positive place invariants in 184 ms returned sat
[2023-03-11 03:23:59] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 77 ms returned sat
[2023-03-11 03:24:05] [INFO ] After 6358ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:24:09] [INFO ] After 3156ms SMT Verify possible using 12808 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:24:11] [INFO ] After 5555ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1442 ms.
[2023-03-11 03:24:12] [INFO ] After 14899ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 11 ms.
Support contains 3 out of 6740 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6740/6740 places, 12984/12984 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 6736 transition count 12980
Applied a total of 8 rules in 3411 ms. Remains 6736 /6740 variables (removed 4) and now considering 12980/12984 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3411 ms. Remains : 6736/6740 places, 12980/12984 transitions.
FORMULA CANConstruction-PT-080-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 321 stabilizing places and 400 stable transitions
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(G(p0)))'
Support contains 2 out of 7533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7533/7533 places, 13782/13782 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 7533 transition count 13223
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 6974 transition count 13223
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1129 place count 6963 transition count 13201
Iterating global reduction 2 with 11 rules applied. Total rules applied 1140 place count 6963 transition count 13201
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 1300 place count 6883 transition count 13121
Applied a total of 1300 rules in 5044 ms. Remains 6883 /7533 variables (removed 650) and now considering 13121/13782 (removed 661) transitions.
// Phase 1: matrix 13121 rows 6883 cols
[2023-03-11 03:24:22] [INFO ] Computed 161 place invariants in 118 ms
[2023-03-11 03:24:22] [INFO ] Implicit Places using invariants in 829 ms returned []
Implicit Place search using SMT only with invariants took 831 ms to find 0 implicit places.
[2023-03-11 03:24:22] [INFO ] Invariant cache hit.
[2023-03-11 03:24:29] [INFO ] Dead Transitions using invariants and state equation in 7050 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6883/7533 places, 13121/13782 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12927 ms. Remains : 6883/7533 places, 13121/13782 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s190 1) (GEQ s4939 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 696 steps with 0 reset in 25 ms.
FORMULA CANConstruction-PT-080-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-00 finished in 13155 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((G(p1)&&p0))))'
Support contains 2 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 13782/13782 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 7522 transition count 13760
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 7522 transition count 13760
Applied a total of 22 rules in 3072 ms. Remains 7522 /7533 variables (removed 11) and now considering 13760/13782 (removed 22) transitions.
// Phase 1: matrix 13760 rows 7522 cols
[2023-03-11 03:24:33] [INFO ] Computed 161 place invariants in 119 ms
[2023-03-11 03:24:33] [INFO ] Implicit Places using invariants in 903 ms returned []
Implicit Place search using SMT only with invariants took 906 ms to find 0 implicit places.
[2023-03-11 03:24:33] [INFO ] Invariant cache hit.
[2023-03-11 03:24:41] [INFO ] Dead Transitions using invariants and state equation in 7773 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7522/7533 places, 13760/13782 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11753 ms. Remains : 7522/7533 places, 13760/13782 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s25 1) (GEQ s734 1)), p1:(AND (GEQ s25 1) (GEQ s734 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1462 steps with 0 reset in 50 ms.
FORMULA CANConstruction-PT-080-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-02 finished in 11970 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&&G(F(p1))))))'
Support contains 3 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 13782/13782 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 7523 transition count 13762
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 7523 transition count 13762
Applied a total of 20 rules in 3552 ms. Remains 7523 /7533 variables (removed 10) and now considering 13762/13782 (removed 20) transitions.
// Phase 1: matrix 13762 rows 7523 cols
[2023-03-11 03:24:45] [INFO ] Computed 161 place invariants in 121 ms
[2023-03-11 03:24:50] [INFO ] Implicit Places using invariants in 4695 ms returned []
Implicit Place search using SMT only with invariants took 4695 ms to find 0 implicit places.
[2023-03-11 03:24:50] [INFO ] Invariant cache hit.
[2023-03-11 03:24:57] [INFO ] Dead Transitions using invariants and state equation in 7201 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7523/7533 places, 13762/13782 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15450 ms. Remains : 7523/7533 places, 13762/13782 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s398 1) (GEQ s6998 1)), p0:(GEQ s3489 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1570 steps with 0 reset in 21 ms.
FORMULA CANConstruction-PT-080-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-03 finished in 15616 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(((X(X(G(p0))) U p1)||G(G(X(p2)))||p0)))'
Support contains 6 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 13782/13782 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 7522 transition count 13760
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 7522 transition count 13760
Applied a total of 22 rules in 3561 ms. Remains 7522 /7533 variables (removed 11) and now considering 13760/13782 (removed 22) transitions.
// Phase 1: matrix 13760 rows 7522 cols
[2023-03-11 03:25:01] [INFO ] Computed 161 place invariants in 135 ms
[2023-03-11 03:25:05] [INFO ] Implicit Places using invariants in 4766 ms returned []
Implicit Place search using SMT only with invariants took 4767 ms to find 0 implicit places.
[2023-03-11 03:25:05] [INFO ] Invariant cache hit.
[2023-03-11 03:25:13] [INFO ] Dead Transitions using invariants and state equation in 7574 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7522/7533 places, 13760/13782 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15904 ms. Remains : 7522/7533 places, 13760/13782 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s762 1) (GEQ s1492 1)), p1:(AND (GEQ s174 1) (GEQ s753 1)), p2:(OR (LT s580 1) (LT s865 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5103 steps with 3 reset in 85 ms.
FORMULA CANConstruction-PT-080-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-04 finished in 16225 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(p0)||X(((p0||G(!p1)) U (p2&&(p0||G(!p1)))))))'
Support contains 4 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 13782/13782 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 7524 transition count 13764
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 7524 transition count 13764
Applied a total of 18 rules in 3789 ms. Remains 7524 /7533 variables (removed 9) and now considering 13764/13782 (removed 18) transitions.
// Phase 1: matrix 13764 rows 7524 cols
[2023-03-11 03:25:17] [INFO ] Computed 161 place invariants in 137 ms
[2023-03-11 03:25:22] [INFO ] Implicit Places using invariants in 4771 ms returned []
Implicit Place search using SMT only with invariants took 4772 ms to find 0 implicit places.
[2023-03-11 03:25:22] [INFO ] Invariant cache hit.
[2023-03-11 03:25:29] [INFO ] Dead Transitions using invariants and state equation in 7315 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7524/7533 places, 13764/13782 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15877 ms. Remains : 7524/7533 places, 13764/13782 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s7324 1), p2:(GEQ s5234 1), p1:(AND (GEQ s530 1) (GEQ s532 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1801 steps with 1 reset in 23 ms.
FORMULA CANConstruction-PT-080-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-05 finished in 16058 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(G(p0)))'
Support contains 2 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 13782/13782 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 7522 transition count 13760
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 7522 transition count 13760
Applied a total of 22 rules in 3628 ms. Remains 7522 /7533 variables (removed 11) and now considering 13760/13782 (removed 22) transitions.
// Phase 1: matrix 13760 rows 7522 cols
[2023-03-11 03:25:33] [INFO ] Computed 161 place invariants in 115 ms
[2023-03-11 03:25:34] [INFO ] Implicit Places using invariants in 881 ms returned []
Implicit Place search using SMT only with invariants took 883 ms to find 0 implicit places.
[2023-03-11 03:25:34] [INFO ] Invariant cache hit.
[2023-03-11 03:25:41] [INFO ] Dead Transitions using invariants and state equation in 7514 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7522/7533 places, 13760/13782 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12030 ms. Remains : 7522/7533 places, 13760/13782 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s832 1) (GEQ s1734 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-080-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-06 finished in 12156 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&&(F(p1)||X(p2)))))'
Support contains 5 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 13782/13782 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 7523 transition count 13762
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 7523 transition count 13762
Applied a total of 20 rules in 3786 ms. Remains 7523 /7533 variables (removed 10) and now considering 13762/13782 (removed 20) transitions.
// Phase 1: matrix 13762 rows 7523 cols
[2023-03-11 03:25:45] [INFO ] Computed 161 place invariants in 126 ms
[2023-03-11 03:25:46] [INFO ] Implicit Places using invariants in 890 ms returned []
Implicit Place search using SMT only with invariants took 891 ms to find 0 implicit places.
[2023-03-11 03:25:46] [INFO ] Invariant cache hit.
[2023-03-11 03:25:55] [INFO ] Dead Transitions using invariants and state equation in 8302 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7523/7533 places, 13762/13782 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12980 ms. Remains : 7523/7533 places, 13762/13782 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(GEQ s3305 1), p0:(OR (LT s3305 1) (LT s0 1) (LT s268 1)), p2:(OR (LT s431 1) (LT s552 1))], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 4105 ms.
Product exploration explored 100000 steps with 33333 reset in 4022 ms.
Computed a total of 321 stabilizing places and 400 stable transitions
Computed a total of 321 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p0), (X (AND p0 (NOT p1))), true, (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p2)))))
Knowledge based reduction with 5 factoid took 121 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-080-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-080-LTLFireability-07 finished in 21483 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)) U p2)&&G(p3))))'
Support contains 7 out of 7533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7533/7533 places, 13782/13782 transitions.
Drop transitions removed 555 transitions
Trivial Post-agglo rules discarded 555 transitions
Performed 555 trivial Post agglomeration. Transition count delta: 555
Iterating post reduction 0 with 555 rules applied. Total rules applied 555 place count 7533 transition count 13227
Reduce places removed 555 places and 0 transitions.
Iterating post reduction 1 with 555 rules applied. Total rules applied 1110 place count 6978 transition count 13227
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1110 place count 6978 transition count 13225
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1114 place count 6976 transition count 13225
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1124 place count 6966 transition count 13205
Iterating global reduction 2 with 10 rules applied. Total rules applied 1134 place count 6966 transition count 13205
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 3 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 1290 place count 6888 transition count 13127
Applied a total of 1290 rules in 4886 ms. Remains 6888 /7533 variables (removed 645) and now considering 13127/13782 (removed 655) transitions.
// Phase 1: matrix 13127 rows 6888 cols
[2023-03-11 03:26:08] [INFO ] Computed 161 place invariants in 116 ms
[2023-03-11 03:26:16] [INFO ] Implicit Places using invariants in 7998 ms returned []
Implicit Place search using SMT only with invariants took 7998 ms to find 0 implicit places.
[2023-03-11 03:26:16] [INFO ] Invariant cache hit.
[2023-03-11 03:26:23] [INFO ] Dead Transitions using invariants and state equation in 6715 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6888/7533 places, 13127/13782 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19602 ms. Remains : 6888/7533 places, 13127/13782 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) (NOT p0) (NOT p1)) (NOT p3)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1 p3), acceptance={1} source=0 dest: 1}, { cond=(OR (AND (NOT p2) p0 p3) (AND (NOT p2) p1 p3)), acceptance={0, 1} source=0 dest: 2}, { cond=(OR (AND p2 p3) (AND p0 p3) (AND p1 p3)), acceptance={0} source=0 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0) p1) (AND p1 (NOT p3))), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1) p3), acceptance={0, 1} source=1 dest: 2}, { cond=(OR (AND p2 (NOT p1) p3) (AND p0 (NOT p1) p3)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) p0 p1 p3), acceptance={1} source=1 dest: 4}, { cond=(OR (AND p2 p1 p3) (AND p0 p1 p3)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={1} source=2 dest: 1}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0, 1} source=3 dest: 0}, { cond=p3, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p1 (NOT p3)), acceptance={1} source=5 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={0} source=5 dest: 3}, { cond=(AND p1 p3), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s306 1) (GEQ s1248 1)), p0:(GEQ s6630 1), p1:(AND (GEQ s47 1) (GEQ s464 1)), p3:(AND (GEQ s78 1) (GEQ s313 1) (GEQ s6630 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 728 steps with 0 reset in 13 ms.
FORMULA CANConstruction-PT-080-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-08 finished in 19850 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)&&F(p1))))'
Support contains 4 out of 7533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7533/7533 places, 13782/13782 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 7533 transition count 13224
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 6975 transition count 13224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1116 place count 6975 transition count 13223
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1118 place count 6974 transition count 13223
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1127 place count 6965 transition count 13205
Iterating global reduction 2 with 9 rules applied. Total rules applied 1136 place count 6965 transition count 13205
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 3 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 1294 place count 6886 transition count 13126
Applied a total of 1294 rules in 4901 ms. Remains 6886 /7533 variables (removed 647) and now considering 13126/13782 (removed 656) transitions.
// Phase 1: matrix 13126 rows 6886 cols
[2023-03-11 03:26:28] [INFO ] Computed 161 place invariants in 115 ms
[2023-03-11 03:26:33] [INFO ] Implicit Places using invariants in 4776 ms returned []
Implicit Place search using SMT only with invariants took 4777 ms to find 0 implicit places.
[2023-03-11 03:26:33] [INFO ] Invariant cache hit.
[2023-03-11 03:26:40] [INFO ] Dead Transitions using invariants and state equation in 7824 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6886/7533 places, 13126/13782 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17503 ms. Remains : 6886/7533 places, 13126/13782 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s1743 1), p1:(OR (LT s101 1) (LT s413 1) (GEQ s6854 1))], 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 661 steps with 0 reset in 15 ms.
FORMULA CANConstruction-PT-080-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-09 finished in 17650 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||X(p0)))))'
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 13782/13782 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 7523 transition count 13762
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 7523 transition count 13762
Applied a total of 20 rules in 3442 ms. Remains 7523 /7533 variables (removed 10) and now considering 13762/13782 (removed 20) transitions.
// Phase 1: matrix 13762 rows 7523 cols
[2023-03-11 03:26:44] [INFO ] Computed 161 place invariants in 125 ms
[2023-03-11 03:26:49] [INFO ] Implicit Places using invariants in 5066 ms returned []
Implicit Place search using SMT only with invariants took 5067 ms to find 0 implicit places.
[2023-03-11 03:26:49] [INFO ] Invariant cache hit.
[2023-03-11 03:26:50] [INFO ] Dead Transitions using invariants and state equation in 713 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7523/7533 places, 13762/13782 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9225 ms. Remains : 7523/7533 places, 13762/13782 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s5240 1)], 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][false, false]]
Stuttering criterion allowed to conclude after 1255 steps with 0 reset in 20 ms.
FORMULA CANConstruction-PT-080-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-13 finished in 9370 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))'
Support contains 2 out of 7533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7533/7533 places, 13782/13782 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 7533 transition count 13224
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 6975 transition count 13224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1116 place count 6975 transition count 13223
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1118 place count 6974 transition count 13223
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1129 place count 6963 transition count 13201
Iterating global reduction 2 with 11 rules applied. Total rules applied 1140 place count 6963 transition count 13201
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 5 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 1298 place count 6884 transition count 13122
Applied a total of 1298 rules in 5106 ms. Remains 6884 /7533 variables (removed 649) and now considering 13122/13782 (removed 660) transitions.
// Phase 1: matrix 13122 rows 6884 cols
[2023-03-11 03:26:55] [INFO ] Computed 161 place invariants in 120 ms
[2023-03-11 03:26:56] [INFO ] Implicit Places using invariants in 881 ms returned []
Implicit Place search using SMT only with invariants took 882 ms to find 0 implicit places.
[2023-03-11 03:26:56] [INFO ] Invariant cache hit.
[2023-03-11 03:27:03] [INFO ] Dead Transitions using invariants and state equation in 7454 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6884/7533 places, 13122/13782 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13444 ms. Remains : 6884/7533 places, 13122/13782 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s460 1) (GEQ s468 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 722 steps with 0 reset in 13 ms.
FORMULA CANConstruction-PT-080-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-14 finished in 13513 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)&&F(G(p1)))))'
Support contains 3 out of 7533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7533/7533 places, 13782/13782 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 7533 transition count 13224
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 6975 transition count 13224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1116 place count 6975 transition count 13223
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1118 place count 6974 transition count 13223
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1128 place count 6964 transition count 13203
Iterating global reduction 2 with 10 rules applied. Total rules applied 1138 place count 6964 transition count 13203
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 4 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 1296 place count 6885 transition count 13124
Applied a total of 1296 rules in 5087 ms. Remains 6885 /7533 variables (removed 648) and now considering 13124/13782 (removed 658) transitions.
// Phase 1: matrix 13124 rows 6885 cols
[2023-03-11 03:27:09] [INFO ] Computed 161 place invariants in 118 ms
[2023-03-11 03:27:13] [INFO ] Implicit Places using invariants in 4882 ms returned []
Implicit Place search using SMT only with invariants took 4882 ms to find 0 implicit places.
[2023-03-11 03:27:13] [INFO ] Invariant cache hit.
[2023-03-11 03:27:20] [INFO ] Dead Transitions using invariants and state equation in 6976 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6885/7533 places, 13124/13782 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16947 ms. Remains : 6885/7533 places, 13124/13782 transitions.
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s214 1) (GEQ s456 1)), p1:(GEQ s5071 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 645 steps with 0 reset in 12 ms.
FORMULA CANConstruction-PT-080-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-15 finished in 17062 ms.
All properties solved by simple procedures.
Total runtime 336323 ms.
ITS solved all properties within timeout

BK_STOP 1678505241096

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-080"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is CANConstruction-PT-080, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r039-tajo-167813692900676"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-080.tgz
mv CANConstruction-PT-080 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;