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

About the Execution of ITS-Tools for ResAllocation-PT-R003C050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
422.056 17115.00 28015.00 340.60 FFFFFFFTTFTFFFTF normal

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.r325-tall-167889197600715.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 itstools
Input is ResAllocation-PT-R003C050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r325-tall-167889197600715
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 8.3K Feb 25 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 25 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 15:20 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.7K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 15:21 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 360K 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-R003C050-LTLCardinality-00
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-01
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-02
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-03
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-04
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-05
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-06
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-07
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-08
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-09
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-10
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-11
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-12
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-13
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-14
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679031283819

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R003C050
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-17 05:34:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-17 05:34:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 05:34:45] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2023-03-17 05:34:45] [INFO ] Transformed 300 places.
[2023-03-17 05:34:45] [INFO ] Transformed 200 transitions.
[2023-03-17 05:34:45] [INFO ] Parsed PT model containing 300 places and 200 transitions and 894 arcs in 138 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 2 formulas.
FORMULA ResAllocation-PT-R003C050-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 200/200 transitions.
Applied a total of 0 rules in 25 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 300 cols
[2023-03-17 05:34:45] [INFO ] Computed 150 place invariants in 22 ms
[2023-03-17 05:34:46] [INFO ] Implicit Places using invariants in 504 ms returned []
[2023-03-17 05:34:46] [INFO ] Invariant cache hit.
[2023-03-17 05:34:46] [INFO ] Implicit Places using invariants and state equation in 242 ms returned [295, 297, 299]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 776 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 297/300 places, 200/200 transitions.
Applied a total of 0 rules in 19 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 820 ms. Remains : 297/300 places, 200/200 transitions.
Support contains 39 out of 297 places after structural reductions.
[2023-03-17 05:34:46] [INFO ] Flatten gal took : 49 ms
[2023-03-17 05:34:46] [INFO ] Flatten gal took : 26 ms
[2023-03-17 05:34:46] [INFO ] Input system was already deterministic with 200 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 458 ms. (steps per millisecond=21 ) properties (out of 29) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 200 rows 297 cols
[2023-03-17 05:34:47] [INFO ] Computed 147 place invariants in 5 ms
[2023-03-17 05:34:47] [INFO ] [Real]Absence check using 147 positive place invariants in 19 ms returned sat
[2023-03-17 05:34:47] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :12 sat :0 real:1
[2023-03-17 05:34:47] [INFO ] [Nat]Absence check using 147 positive place invariants in 20 ms returned sat
[2023-03-17 05:34:47] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :13 sat :0
Fused 13 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA ResAllocation-PT-R003C050-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 13 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ResAllocation-PT-R003C050-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U (F(p1)||X(p0))))))'
Support contains 4 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 6 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2023-03-17 05:34:48] [INFO ] Invariant cache hit.
[2023-03-17 05:34:48] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-17 05:34:48] [INFO ] Invariant cache hit.
[2023-03-17 05:34:48] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2023-03-17 05:34:48] [INFO ] Invariant cache hit.
[2023-03-17 05:34:48] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 505 ms. Remains : 297/297 places, 200/200 transitions.
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLCardinality-00 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=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s213 s127), p0:(GT s287 s69)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2473 steps with 32 reset in 40 ms.
FORMULA ResAllocation-PT-R003C050-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-LTLCardinality-00 finished in 889 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 297 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 247 transition count 150
Applied a total of 100 rules in 33 ms. Remains 247 /297 variables (removed 50) and now considering 150/200 (removed 50) transitions.
// Phase 1: matrix 150 rows 247 cols
[2023-03-17 05:34:48] [INFO ] Computed 147 place invariants in 2 ms
[2023-03-17 05:34:49] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-17 05:34:49] [INFO ] Invariant cache hit.
[2023-03-17 05:34:49] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2023-03-17 05:34:49] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-17 05:34:49] [INFO ] Invariant cache hit.
[2023-03-17 05:34:49] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 247/297 places, 150/200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 519 ms. Remains : 247/297 places, 150/200 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLCardinality-02 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 s108)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2408 reset in 702 ms.
Stack based approach found an accepted trace after 1653 steps with 45 reset with depth 8 and stack size 8 in 12 ms.
FORMULA ResAllocation-PT-R003C050-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ResAllocation-PT-R003C050-LTLCardinality-02 finished in 1336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 297 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 249 transition count 152
Applied a total of 96 rules in 20 ms. Remains 249 /297 variables (removed 48) and now considering 152/200 (removed 48) transitions.
// Phase 1: matrix 152 rows 249 cols
[2023-03-17 05:34:50] [INFO ] Computed 147 place invariants in 1 ms
[2023-03-17 05:34:50] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-17 05:34:50] [INFO ] Invariant cache hit.
[2023-03-17 05:34:50] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-17 05:34:50] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-17 05:34:50] [INFO ] Invariant cache hit.
[2023-03-17 05:34:50] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 249/297 places, 152/200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 441 ms. Remains : 249/297 places, 152/200 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R003C050-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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s199 s115), p1:(LEQ s198 s137)], 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 206 steps with 4 reset in 2 ms.
FORMULA ResAllocation-PT-R003C050-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-LTLCardinality-03 finished in 635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 297 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 249 transition count 152
Applied a total of 96 rules in 18 ms. Remains 249 /297 variables (removed 48) and now considering 152/200 (removed 48) transitions.
// Phase 1: matrix 152 rows 249 cols
[2023-03-17 05:34:50] [INFO ] Computed 147 place invariants in 3 ms
[2023-03-17 05:34:51] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-17 05:34:51] [INFO ] Invariant cache hit.
[2023-03-17 05:34:51] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2023-03-17 05:34:51] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-17 05:34:51] [INFO ] Invariant cache hit.
[2023-03-17 05:34:51] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 249/297 places, 152/200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 468 ms. Remains : 249/297 places, 152/200 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ s50 s140) (LEQ 3 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4252 reset in 653 ms.
Stack based approach found an accepted trace after 1444 steps with 57 reset with depth 8 and stack size 8 in 10 ms.
FORMULA ResAllocation-PT-R003C050-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ResAllocation-PT-R003C050-LTLCardinality-04 finished in 1188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 6 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 297 cols
[2023-03-17 05:34:52] [INFO ] Computed 147 place invariants in 4 ms
[2023-03-17 05:34:52] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-17 05:34:52] [INFO ] Invariant cache hit.
[2023-03-17 05:34:52] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2023-03-17 05:34:52] [INFO ] Invariant cache hit.
[2023-03-17 05:34:52] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 487 ms. Remains : 297/297 places, 200/200 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s151 s194)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2828 reset in 615 ms.
Product exploration explored 100000 steps with 2911 reset in 726 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 : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-17 05:34:54] [INFO ] Invariant cache hit.
[2023-03-17 05:34:54] [INFO ] [Real]Absence check using 147 positive place invariants in 38 ms returned sat
[2023-03-17 05:34:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:34:54] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2023-03-17 05:34:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:34:55] [INFO ] [Nat]Absence check using 147 positive place invariants in 37 ms returned sat
[2023-03-17 05:34:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:34:55] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2023-03-17 05:34:55] [INFO ] Computed and/alt/rep : 150/150/150 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-17 05:34:55] [INFO ] Added : 21 causal constraints over 5 iterations in 123 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 2 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2023-03-17 05:34:55] [INFO ] Invariant cache hit.
[2023-03-17 05:34:55] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-17 05:34:55] [INFO ] Invariant cache hit.
[2023-03-17 05:34:55] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2023-03-17 05:34:55] [INFO ] Invariant cache hit.
[2023-03-17 05:34:55] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 487 ms. Remains : 297/297 places, 200/200 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 : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 108 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-17 05:34:56] [INFO ] Invariant cache hit.
[2023-03-17 05:34:56] [INFO ] [Real]Absence check using 147 positive place invariants in 40 ms returned sat
[2023-03-17 05:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:34:56] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2023-03-17 05:34:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:34:57] [INFO ] [Nat]Absence check using 147 positive place invariants in 38 ms returned sat
[2023-03-17 05:34:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:34:57] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2023-03-17 05:34:57] [INFO ] Computed and/alt/rep : 150/150/150 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-17 05:34:57] [INFO ] Added : 21 causal constraints over 5 iterations in 107 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2929 reset in 646 ms.
Stack based approach found an accepted trace after 96434 steps with 2782 reset with depth 122 and stack size 122 in 679 ms.
FORMULA ResAllocation-PT-R003C050-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ResAllocation-PT-R003C050-LTLCardinality-12 finished in 6685 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 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2023-03-17 05:34:58] [INFO ] Invariant cache hit.
[2023-03-17 05:34:58] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-17 05:34:58] [INFO ] Invariant cache hit.
[2023-03-17 05:34:59] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2023-03-17 05:34:59] [INFO ] Invariant cache hit.
[2023-03-17 05:34:59] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 506 ms. Remains : 297/297 places, 200/200 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLCardinality-13 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 s58)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R003C050-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-LTLCardinality-13 finished in 611 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&&F(G(p1))))))'
Support contains 5 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 4 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2023-03-17 05:34:59] [INFO ] Invariant cache hit.
[2023-03-17 05:34:59] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-17 05:34:59] [INFO ] Invariant cache hit.
[2023-03-17 05:34:59] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2023-03-17 05:34:59] [INFO ] Invariant cache hit.
[2023-03-17 05:34:59] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 504 ms. Remains : 297/297 places, 200/200 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s32 s250), p1:(AND (GT 2 s178) (GT s210 s290))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R003C050-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-LTLCardinality-15 finished in 658 ms.
All properties solved by simple procedures.
Total runtime 14712 ms.

BK_STOP 1679031300934

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-R003C050"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ResAllocation-PT-R003C050, 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 r325-tall-167889197600715"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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