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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1652.340 339978.00 389326.00 179.10 FFFFF?FFFFFFFFFF 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-167813692800668.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-070, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692800668
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME CANConstruction-PT-070-LTLFireability-01
FORMULA_NAME CANConstruction-PT-070-LTLFireability-02
FORMULA_NAME CANConstruction-PT-070-LTLFireability-03
FORMULA_NAME CANConstruction-PT-070-LTLFireability-04
FORMULA_NAME CANConstruction-PT-070-LTLFireability-05
FORMULA_NAME CANConstruction-PT-070-LTLFireability-06
FORMULA_NAME CANConstruction-PT-070-LTLFireability-07
FORMULA_NAME CANConstruction-PT-070-LTLFireability-08
FORMULA_NAME CANConstruction-PT-070-LTLFireability-09
FORMULA_NAME CANConstruction-PT-070-LTLFireability-10
FORMULA_NAME CANConstruction-PT-070-LTLFireability-11
FORMULA_NAME CANConstruction-PT-070-LTLFireability-12
FORMULA_NAME CANConstruction-PT-070-LTLFireability-13
FORMULA_NAME CANConstruction-PT-070-LTLFireability-14
FORMULA_NAME CANConstruction-PT-070-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678504683069

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-070
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:18:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 03:18:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:18:05] [INFO ] Load time of PNML (sax parser for PT used): 363 ms
[2023-03-11 03:18:05] [INFO ] Transformed 10642 places.
[2023-03-11 03:18:05] [INFO ] Transformed 20160 transitions.
[2023-03-11 03:18:05] [INFO ] Parsed PT model containing 10642 places and 20160 transitions and 60200 arcs in 509 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANConstruction-PT-070-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-070-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-070-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-070-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 10642 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10642/10642 places, 20160/20160 transitions.
Discarding 4747 places :
Symmetric choice reduction at 0 with 4747 rule applications. Total rules 4747 place count 5895 transition count 10666
Iterating global reduction 0 with 4747 rules applied. Total rules applied 9494 place count 5895 transition count 10666
Applied a total of 9494 rules in 2436 ms. Remains 5895 /10642 variables (removed 4747) and now considering 10666/20160 (removed 9494) transitions.
// Phase 1: matrix 10666 rows 5895 cols
[2023-03-11 03:18:08] [INFO ] Computed 141 place invariants in 170 ms
[2023-03-11 03:18:12] [INFO ] Implicit Places using invariants in 4226 ms returned []
Implicit Place search using SMT only with invariants took 4280 ms to find 0 implicit places.
[2023-03-11 03:18:12] [INFO ] Invariant cache hit.
[2023-03-11 03:18:18] [INFO ] Dead Transitions using invariants and state equation in 5851 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5895/10642 places, 10666/20160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12572 ms. Remains : 5895/10642 places, 10666/20160 transitions.
Support contains 28 out of 5895 places after structural reductions.
[2023-03-11 03:18:19] [INFO ] Flatten gal took : 505 ms
[2023-03-11 03:18:19] [INFO ] Flatten gal took : 360 ms
[2023-03-11 03:18:20] [INFO ] Input system was already deterministic with 10666 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 676 ms. (steps per millisecond=14 ) properties (out of 21) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) seen :0
Running SMT prover for 15 properties.
[2023-03-11 03:18:20] [INFO ] Invariant cache hit.
[2023-03-11 03:18:23] [INFO ] [Real]Absence check using 71 positive place invariants in 185 ms returned sat
[2023-03-11 03:18:23] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 79 ms returned sat
[2023-03-11 03:18:33] [INFO ] After 8748ms SMT Verify possible using state equation in real domain returned unsat :0 sat :15
[2023-03-11 03:18:34] [INFO ] State equation strengthened by 9730 read => feed constraints.
[2023-03-11 03:18:41] [INFO ] After 7754ms SMT Verify possible using 9730 Read/Feed constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-11 03:18:41] [INFO ] After 20831ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-11 03:18:44] [INFO ] [Nat]Absence check using 71 positive place invariants in 200 ms returned sat
[2023-03-11 03:18:44] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 85 ms returned sat
[2023-03-11 03:18:54] [INFO ] After 8740ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-11 03:19:03] [INFO ] After 8734ms SMT Verify possible using 9730 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-11 03:19:06] [INFO ] After 12009ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-11 03:19:06] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 1 properties in 422 ms.
Support contains 16 out of 5895 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5895/5895 places, 10666/10666 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 5895 transition count 10178
Reduce places removed 488 places and 0 transitions.
Iterating post reduction 1 with 488 rules applied. Total rules applied 976 place count 5407 transition count 10178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 977 place count 5406 transition count 10176
Iterating global reduction 2 with 1 rules applied. Total rules applied 978 place count 5406 transition count 10176
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 6 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 1118 place count 5336 transition count 10106
Free-agglomeration rule applied 116 times.
Iterating global reduction 2 with 116 rules applied. Total rules applied 1234 place count 5336 transition count 9990
Reduce places removed 116 places and 0 transitions.
Iterating post reduction 2 with 116 rules applied. Total rules applied 1350 place count 5220 transition count 9990
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1352 place count 5220 transition count 9988
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1354 place count 5218 transition count 9988
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 1378 place count 5218 transition count 9988
Applied a total of 1378 rules in 6367 ms. Remains 5218 /5895 variables (removed 677) and now considering 9988/10666 (removed 678) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6371 ms. Remains : 5218/5895 places, 9988/10666 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 590 ms. (steps per millisecond=16 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :1
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
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 :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) 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 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 9988 rows 5218 cols
[2023-03-11 03:19:14] [INFO ] Computed 141 place invariants in 118 ms
[2023-03-11 03:19:15] [INFO ] [Real]Absence check using 71 positive place invariants in 136 ms returned sat
[2023-03-11 03:19:15] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 64 ms returned sat
[2023-03-11 03:19:21] [INFO ] After 4929ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2023-03-11 03:19:21] [INFO ] State equation strengthened by 9812 read => feed constraints.
[2023-03-11 03:19:25] [INFO ] After 3875ms SMT Verify possible using 9812 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 03:19:25] [INFO ] After 10825ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 03:19:26] [INFO ] [Nat]Absence check using 71 positive place invariants in 142 ms returned sat
[2023-03-11 03:19:26] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 68 ms returned sat
[2023-03-11 03:19:32] [INFO ] After 5806ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 03:19:36] [INFO ] After 3917ms SMT Verify possible using 9812 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 03:19:40] [INFO ] After 7500ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2598 ms.
[2023-03-11 03:19:42] [INFO ] After 17550ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 24 ms.
Support contains 3 out of 5218 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5218/5218 places, 9988/9988 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 5209 transition count 9979
Applied a total of 18 rules in 1765 ms. Remains 5209 /5218 variables (removed 9) and now considering 9979/9988 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1765 ms. Remains : 5209/5218 places, 9979/9988 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 9979 rows 5209 cols
[2023-03-11 03:19:45] [INFO ] Computed 141 place invariants in 102 ms
[2023-03-11 03:19:46] [INFO ] [Real]Absence check using 71 positive place invariants in 150 ms returned sat
[2023-03-11 03:19:46] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 57 ms returned sat
[2023-03-11 03:19:50] [INFO ] After 4245ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-11 03:19:50] [INFO ] State equation strengthened by 9821 read => feed constraints.
[2023-03-11 03:19:52] [INFO ] After 1512ms SMT Verify possible using 9821 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:19:52] [INFO ] After 7076ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:19:53] [INFO ] [Nat]Absence check using 71 positive place invariants in 139 ms returned sat
[2023-03-11 03:19:53] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 56 ms returned sat
[2023-03-11 03:19:57] [INFO ] After 4135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:19:59] [INFO ] After 1591ms SMT Verify possible using 9821 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:20:00] [INFO ] After 2636ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 775 ms.
[2023-03-11 03:20:00] [INFO ] After 8608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 5 ms.
Support contains 1 out of 5209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5209/5209 places, 9979/9979 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 5207 transition count 9977
Applied a total of 4 rules in 2081 ms. Remains 5207 /5209 variables (removed 2) and now considering 9977/9979 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2081 ms. Remains : 5207/5209 places, 9977/9979 transitions.
Computed a total of 281 stabilizing places and 350 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(p0))'
Support contains 1 out of 5895 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5895/5895 places, 10666/10666 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 5895 transition count 10176
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 5405 transition count 10176
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 992 place count 5393 transition count 10152
Iterating global reduction 2 with 12 rules applied. Total rules applied 1004 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 1144 place count 5323 transition count 10082
Applied a total of 1144 rules in 2658 ms. Remains 5323 /5895 variables (removed 572) and now considering 10082/10666 (removed 584) transitions.
// Phase 1: matrix 10082 rows 5323 cols
[2023-03-11 03:20:06] [INFO ] Computed 141 place invariants in 107 ms
[2023-03-11 03:20:09] [INFO ] Implicit Places using invariants in 3893 ms returned []
Implicit Place search using SMT only with invariants took 3896 ms to find 0 implicit places.
[2023-03-11 03:20:09] [INFO ] Invariant cache hit.
[2023-03-11 03:20:10] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5323/5895 places, 10082/10666 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7198 ms. Remains : 5323/5895 places, 10082/10666 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-070-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s4686 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 562 steps with 0 reset in 28 ms.
FORMULA CANConstruction-PT-070-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-070-LTLFireability-00 finished in 7519 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(F(!p0)))))'
Support contains 2 out of 5895 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5895/5895 places, 10666/10666 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 5882 transition count 10640
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 5882 transition count 10640
Applied a total of 26 rules in 1942 ms. Remains 5882 /5895 variables (removed 13) and now considering 10640/10666 (removed 26) transitions.
// Phase 1: matrix 10640 rows 5882 cols
[2023-03-11 03:20:12] [INFO ] Computed 141 place invariants in 72 ms
[2023-03-11 03:20:16] [INFO ] Implicit Places using invariants in 3471 ms returned []
Implicit Place search using SMT only with invariants took 3475 ms to find 0 implicit places.
[2023-03-11 03:20:16] [INFO ] Invariant cache hit.
[2023-03-11 03:20:22] [INFO ] Dead Transitions using invariants and state equation in 6098 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5882/5895 places, 10640/10666 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11517 ms. Remains : 5882/5895 places, 10640/10666 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, true, (NOT p0), p0]
Running random walk in product with property : CANConstruction-PT-070-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s95 1) (LT s398 1))], 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]]
Stuttering criterion allowed to conclude after 1291 steps with 0 reset in 44 ms.
FORMULA CANConstruction-PT-070-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-070-LTLFireability-01 finished in 11775 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((G(p0)||G(F(p1)))))'
Support contains 3 out of 5895 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5895/5895 places, 10666/10666 transitions.
Drop transitions removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 489 rules applied. Total rules applied 489 place count 5895 transition count 10177
Reduce places removed 489 places and 0 transitions.
Iterating post reduction 1 with 489 rules applied. Total rules applied 978 place count 5406 transition count 10177
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 990 place count 5394 transition count 10153
Iterating global reduction 2 with 12 rules applied. Total rules applied 1002 place count 5394 transition count 10153
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 1142 place count 5324 transition count 10083
Applied a total of 1142 rules in 2527 ms. Remains 5324 /5895 variables (removed 571) and now considering 10083/10666 (removed 583) transitions.
// Phase 1: matrix 10083 rows 5324 cols
[2023-03-11 03:20:25] [INFO ] Computed 141 place invariants in 94 ms
[2023-03-11 03:20:28] [INFO ] Implicit Places using invariants in 3477 ms returned []
Implicit Place search using SMT only with invariants took 3480 ms to find 0 implicit places.
[2023-03-11 03:20:28] [INFO ] Invariant cache hit.
[2023-03-11 03:20:33] [INFO ] Dead Transitions using invariants and state equation in 5164 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5324/5895 places, 10083/10666 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11173 ms. Remains : 5324/5895 places, 10083/10666 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-070-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s100 1) (GEQ s2304 1)), p1:(GEQ s795 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 638 steps with 0 reset in 24 ms.
FORMULA CANConstruction-PT-070-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-070-LTLFireability-03 finished in 11302 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)))'
Support contains 2 out of 5895 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5895/5895 places, 10666/10666 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 5882 transition count 10640
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 5882 transition count 10640
Applied a total of 26 rules in 2011 ms. Remains 5882 /5895 variables (removed 13) and now considering 10640/10666 (removed 26) transitions.
// Phase 1: matrix 10640 rows 5882 cols
[2023-03-11 03:20:35] [INFO ] Computed 141 place invariants in 100 ms
[2023-03-11 03:20:39] [INFO ] Implicit Places using invariants in 3702 ms returned []
Implicit Place search using SMT only with invariants took 3705 ms to find 0 implicit places.
[2023-03-11 03:20:39] [INFO ] Invariant cache hit.
[2023-03-11 03:20:45] [INFO ] Dead Transitions using invariants and state equation in 5899 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5882/5895 places, 10640/10666 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11617 ms. Remains : 5882/5895 places, 10640/10666 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-070-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s104 1) (GEQ s5613 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 1183 steps with 0 reset in 26 ms.
FORMULA CANConstruction-PT-070-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-070-LTLFireability-04 finished in 11769 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((G(F(p0))||G(p1))))'
Support contains 2 out of 5895 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5895/5895 places, 10666/10666 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 5895 transition count 10176
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 5405 transition count 10176
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 991 place count 5394 transition count 10154
Iterating global reduction 2 with 11 rules applied. Total rules applied 1002 place count 5394 transition count 10154
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 1142 place count 5324 transition count 10084
Applied a total of 1142 rules in 2728 ms. Remains 5324 /5895 variables (removed 571) and now considering 10084/10666 (removed 582) transitions.
// Phase 1: matrix 10084 rows 5324 cols
[2023-03-11 03:20:48] [INFO ] Computed 141 place invariants in 99 ms
[2023-03-11 03:20:51] [INFO ] Implicit Places using invariants in 3598 ms returned []
Implicit Place search using SMT only with invariants took 3599 ms to find 0 implicit places.
[2023-03-11 03:20:51] [INFO ] Invariant cache hit.
[2023-03-11 03:20:56] [INFO ] Dead Transitions using invariants and state equation in 4902 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5324/5895 places, 10084/10666 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11233 ms. Remains : 5324/5895 places, 10084/10666 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-070-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s4577 1), p0:(GEQ s4487 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 161 reset in 1559 ms.
Product exploration explored 100000 steps with 159 reset in 1598 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 : [(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 237 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 7466 steps, including 11 resets, run visited all 2 properties in 185 ms. (steps per millisecond=40 )
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 (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 288 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 5324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5324/5324 places, 10084/10084 transitions.
Applied a total of 0 rules in 1095 ms. Remains 5324 /5324 variables (removed 0) and now considering 10084/10084 (removed 0) transitions.
[2023-03-11 03:21:02] [INFO ] Invariant cache hit.
[2023-03-11 03:21:05] [INFO ] Implicit Places using invariants in 3309 ms returned []
Implicit Place search using SMT only with invariants took 3310 ms to find 0 implicit places.
[2023-03-11 03:21:05] [INFO ] Invariant cache hit.
[2023-03-11 03:21:10] [INFO ] Dead Transitions using invariants and state equation in 5054 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9461 ms. Remains : 5324/5324 places, 10084/10084 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 : [(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 201 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 8571 steps, including 13 resets, run visited all 2 properties in 180 ms. (steps per millisecond=47 )
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 (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 264 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 159 reset in 1667 ms.
Product exploration explored 100000 steps with 160 reset in 1773 ms.
Support contains 2 out of 5324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5324/5324 places, 10084/10084 transitions.
Applied a total of 0 rules in 916 ms. Remains 5324 /5324 variables (removed 0) and now considering 10084/10084 (removed 0) transitions.
[2023-03-11 03:21:16] [INFO ] Invariant cache hit.
[2023-03-11 03:21:19] [INFO ] Implicit Places using invariants in 3199 ms returned []
Implicit Place search using SMT only with invariants took 3212 ms to find 0 implicit places.
[2023-03-11 03:21:19] [INFO ] Invariant cache hit.
[2023-03-11 03:21:23] [INFO ] Dead Transitions using invariants and state equation in 4776 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8923 ms. Remains : 5324/5324 places, 10084/10084 transitions.
Treatment of property CANConstruction-PT-070-LTLFireability-05 finished in 38903 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(F(p0))&&F(p1))))'
Support contains 2 out of 5895 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5895/5895 places, 10666/10666 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 5884 transition count 10644
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 5884 transition count 10644
Applied a total of 22 rules in 1909 ms. Remains 5884 /5895 variables (removed 11) and now considering 10644/10666 (removed 22) transitions.
// Phase 1: matrix 10644 rows 5884 cols
[2023-03-11 03:21:26] [INFO ] Computed 141 place invariants in 102 ms
[2023-03-11 03:21:30] [INFO ] Implicit Places using invariants in 3676 ms returned []
Implicit Place search using SMT only with invariants took 3678 ms to find 0 implicit places.
[2023-03-11 03:21:30] [INFO ] Invariant cache hit.
[2023-03-11 03:21:36] [INFO ] Dead Transitions using invariants and state equation in 5991 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5884/5895 places, 10644/10666 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11579 ms. Remains : 5884/5895 places, 10644/10666 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-070-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s2138 1), p1:(GEQ s5690 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 1138 steps with 0 reset in 19 ms.
FORMULA CANConstruction-PT-070-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-070-LTLFireability-06 finished in 11871 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((p0 U G(p1)))))'
Support contains 2 out of 5895 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5895/5895 places, 10666/10666 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 5884 transition count 10644
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 5884 transition count 10644
Applied a total of 22 rules in 1978 ms. Remains 5884 /5895 variables (removed 11) and now considering 10644/10666 (removed 22) transitions.
// Phase 1: matrix 10644 rows 5884 cols
[2023-03-11 03:21:38] [INFO ] Computed 141 place invariants in 106 ms
[2023-03-11 03:21:42] [INFO ] Implicit Places using invariants in 3892 ms returned []
Implicit Place search using SMT only with invariants took 3894 ms to find 0 implicit places.
[2023-03-11 03:21:42] [INFO ] Invariant cache hit.
[2023-03-11 03:21:48] [INFO ] Dead Transitions using invariants and state equation in 5903 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5884/5895 places, 10644/10666 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11779 ms. Remains : 5884/5895 places, 10644/10666 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : CANConstruction-PT-070-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LT s1798 1), p0:(GEQ s3026 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5337 steps with 4 reset in 100 ms.
FORMULA CANConstruction-PT-070-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-070-LTLFireability-07 finished in 12118 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((((!p0&&F(p1)) U X(p1))||(G(p3)&&p2)))))'
Support contains 5 out of 5895 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5895/5895 places, 10666/10666 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 5883 transition count 10642
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 5883 transition count 10642
Applied a total of 24 rules in 1931 ms. Remains 5883 /5895 variables (removed 12) and now considering 10642/10666 (removed 24) transitions.
// Phase 1: matrix 10642 rows 5883 cols
[2023-03-11 03:21:50] [INFO ] Computed 141 place invariants in 107 ms
[2023-03-11 03:21:54] [INFO ] Implicit Places using invariants in 3561 ms returned []
Implicit Place search using SMT only with invariants took 3562 ms to find 0 implicit places.
[2023-03-11 03:21:54] [INFO ] Invariant cache hit.
[2023-03-11 03:21:59] [INFO ] Dead Transitions using invariants and state equation in 5878 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5883/5895 places, 10642/10666 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11379 ms. Remains : 5883/5895 places, 10642/10666 transitions.
Stuttering acceptance computed with spot in 372 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-070-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=1 dest: 4}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=1 dest: 6}, { cond=(AND p0 p2 p3), acceptance={} source=1 dest: 8}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=6 dest: 8}], [{ cond=(NOT p3), acceptance={} source=7 dest: 0}, { cond=p3, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p1) p3), acceptance={} source=8 dest: 7}]], initial=2, aps=[p0:(AND (GEQ s230 1) (GEQ s445 1)), p2:(AND (GEQ s230 1) (GEQ s445 1)), p3:(GEQ s4796 1), p1:(AND (GEQ s67 1) (GEQ s846 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, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1219 steps with 0 reset in 22 ms.
FORMULA CANConstruction-PT-070-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-070-LTLFireability-09 finished in 11838 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 1 out of 5895 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5895/5895 places, 10666/10666 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 5895 transition count 10176
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 5405 transition count 10176
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 992 place count 5393 transition count 10152
Iterating global reduction 2 with 12 rules applied. Total rules applied 1004 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 1144 place count 5323 transition count 10082
Applied a total of 1144 rules in 2576 ms. Remains 5323 /5895 variables (removed 572) and now considering 10082/10666 (removed 584) transitions.
// Phase 1: matrix 10082 rows 5323 cols
[2023-03-11 03:22:02] [INFO ] Computed 141 place invariants in 68 ms
[2023-03-11 03:22:06] [INFO ] Implicit Places using invariants in 3588 ms returned []
Implicit Place search using SMT only with invariants took 3592 ms to find 0 implicit places.
[2023-03-11 03:22:06] [INFO ] Invariant cache hit.
[2023-03-11 03:22:11] [INFO ] Dead Transitions using invariants and state equation in 5140 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5323/5895 places, 10082/10666 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11311 ms. Remains : 5323/5895 places, 10082/10666 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-070-LTLFireability-10 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:(GEQ s2334 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 586 steps with 0 reset in 9 ms.
FORMULA CANConstruction-PT-070-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-070-LTLFireability-10 finished in 11400 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(G(p0)))'
Support contains 4 out of 5895 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5895/5895 places, 10666/10666 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 5895 transition count 10180
Reduce places removed 486 places and 0 transitions.
Iterating post reduction 1 with 486 rules applied. Total rules applied 972 place count 5409 transition count 10180
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 972 place count 5409 transition count 10178
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 976 place count 5407 transition count 10178
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 989 place count 5394 transition count 10152
Iterating global reduction 2 with 13 rules applied. Total rules applied 1002 place count 5394 transition count 10152
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 2 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 1138 place count 5326 transition count 10084
Applied a total of 1138 rules in 2596 ms. Remains 5326 /5895 variables (removed 569) and now considering 10084/10666 (removed 582) transitions.
// Phase 1: matrix 10084 rows 5326 cols
[2023-03-11 03:22:14] [INFO ] Computed 141 place invariants in 94 ms
[2023-03-11 03:22:17] [INFO ] Implicit Places using invariants in 3552 ms returned []
Implicit Place search using SMT only with invariants took 3556 ms to find 0 implicit places.
[2023-03-11 03:22:17] [INFO ] Invariant cache hit.
[2023-03-11 03:22:23] [INFO ] Dead Transitions using invariants and state equation in 5260 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5326/5895 places, 10084/10666 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11414 ms. Remains : 5326/5895 places, 10084/10666 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-070-LTLFireability-13 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 s34 1) (GEQ s85 1) (OR (LT s60 1) (LT s349 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 609 steps with 0 reset in 19 ms.
FORMULA CANConstruction-PT-070-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-070-LTLFireability-13 finished in 11503 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||G(p1)))&&F(p2)))'
Support contains 4 out of 5895 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5895/5895 places, 10666/10666 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 5884 transition count 10644
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 5884 transition count 10644
Applied a total of 22 rules in 2034 ms. Remains 5884 /5895 variables (removed 11) and now considering 10644/10666 (removed 22) transitions.
// Phase 1: matrix 10644 rows 5884 cols
[2023-03-11 03:22:25] [INFO ] Computed 141 place invariants in 105 ms
[2023-03-11 03:22:29] [INFO ] Implicit Places using invariants in 3871 ms returned []
Implicit Place search using SMT only with invariants took 3874 ms to find 0 implicit places.
[2023-03-11 03:22:29] [INFO ] Invariant cache hit.
[2023-03-11 03:22:34] [INFO ] Dead Transitions using invariants and state equation in 5435 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5884/5895 places, 10644/10666 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11345 ms. Remains : 5884/5895 places, 10644/10666 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : CANConstruction-PT-070-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s4084 1), p0:(GEQ s4535 1), p1:(OR (LT s515 1) (LT s678 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 701 steps with 0 reset in 17 ms.
FORMULA CANConstruction-PT-070-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-070-LTLFireability-14 finished in 11555 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(G(p0)))'
Support contains 1 out of 5895 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5895/5895 places, 10666/10666 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 5895 transition count 10176
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 5405 transition count 10176
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 992 place count 5393 transition count 10152
Iterating global reduction 2 with 12 rules applied. Total rules applied 1004 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 1144 place count 5323 transition count 10082
Applied a total of 1144 rules in 2660 ms. Remains 5323 /5895 variables (removed 572) and now considering 10082/10666 (removed 584) transitions.
// Phase 1: matrix 10082 rows 5323 cols
[2023-03-11 03:22:37] [INFO ] Computed 141 place invariants in 58 ms
[2023-03-11 03:22:41] [INFO ] Implicit Places using invariants in 3627 ms returned []
Implicit Place search using SMT only with invariants took 3628 ms to find 0 implicit places.
[2023-03-11 03:22:41] [INFO ] Invariant cache hit.
[2023-03-11 03:22:46] [INFO ] Dead Transitions using invariants and state equation in 5118 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5323/5895 places, 10082/10666 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11407 ms. Remains : 5323/5895 places, 10082/10666 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-070-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s3053 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 662 steps with 0 reset in 10 ms.
FORMULA CANConstruction-PT-070-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-070-LTLFireability-15 finished in 11483 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((G(F(p0))||G(p1))))'
[2023-03-11 03:22:46] [INFO ] Flatten gal took : 379 ms
[2023-03-11 03:22:46] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-11 03:22:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5895 places, 10666 transitions and 41212 arcs took 63 ms.
Total runtime 281987 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CANConstruction-PT-070
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

BK_STOP 1678505023047

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 CANConstruction-PT-070-LTLFireability-05
lola: time limit : 3595 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-070-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 0/3595 1/32 CANConstruction-PT-070-LTLFireability-05 12187 m, 2437 m/sec, 25181 t fired, .

Time elapsed: 5 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-070-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3595 5/32 CANConstruction-PT-070-LTLFireability-05 94354 m, 16433 m/sec, 207227 t fired, .

Time elapsed: 10 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-070-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3595 9/32 CANConstruction-PT-070-LTLFireability-05 174610 m, 16051 m/sec, 389159 t fired, .

Time elapsed: 15 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-070-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3595 12/32 CANConstruction-PT-070-LTLFireability-05 253080 m, 15694 m/sec, 569411 t fired, .

Time elapsed: 20 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-070-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3595 15/32 CANConstruction-PT-070-LTLFireability-05 331590 m, 15702 m/sec, 749198 t fired, .

Time elapsed: 25 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-070-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3595 18/32 CANConstruction-PT-070-LTLFireability-05 402318 m, 14145 m/sec, 912710 t fired, .

Time elapsed: 30 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-070-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3595 21/32 CANConstruction-PT-070-LTLFireability-05 470629 m, 13662 m/sec, 1071753 t fired, .

Time elapsed: 35 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-070-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3595 24/32 CANConstruction-PT-070-LTLFireability-05 544085 m, 14691 m/sec, 1246779 t fired, .

Time elapsed: 40 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-070-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3595 27/32 CANConstruction-PT-070-LTLFireability-05 618772 m, 14937 m/sec, 1417567 t fired, .

Time elapsed: 45 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-070-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3595 31/32 CANConstruction-PT-070-LTLFireability-05 690657 m, 14377 m/sec, 1585019 t fired, .

Time elapsed: 50 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for CANConstruction-PT-070-LTLFireability-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-070-LTLFireability-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANConstruction-PT-070-LTLFireability-05: LTL unknown AGGR


Time elapsed: 55 secs. Pages in use: 32

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="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-070, 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-167813692800668"
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 [ "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 ;