Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r327-tall-167889200000723.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ResAllocation-PT-R003C100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r327-tall-167889200000723
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.4K Feb 25 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 721K Mar 5 18:23 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 ResAllocation-PT-R003C100-LTLCardinality-00
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-01
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-02
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-03
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-04
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-05
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-06
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-07
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-08
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-09
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-10
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-11
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-12
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-13
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-14
FORMULA_NAME ResAllocation-PT-R003C100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679055740081

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=ResAllocation-PT-R003C100
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 12:22:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 12:22:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 12:22:21] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2023-03-17 12:22:21] [INFO ] Transformed 600 places.
[2023-03-17 12:22:21] [INFO ] Transformed 400 transitions.
[2023-03-17 12:22:21] [INFO ] Parsed PT model containing 600 places and 400 transitions and 1794 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA ResAllocation-PT-R003C100-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C100-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C100-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C100-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C100-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C100-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 400/400 transitions.
Applied a total of 0 rules in 48 ms. Remains 600 /600 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 600 cols
[2023-03-17 12:22:22] [INFO ] Computed 300 place invariants in 20 ms
[2023-03-17 12:22:22] [INFO ] Implicit Places using invariants in 501 ms returned [595, 597, 599]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 542 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 597/600 places, 400/400 transitions.
Applied a total of 0 rules in 18 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 610 ms. Remains : 597/600 places, 400/400 transitions.
Support contains 31 out of 597 places after structural reductions.
[2023-03-17 12:22:22] [INFO ] Flatten gal took : 100 ms
[2023-03-17 12:22:22] [INFO ] Flatten gal took : 39 ms
[2023-03-17 12:22:23] [INFO ] Input system was already deterministic with 400 transitions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 20) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 400 rows 597 cols
[2023-03-17 12:22:23] [INFO ] Computed 297 place invariants in 7 ms
[2023-03-17 12:22:24] [INFO ] [Real]Absence check using 297 positive place invariants in 83 ms returned sat
[2023-03-17 12:22:24] [INFO ] After 268ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-17 12:22:24] [INFO ] [Nat]Absence check using 297 positive place invariants in 62 ms returned sat
[2023-03-17 12:22:24] [INFO ] After 251ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 6 atomic propositions for a total of 10 simplifications.
FORMULA ResAllocation-PT-R003C100-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA ResAllocation-PT-R003C100-LTLCardinality-15 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' '!(F(G(p0)))'
Support contains 2 out of 597 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 597/597 places, 400/400 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 0 with 198 rules applied. Total rules applied 198 place count 498 transition count 301
Applied a total of 198 rules in 72 ms. Remains 498 /597 variables (removed 99) and now considering 301/400 (removed 99) transitions.
// Phase 1: matrix 301 rows 498 cols
[2023-03-17 12:22:24] [INFO ] Computed 297 place invariants in 2 ms
[2023-03-17 12:22:25] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-03-17 12:22:25] [INFO ] Invariant cache hit.
[2023-03-17 12:22:25] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
[2023-03-17 12:22:25] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-17 12:22:25] [INFO ] Invariant cache hit.
[2023-03-17 12:22:25] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 498/597 places, 301/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1126 ms. Remains : 498/597 places, 301/400 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLCardinality-01 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 s361 s126)], 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 198 steps with 0 reset in 14 ms.
FORMULA ResAllocation-PT-R003C100-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLCardinality-01 finished in 1335 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((G(p0) U (F(G(p1)) U (p1&&F(p0)))))))'
Support contains 3 out of 597 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 400/400 transitions.
Applied a total of 0 rules in 10 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 597 cols
[2023-03-17 12:22:25] [INFO ] Computed 297 place invariants in 2 ms
[2023-03-17 12:22:26] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-17 12:22:26] [INFO ] Invariant cache hit.
[2023-03-17 12:22:26] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 837 ms to find 0 implicit places.
[2023-03-17 12:22:26] [INFO ] Invariant cache hit.
[2023-03-17 12:22:26] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1071 ms. Remains : 597/597 places, 400/400 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 6}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ s101 s459), p0:(LEQ 1 s403)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 220 steps with 0 reset in 9 ms.
FORMULA ResAllocation-PT-R003C100-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLCardinality-02 finished in 1428 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((p0&&F(G(p0)))))))'
Support contains 1 out of 597 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 400/400 transitions.
Applied a total of 0 rules in 13 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2023-03-17 12:22:27] [INFO ] Invariant cache hit.
[2023-03-17 12:22:27] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-17 12:22:27] [INFO ] Invariant cache hit.
[2023-03-17 12:22:28] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
[2023-03-17 12:22:28] [INFO ] Invariant cache hit.
[2023-03-17 12:22:28] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1002 ms. Remains : 597/597 places, 400/400 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GT 1 s119)], 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R003C100-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLCardinality-03 finished in 1201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((G(F(p0))||(p1&&F(p0)))))))'
Support contains 4 out of 597 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 400/400 transitions.
Applied a total of 0 rules in 9 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2023-03-17 12:22:28] [INFO ] Invariant cache hit.
[2023-03-17 12:22:28] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-17 12:22:28] [INFO ] Invariant cache hit.
[2023-03-17 12:22:29] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
[2023-03-17 12:22:29] [INFO ] Invariant cache hit.
[2023-03-17 12:22:29] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 958 ms. Remains : 597/597 places, 400/400 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s197 s202), p1:(GT s230 s508)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1267 reset in 1128 ms.
Product exploration explored 100000 steps with 1309 reset in 1179 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 217 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 90 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 1 factoid took 291 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-17 12:22:33] [INFO ] Invariant cache hit.
[2023-03-17 12:22:33] [INFO ] [Real]Absence check using 297 positive place invariants in 147 ms returned sat
[2023-03-17 12:22:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 12:22:34] [INFO ] [Real]Absence check using state equation in 1180 ms returned sat
[2023-03-17 12:22:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 12:22:34] [INFO ] [Nat]Absence check using 297 positive place invariants in 110 ms returned sat
[2023-03-17 12:22:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 12:22:35] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2023-03-17 12:22:35] [INFO ] Computed and/alt/rep : 300/300/300 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-17 12:22:35] [INFO ] Added : 46 causal constraints over 10 iterations in 340 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 597 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2023-03-17 12:22:35] [INFO ] Invariant cache hit.
[2023-03-17 12:22:36] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-17 12:22:36] [INFO ] Invariant cache hit.
[2023-03-17 12:22:36] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
[2023-03-17 12:22:36] [INFO ] Invariant cache hit.
[2023-03-17 12:22:36] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1023 ms. Remains : 597/597 places, 400/400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 189 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 413 steps, including 2 resets, run visited all 3 properties in 9 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 1 factoid took 280 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-17 12:22:37] [INFO ] Invariant cache hit.
[2023-03-17 12:22:38] [INFO ] [Real]Absence check using 297 positive place invariants in 141 ms returned sat
[2023-03-17 12:22:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 12:22:39] [INFO ] [Real]Absence check using state equation in 1183 ms returned sat
[2023-03-17 12:22:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 12:22:39] [INFO ] [Nat]Absence check using 297 positive place invariants in 115 ms returned sat
[2023-03-17 12:22:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 12:22:40] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2023-03-17 12:22:40] [INFO ] Computed and/alt/rep : 300/300/300 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-17 12:22:40] [INFO ] Added : 46 causal constraints over 10 iterations in 318 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1290 reset in 1026 ms.
Stack based approach found an accepted trace after 32594 steps with 419 reset with depth 175 and stack size 175 in 368 ms.
FORMULA ResAllocation-PT-R003C100-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ResAllocation-PT-R003C100-LTLCardinality-04 finished in 13654 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 597 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 400/400 transitions.
Applied a total of 0 rules in 8 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2023-03-17 12:22:42] [INFO ] Invariant cache hit.
[2023-03-17 12:22:42] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-17 12:22:42] [INFO ] Invariant cache hit.
[2023-03-17 12:22:42] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
[2023-03-17 12:22:42] [INFO ] Invariant cache hit.
[2023-03-17 12:22:43] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 987 ms. Remains : 597/597 places, 400/400 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLCardinality-05 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:(LEQ 1 s591)], 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 111 steps with 0 reset in 5 ms.
FORMULA ResAllocation-PT-R003C100-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLCardinality-05 finished in 1090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 597 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 597/597 places, 400/400 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 497 transition count 300
Applied a total of 200 rules in 28 ms. Remains 497 /597 variables (removed 100) and now considering 300/400 (removed 100) transitions.
// Phase 1: matrix 300 rows 497 cols
[2023-03-17 12:22:43] [INFO ] Computed 297 place invariants in 2 ms
[2023-03-17 12:22:43] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-17 12:22:43] [INFO ] Invariant cache hit.
[2023-03-17 12:22:43] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
[2023-03-17 12:22:43] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-17 12:22:43] [INFO ] Invariant cache hit.
[2023-03-17 12:22:44] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 497/597 places, 300/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 910 ms. Remains : 497/597 places, 300/400 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLCardinality-08 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 s346 s217)], 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 411 steps with 1 reset in 7 ms.
FORMULA ResAllocation-PT-R003C100-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C100-LTLCardinality-08 finished in 1008 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((X((F(!(p0 U p1))&&X(p2)))||F(X(!p0)))))'
Support contains 4 out of 597 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 400/400 transitions.
Applied a total of 0 rules in 10 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 597 cols
[2023-03-17 12:22:44] [INFO ] Computed 297 place invariants in 2 ms
[2023-03-17 12:22:44] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-17 12:22:44] [INFO ] Invariant cache hit.
[2023-03-17 12:22:45] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
[2023-03-17 12:22:45] [INFO ] Invariant cache hit.
[2023-03-17 12:22:45] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 987 ms. Remains : 597/597 places, 400/400 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 p1), (AND p0 (NOT p2))]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 s91), p1:(LEQ s237 s38), p2:(GT 1 s360)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2438 reset in 1121 ms.
Product exploration explored 100000 steps with 2321 reset in 1153 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 1 factoid took 234 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 p1), (AND p0 (NOT p2))]
Finished random walk after 70 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND p0 (NOT p1) p2)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND p0 (NOT p2))), (F (NOT p0)), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 255 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 p1), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 156 ms :[(OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 p1), (AND p0 (NOT p2))]
Support contains 4 out of 597 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2023-03-17 12:22:48] [INFO ] Invariant cache hit.
[2023-03-17 12:22:48] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-17 12:22:48] [INFO ] Invariant cache hit.
[2023-03-17 12:22:49] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
[2023-03-17 12:22:49] [INFO ] Invariant cache hit.
[2023-03-17 12:22:49] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 975 ms. Remains : 597/597 places, 400/400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 1 factoid took 467 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 p1), (AND p0 (NOT p2))]
Finished random walk after 80 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND p0 (NOT p1) p2)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND p0 (NOT p2))), (F (NOT p0)), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 291 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 p1), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 169 ms :[(OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 p1), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 158 ms :[(OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 p1), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 2513 reset in 1039 ms.
Product exploration explored 100000 steps with 2456 reset in 1144 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 141 ms :[(OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 p1), (AND p0 (NOT p2))]
Support contains 4 out of 597 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 597/597 places, 400/400 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 597 transition count 400
Deduced a syphon composed of 99 places in 0 ms
Applied a total of 99 rules in 65 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2023-03-17 12:22:53] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 400 rows 597 cols
[2023-03-17 12:22:53] [INFO ] Computed 297 place invariants in 2 ms
[2023-03-17 12:22:53] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 597/597 places, 400/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 322 ms. Remains : 597/597 places, 400/400 transitions.
Support contains 4 out of 597 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 597 cols
[2023-03-17 12:22:53] [INFO ] Computed 297 place invariants in 6 ms
[2023-03-17 12:22:54] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-17 12:22:54] [INFO ] Invariant cache hit.
[2023-03-17 12:22:54] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
[2023-03-17 12:22:54] [INFO ] Invariant cache hit.
[2023-03-17 12:22:54] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 980 ms. Remains : 597/597 places, 400/400 transitions.
Treatment of property ResAllocation-PT-R003C100-LTLCardinality-13 finished in 10764 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 597 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 597 /597 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2023-03-17 12:22:54] [INFO ] Invariant cache hit.
[2023-03-17 12:22:55] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-03-17 12:22:55] [INFO ] Invariant cache hit.
[2023-03-17 12:22:55] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
[2023-03-17 12:22:55] [INFO ] Invariant cache hit.
[2023-03-17 12:22:55] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 930 ms. Remains : 597/597 places, 400/400 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C100-LTLCardinality-14 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 s534 s362)], 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 1140 ms.
Product exploration explored 100000 steps with 50000 reset in 1224 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 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 70 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResAllocation-PT-R003C100-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R003C100-LTLCardinality-14 finished in 3501 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((X((F(!(p0 U p1))&&X(p2)))||F(X(!p0)))))'
Found a Shortening insensitive property : ResAllocation-PT-R003C100-LTLCardinality-13
Stuttering acceptance computed with spot in 161 ms :[(OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 p1), (AND p0 (NOT p2))]
Support contains 4 out of 597 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 597/597 places, 400/400 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 0 with 198 rules applied. Total rules applied 198 place count 498 transition count 301
Applied a total of 198 rules in 21 ms. Remains 498 /597 variables (removed 99) and now considering 301/400 (removed 99) transitions.
// Phase 1: matrix 301 rows 498 cols
[2023-03-17 12:22:58] [INFO ] Computed 297 place invariants in 4 ms
[2023-03-17 12:22:59] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-17 12:22:59] [INFO ] Invariant cache hit.
[2023-03-17 12:22:59] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2023-03-17 12:22:59] [INFO ] Invariant cache hit.
[2023-03-17 12:22:59] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 498/597 places, 301/400 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 860 ms. Remains : 498/597 places, 301/400 transitions.
Running random walk in product with property : ResAllocation-PT-R003C100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 s76), p1:(LEQ s198 s32), p2:(GT 1 s301)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2441 reset in 1100 ms.
Stack based approach found an accepted trace after 36818 steps with 956 reset with depth 81 and stack size 81 in 449 ms.
Treatment of property ResAllocation-PT-R003C100-LTLCardinality-13 finished in 2660 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-17 12:23:01] [INFO ] Flatten gal took : 29 ms
[2023-03-17 12:23:01] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-17 12:23:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 597 places, 400 transitions and 1788 arcs took 6 ms.
Total runtime 39705 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ResAllocation-PT-R003C100
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

FORMULA ResAllocation-PT-R003C100-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679055782310

--------------------
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
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/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:527
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: RELEASE
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 ResAllocation-PT-R003C100-LTLCardinality-13
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ResAllocation-PT-R003C100-LTLCardinality-13
lola: result : false
lola: markings : 325
lola: fired transitions : 445
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ResAllocation-PT-R003C100-LTLCardinality-13: LTL false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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="ResAllocation-PT-R003C100"
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 ResAllocation-PT-R003C100, 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 r327-tall-167889200000723"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C100.tgz
mv ResAllocation-PT-R003C100 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 ;