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-167813692800651.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-050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692800651
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 7.6K Feb 25 21:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 21:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 21:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 21:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K 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 12K Feb 25 21:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 21:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 21:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 3.8M 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-050-LTLCardinality-00
FORMULA_NAME CANConstruction-PT-050-LTLCardinality-01
FORMULA_NAME CANConstruction-PT-050-LTLCardinality-02
FORMULA_NAME CANConstruction-PT-050-LTLCardinality-03
FORMULA_NAME CANConstruction-PT-050-LTLCardinality-04
FORMULA_NAME CANConstruction-PT-050-LTLCardinality-05
FORMULA_NAME CANConstruction-PT-050-LTLCardinality-06
FORMULA_NAME CANConstruction-PT-050-LTLCardinality-07
FORMULA_NAME CANConstruction-PT-050-LTLCardinality-08
FORMULA_NAME CANConstruction-PT-050-LTLCardinality-09
FORMULA_NAME CANConstruction-PT-050-LTLCardinality-10
FORMULA_NAME CANConstruction-PT-050-LTLCardinality-11
FORMULA_NAME CANConstruction-PT-050-LTLCardinality-12
FORMULA_NAME CANConstruction-PT-050-LTLCardinality-13
FORMULA_NAME CANConstruction-PT-050-LTLCardinality-14
FORMULA_NAME CANConstruction-PT-050-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678504309481

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-050
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:11:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 03:11:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:11:52] [INFO ] Load time of PNML (sax parser for PT used): 330 ms
[2023-03-11 03:11:52] [INFO ] Transformed 5602 places.
[2023-03-11 03:11:52] [INFO ] Transformed 10400 transitions.
[2023-03-11 03:11:52] [INFO ] Parsed PT model containing 5602 places and 10400 transitions and 31000 arcs in 532 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANConstruction-PT-050-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 5602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5602/5602 places, 10400/10400 transitions.
Discarding 2379 places :
Symmetric choice reduction at 0 with 2379 rule applications. Total rules 2379 place count 3223 transition count 5642
Iterating global reduction 0 with 2379 rules applied. Total rules applied 4758 place count 3223 transition count 5642
Applied a total of 4758 rules in 1085 ms. Remains 3223 /5602 variables (removed 2379) and now considering 5642/10400 (removed 4758) transitions.
// Phase 1: matrix 5642 rows 3223 cols
[2023-03-11 03:11:53] [INFO ] Computed 101 place invariants in 90 ms
[2023-03-11 03:11:55] [INFO ] Implicit Places using invariants in 2253 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418, 432, 446, 460, 474, 488, 502, 516, 530, 544, 558, 572, 586, 600, 614, 628, 642, 656, 670, 684, 698]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 2335 ms to find 50 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3173/5602 places, 5642/10400 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 3124 transition count 5593
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 3124 transition count 5593
Applied a total of 98 rules in 670 ms. Remains 3124 /3173 variables (removed 49) and now considering 5593/5642 (removed 49) transitions.
// Phase 1: matrix 5593 rows 3124 cols
[2023-03-11 03:11:56] [INFO ] Computed 51 place invariants in 76 ms
[2023-03-11 03:12:00] [INFO ] Implicit Places using invariants in 3481 ms returned []
[2023-03-11 03:12:00] [INFO ] Invariant cache hit.
[2023-03-11 03:12:01] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-11 03:12:13] [INFO ] Implicit Places using invariants and state equation in 13267 ms returned []
Implicit Place search using SMT with State Equation took 16756 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3124/5602 places, 5593/10400 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20848 ms. Remains : 3124/5602 places, 5593/10400 transitions.
Support contains 58 out of 3124 places after structural reductions.
[2023-03-11 03:12:14] [INFO ] Flatten gal took : 357 ms
[2023-03-11 03:12:14] [INFO ] Flatten gal took : 217 ms
[2023-03-11 03:12:14] [INFO ] Input system was already deterministic with 5593 transitions.
Support contains 51 out of 3124 places (down from 58) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 893 ms. (steps per millisecond=11 ) properties (out of 34) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) 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 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) 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 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Running SMT prover for 29 properties.
[2023-03-11 03:12:15] [INFO ] Invariant cache hit.
[2023-03-11 03:12:18] [INFO ] [Real]Absence check using 51 positive place invariants in 69 ms returned sat
[2023-03-11 03:12:18] [INFO ] After 2199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:29
[2023-03-11 03:12:19] [INFO ] [Nat]Absence check using 51 positive place invariants in 61 ms returned sat
[2023-03-11 03:12:25] [INFO ] After 4778ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :17
[2023-03-11 03:12:25] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-11 03:12:31] [INFO ] After 6399ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :12 sat :17
[2023-03-11 03:12:39] [INFO ] After 13568ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :17
Attempting to minimize the solution found.
Minimization took 4037 ms.
[2023-03-11 03:12:43] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :17
Fused 29 Parikh solutions to 13 different solutions.
Parikh walk visited 2 properties in 332 ms.
Support contains 28 out of 3124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3124/3124 places, 5593/5593 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 3124 transition count 5266
Reduce places removed 327 places and 0 transitions.
Iterating post reduction 1 with 327 rules applied. Total rules applied 654 place count 2797 transition count 5266
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 654 place count 2797 transition count 5216
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 754 place count 2747 transition count 5216
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 766 place count 2735 transition count 5192
Iterating global reduction 2 with 12 rules applied. Total rules applied 778 place count 2735 transition count 5192
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 10 rules applied. Total rules applied 788 place count 2735 transition count 5182
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 798 place count 2725 transition count 5182
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 4 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 914 place count 2667 transition count 5124
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 915 place count 2667 transition count 5123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 916 place count 2666 transition count 5123
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 918 place count 2666 transition count 5123
Applied a total of 918 rules in 1830 ms. Remains 2666 /3124 variables (removed 458) and now considering 5123/5593 (removed 470) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1832 ms. Remains : 2666/3124 places, 5123/5593 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 5123 rows 2666 cols
[2023-03-11 03:12:45] [INFO ] Computed 51 place invariants in 102 ms
[2023-03-11 03:12:46] [INFO ] After 452ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 03:12:46] [INFO ] [Nat]Absence check using 51 positive place invariants in 51 ms returned sat
[2023-03-11 03:12:49] [INFO ] After 2155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 03:12:49] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-11 03:12:50] [INFO ] After 1568ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 03:12:52] [INFO ] After 2909ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 864 ms.
[2023-03-11 03:12:52] [INFO ] After 6615ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 37 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 4 properties in 5 ms.
Successfully simplified 12 atomic propositions for a total of 14 simplifications.
FORMULA CANConstruction-PT-050-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 152 stabilizing places and 201 stable transitions
FORMULA CANConstruction-PT-050-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(!p2&&X(p3)&&(p0 U (p1||G(p0))))))))'
Support contains 5 out of 3124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3124/3124 places, 5593/5593 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 3104 transition count 5554
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 3104 transition count 5554
Applied a total of 40 rules in 710 ms. Remains 3104 /3124 variables (removed 20) and now considering 5554/5593 (removed 39) transitions.
// Phase 1: matrix 5554 rows 3104 cols
[2023-03-11 03:12:54] [INFO ] Computed 51 place invariants in 71 ms
[2023-03-11 03:12:55] [INFO ] Implicit Places using invariants in 1876 ms returned []
[2023-03-11 03:12:55] [INFO ] Invariant cache hit.
[2023-03-11 03:12:57] [INFO ] Implicit Places using invariants and state equation in 1764 ms returned []
Implicit Place search using SMT with State Equation took 3647 ms to find 0 implicit places.
[2023-03-11 03:12:57] [INFO ] Invariant cache hit.
[2023-03-11 03:13:00] [INFO ] Dead Transitions using invariants and state equation in 3004 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3104/3124 places, 5554/5593 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7368 ms. Remains : 3104/3124 places, 5554/5593 transitions.
Stuttering acceptance computed with spot in 340 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p1 p2 (NOT p3)) (AND p0 p2 (NOT p3))), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GT s2573 s2674) (GT 1 s1003)), p2:(AND (LEQ s2573 s2674) (LEQ s484 s1373)), p0:(GT 1 s1003), p3:(GT s484 s1373)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 16786 steps with 19 reset in 200 ms.
FORMULA CANConstruction-PT-050-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLCardinality-01 finished in 8037 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 3124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3124/3124 places, 5593/5593 transitions.
Drop transitions removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 0 with 331 rules applied. Total rules applied 331 place count 3124 transition count 5262
Reduce places removed 331 places and 0 transitions.
Iterating post reduction 1 with 331 rules applied. Total rules applied 662 place count 2793 transition count 5262
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 662 place count 2793 transition count 5212
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 762 place count 2743 transition count 5212
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 781 place count 2724 transition count 5174
Iterating global reduction 2 with 19 rules applied. Total rules applied 800 place count 2724 transition count 5174
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 2 with 17 rules applied. Total rules applied 817 place count 2724 transition count 5157
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 834 place count 2707 transition count 5157
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 936 place count 2656 transition count 5106
Applied a total of 936 rules in 1252 ms. Remains 2656 /3124 variables (removed 468) and now considering 5106/5593 (removed 487) transitions.
// Phase 1: matrix 5106 rows 2656 cols
[2023-03-11 03:13:02] [INFO ] Computed 51 place invariants in 88 ms
[2023-03-11 03:13:04] [INFO ] Implicit Places using invariants in 1748 ms returned []
[2023-03-11 03:13:04] [INFO ] Invariant cache hit.
[2023-03-11 03:13:05] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-11 03:13:16] [INFO ] Implicit Places using invariants and state equation in 12069 ms returned []
Implicit Place search using SMT with State Equation took 13826 ms to find 0 implicit places.
[2023-03-11 03:13:16] [INFO ] Redundant transitions in 350 ms returned []
[2023-03-11 03:13:16] [INFO ] Invariant cache hit.
[2023-03-11 03:13:19] [INFO ] Dead Transitions using invariants and state equation in 2291 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2656/3124 places, 5106/5593 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17740 ms. Remains : 2656/3124 places, 5106/5593 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-03 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:(GT s1787 s1715), p1:(LEQ s1938 s74)], 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 322 steps with 0 reset in 7 ms.
FORMULA CANConstruction-PT-050-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLCardinality-03 finished in 17973 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 2 out of 3124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3124/3124 places, 5593/5593 transitions.
Drop transitions removed 333 transitions
Trivial Post-agglo rules discarded 333 transitions
Performed 333 trivial Post agglomeration. Transition count delta: 333
Iterating post reduction 0 with 333 rules applied. Total rules applied 333 place count 3124 transition count 5260
Reduce places removed 333 places and 0 transitions.
Iterating post reduction 1 with 333 rules applied. Total rules applied 666 place count 2791 transition count 5260
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 666 place count 2791 transition count 5210
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 766 place count 2741 transition count 5210
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 787 place count 2720 transition count 5168
Iterating global reduction 2 with 21 rules applied. Total rules applied 808 place count 2720 transition count 5168
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 2 with 19 rules applied. Total rules applied 827 place count 2720 transition count 5149
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 846 place count 2701 transition count 5149
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 944 place count 2652 transition count 5100
Applied a total of 944 rules in 1034 ms. Remains 2652 /3124 variables (removed 472) and now considering 5100/5593 (removed 493) transitions.
// Phase 1: matrix 5100 rows 2652 cols
[2023-03-11 03:13:20] [INFO ] Computed 51 place invariants in 53 ms
[2023-03-11 03:13:22] [INFO ] Implicit Places using invariants in 1771 ms returned []
[2023-03-11 03:13:22] [INFO ] Invariant cache hit.
[2023-03-11 03:13:22] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-11 03:13:32] [INFO ] Implicit Places using invariants and state equation in 10513 ms returned []
Implicit Place search using SMT with State Equation took 12300 ms to find 0 implicit places.
[2023-03-11 03:13:32] [INFO ] Redundant transitions in 344 ms returned []
[2023-03-11 03:13:32] [INFO ] Invariant cache hit.
[2023-03-11 03:13:35] [INFO ] Dead Transitions using invariants and state equation in 2477 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2652/3124 places, 5100/5593 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16164 ms. Remains : 2652/3124 places, 5100/5593 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s1675 s1426)], 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 320 steps with 0 reset in 4 ms.
FORMULA CANConstruction-PT-050-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLCardinality-04 finished in 16229 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 3 out of 3124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3124/3124 places, 5593/5593 transitions.
Drop transitions removed 329 transitions
Trivial Post-agglo rules discarded 329 transitions
Performed 329 trivial Post agglomeration. Transition count delta: 329
Iterating post reduction 0 with 329 rules applied. Total rules applied 329 place count 3124 transition count 5264
Reduce places removed 329 places and 0 transitions.
Iterating post reduction 1 with 329 rules applied. Total rules applied 658 place count 2795 transition count 5264
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 658 place count 2795 transition count 5214
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 758 place count 2745 transition count 5214
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 779 place count 2724 transition count 5172
Iterating global reduction 2 with 21 rules applied. Total rules applied 800 place count 2724 transition count 5172
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 2 with 19 rules applied. Total rules applied 819 place count 2724 transition count 5153
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 838 place count 2705 transition count 5153
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 936 place count 2656 transition count 5104
Applied a total of 936 rules in 1045 ms. Remains 2656 /3124 variables (removed 468) and now considering 5104/5593 (removed 489) transitions.
// Phase 1: matrix 5104 rows 2656 cols
[2023-03-11 03:13:36] [INFO ] Computed 51 place invariants in 52 ms
[2023-03-11 03:13:38] [INFO ] Implicit Places using invariants in 1786 ms returned []
[2023-03-11 03:13:38] [INFO ] Invariant cache hit.
[2023-03-11 03:13:39] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-11 03:13:48] [INFO ] Implicit Places using invariants and state equation in 9890 ms returned []
Implicit Place search using SMT with State Equation took 11681 ms to find 0 implicit places.
[2023-03-11 03:13:48] [INFO ] Redundant transitions in 290 ms returned []
[2023-03-11 03:13:48] [INFO ] Invariant cache hit.
[2023-03-11 03:13:51] [INFO ] Dead Transitions using invariants and state equation in 3229 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2656/3124 places, 5104/5593 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16265 ms. Remains : 2656/3124 places, 5104/5593 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ 3 s1214) (LEQ s106 s79))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 284 reset in 1310 ms.
Stack based approach found an accepted trace after 1101 steps with 2 reset with depth 357 and stack size 356 in 14 ms.
FORMULA CANConstruction-PT-050-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-050-LTLCardinality-05 finished in 17663 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 3124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3124/3124 places, 5593/5593 transitions.
Drop transitions removed 333 transitions
Trivial Post-agglo rules discarded 333 transitions
Performed 333 trivial Post agglomeration. Transition count delta: 333
Iterating post reduction 0 with 333 rules applied. Total rules applied 333 place count 3124 transition count 5260
Reduce places removed 333 places and 0 transitions.
Iterating post reduction 1 with 333 rules applied. Total rules applied 666 place count 2791 transition count 5260
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 666 place count 2791 transition count 5210
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 766 place count 2741 transition count 5210
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 787 place count 2720 transition count 5168
Iterating global reduction 2 with 21 rules applied. Total rules applied 808 place count 2720 transition count 5168
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 2 with 19 rules applied. Total rules applied 827 place count 2720 transition count 5149
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 846 place count 2701 transition count 5149
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 944 place count 2652 transition count 5100
Applied a total of 944 rules in 1031 ms. Remains 2652 /3124 variables (removed 472) and now considering 5100/5593 (removed 493) transitions.
// Phase 1: matrix 5100 rows 2652 cols
[2023-03-11 03:13:54] [INFO ] Computed 51 place invariants in 84 ms
[2023-03-11 03:13:56] [INFO ] Implicit Places using invariants in 1954 ms returned []
[2023-03-11 03:13:56] [INFO ] Invariant cache hit.
[2023-03-11 03:13:57] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-11 03:14:05] [INFO ] Implicit Places using invariants and state equation in 9811 ms returned []
Implicit Place search using SMT with State Equation took 11772 ms to find 0 implicit places.
[2023-03-11 03:14:06] [INFO ] Redundant transitions in 198 ms returned []
[2023-03-11 03:14:06] [INFO ] Invariant cache hit.
[2023-03-11 03:14:08] [INFO ] Dead Transitions using invariants and state equation in 2443 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2652/3124 places, 5100/5593 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15453 ms. Remains : 2652/3124 places, 5100/5593 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s1626)], 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 335 steps with 0 reset in 4 ms.
FORMULA CANConstruction-PT-050-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLCardinality-06 finished in 15557 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 1 out of 3124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3124/3124 places, 5593/5593 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 3103 transition count 5552
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 3103 transition count 5552
Applied a total of 42 rules in 683 ms. Remains 3103 /3124 variables (removed 21) and now considering 5552/5593 (removed 41) transitions.
// Phase 1: matrix 5552 rows 3103 cols
[2023-03-11 03:14:09] [INFO ] Computed 51 place invariants in 67 ms
[2023-03-11 03:14:11] [INFO ] Implicit Places using invariants in 1923 ms returned []
[2023-03-11 03:14:11] [INFO ] Invariant cache hit.
[2023-03-11 03:14:12] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-11 03:14:25] [INFO ] Implicit Places using invariants and state equation in 14508 ms returned []
Implicit Place search using SMT with State Equation took 16434 ms to find 0 implicit places.
[2023-03-11 03:14:25] [INFO ] Invariant cache hit.
[2023-03-11 03:14:28] [INFO ] Dead Transitions using invariants and state equation in 2506 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3103/3124 places, 5552/5593 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19632 ms. Remains : 3103/3124 places, 5552/5593 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-08 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:(GT 1 s1752)], 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 59929 steps with 67 reset in 449 ms.
FORMULA CANConstruction-PT-050-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLCardinality-08 finished in 20200 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&&X(p1))))'
Support contains 4 out of 3124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3124/3124 places, 5593/5593 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 3102 transition count 5550
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 3102 transition count 5550
Applied a total of 44 rules in 682 ms. Remains 3102 /3124 variables (removed 22) and now considering 5550/5593 (removed 43) transitions.
// Phase 1: matrix 5550 rows 3102 cols
[2023-03-11 03:14:29] [INFO ] Computed 51 place invariants in 66 ms
[2023-03-11 03:14:31] [INFO ] Implicit Places using invariants in 1831 ms returned []
[2023-03-11 03:14:31] [INFO ] Invariant cache hit.
[2023-03-11 03:14:32] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-11 03:14:44] [INFO ] Implicit Places using invariants and state equation in 13445 ms returned []
Implicit Place search using SMT with State Equation took 15283 ms to find 0 implicit places.
[2023-03-11 03:14:44] [INFO ] Invariant cache hit.
[2023-03-11 03:14:47] [INFO ] Dead Transitions using invariants and state equation in 2682 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3102/3124 places, 5550/5593 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18650 ms. Remains : 3102/3124 places, 5550/5593 transitions.
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1332 s481), p1:(LEQ s1975 s979)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2638 ms.
Product exploration explored 100000 steps with 50000 reset in 2694 ms.
Computed a total of 151 stabilizing places and 200 stable transitions
Computed a total of 151 stabilizing places and 200 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 7 factoid took 218 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-050-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-050-LTLCardinality-09 finished in 24337 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 3124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3124/3124 places, 5593/5593 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 3104 transition count 5554
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 3104 transition count 5554
Applied a total of 40 rules in 560 ms. Remains 3104 /3124 variables (removed 20) and now considering 5554/5593 (removed 39) transitions.
// Phase 1: matrix 5554 rows 3104 cols
[2023-03-11 03:14:53] [INFO ] Computed 51 place invariants in 67 ms
[2023-03-11 03:14:55] [INFO ] Implicit Places using invariants in 1795 ms returned []
[2023-03-11 03:14:55] [INFO ] Invariant cache hit.
[2023-03-11 03:14:56] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-11 03:15:08] [INFO ] Implicit Places using invariants and state equation in 12723 ms returned []
Implicit Place search using SMT with State Equation took 14522 ms to find 0 implicit places.
[2023-03-11 03:15:08] [INFO ] Invariant cache hit.
[2023-03-11 03:15:11] [INFO ] Dead Transitions using invariants and state equation in 2723 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3104/3124 places, 5554/5593 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17807 ms. Remains : 3104/3124 places, 5554/5593 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s721 s2814)], 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]]
Product exploration explored 100000 steps with 50000 reset in 2631 ms.
Product exploration explored 100000 steps with 50000 reset in 2402 ms.
Computed a total of 151 stabilizing places and 200 stable transitions
Computed a total of 151 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-050-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-050-LTLCardinality-10 finished in 23168 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(X(p0))&&(F(!p0)||!(p0 U p1)))))'
Support contains 4 out of 3124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3124/3124 places, 5593/5593 transitions.
Drop transitions removed 333 transitions
Trivial Post-agglo rules discarded 333 transitions
Performed 333 trivial Post agglomeration. Transition count delta: 333
Iterating post reduction 0 with 333 rules applied. Total rules applied 333 place count 3124 transition count 5260
Reduce places removed 333 places and 0 transitions.
Iterating post reduction 1 with 333 rules applied. Total rules applied 666 place count 2791 transition count 5260
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 666 place count 2791 transition count 5210
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 766 place count 2741 transition count 5210
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 786 place count 2721 transition count 5170
Iterating global reduction 2 with 20 rules applied. Total rules applied 806 place count 2721 transition count 5170
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 2 with 18 rules applied. Total rules applied 824 place count 2721 transition count 5152
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 842 place count 2703 transition count 5152
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 942 place count 2653 transition count 5102
Applied a total of 942 rules in 875 ms. Remains 2653 /3124 variables (removed 471) and now considering 5102/5593 (removed 491) transitions.
// Phase 1: matrix 5102 rows 2653 cols
[2023-03-11 03:15:17] [INFO ] Computed 51 place invariants in 81 ms
[2023-03-11 03:15:19] [INFO ] Implicit Places using invariants in 1736 ms returned []
[2023-03-11 03:15:19] [INFO ] Invariant cache hit.
[2023-03-11 03:15:19] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-11 03:15:28] [INFO ] Implicit Places using invariants and state equation in 9318 ms returned []
Implicit Place search using SMT with State Equation took 11069 ms to find 0 implicit places.
[2023-03-11 03:15:28] [INFO ] Redundant transitions in 166 ms returned []
[2023-03-11 03:15:28] [INFO ] Invariant cache hit.
[2023-03-11 03:15:30] [INFO ] Dead Transitions using invariants and state equation in 2345 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2653/3124 places, 5102/5593 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14477 ms. Remains : 2653/3124 places, 5102/5593 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) p1), (NOT p0), (AND p0 p1)]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s555 s2532), p1:(LEQ s1688 s2557)], 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 386 steps with 0 reset in 4 ms.
FORMULA CANConstruction-PT-050-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLCardinality-14 finished in 14669 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(X(G(p0)))))'
Support contains 2 out of 3124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3124/3124 places, 5593/5593 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 3102 transition count 5550
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 3102 transition count 5550
Applied a total of 44 rules in 474 ms. Remains 3102 /3124 variables (removed 22) and now considering 5550/5593 (removed 43) transitions.
// Phase 1: matrix 5550 rows 3102 cols
[2023-03-11 03:15:31] [INFO ] Computed 51 place invariants in 66 ms
[2023-03-11 03:15:33] [INFO ] Implicit Places using invariants in 1808 ms returned []
[2023-03-11 03:15:33] [INFO ] Invariant cache hit.
[2023-03-11 03:15:34] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-11 03:15:47] [INFO ] Implicit Places using invariants and state equation in 13679 ms returned []
Implicit Place search using SMT with State Equation took 15507 ms to find 0 implicit places.
[2023-03-11 03:15:47] [INFO ] Invariant cache hit.
[2023-03-11 03:15:49] [INFO ] Dead Transitions using invariants and state equation in 2232 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3102/3124 places, 5550/5593 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18215 ms. Remains : 3102/3124 places, 5550/5593 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(GT s1718 s574)], 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-050-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLCardinality-15 finished in 18416 ms.
All properties solved by simple procedures.
Total runtime 237916 ms.
ITS solved all properties within timeout

BK_STOP 1678504549721

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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-050"
export BK_EXAMINATION="LTLCardinality"
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-050, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r039-tajo-167813692800651"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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