Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572600675.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ResAllocation-PT-R015C002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572600675
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 6.4K Apr 30 02:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 30 02:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 02:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 30 02:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 9 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 64K May 10 09:34 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-R015C002-LTLCardinality-00
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-01
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-02
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-03
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-04
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-05
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-06
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-07
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-08
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-09
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-10
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-11
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-12
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-13
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-14
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653088583551

Running Version 202205111006
[2022-05-20 23:16:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 23:16:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 23:16:25] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2022-05-20 23:16:25] [INFO ] Transformed 60 places.
[2022-05-20 23:16:25] [INFO ] Transformed 32 transitions.
[2022-05-20 23:16:25] [INFO ] Parsed PT model containing 60 places and 32 transitions in 209 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 10 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 60 cols
[2022-05-20 23:16:25] [INFO ] Computed 30 place invariants in 11 ms
[2022-05-20 23:16:25] [INFO ] Implicit Places using invariants in 213 ms returned [31, 37, 39, 41, 45, 49, 53, 55]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 251 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/60 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 52/60 places, 32/32 transitions.
Support contains 23 out of 52 places after structural reductions.
[2022-05-20 23:16:25] [INFO ] Flatten gal took : 20 ms
[2022-05-20 23:16:25] [INFO ] Flatten gal took : 8 ms
[2022-05-20 23:16:25] [INFO ] Input system was already deterministic with 32 transitions.
Support contains 21 out of 52 places (down from 23) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 146 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 17) seen :13
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 32 rows 52 cols
[2022-05-20 23:16:26] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 23:16:26] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2022-05-20 23:16:26] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 9 simplifications.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(p0) U p1)||G(p0))))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 50 transition count 30
Applied a total of 4 rules in 14 ms. Remains 50 /52 variables (removed 2) and now considering 30/32 (removed 2) transitions.
// Phase 1: matrix 30 rows 50 cols
[2022-05-20 23:16:26] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 23:16:26] [INFO ] Implicit Places using invariants in 83 ms returned [30, 32, 37, 40, 47, 49]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 85 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/52 places, 30/32 transitions.
Applied a total of 0 rules in 4 ms. Remains 44 /44 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 44/52 places, 30/32 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s9 s20), p1:(LEQ s39 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10279 reset in 254 ms.
Product exploration explored 100000 steps with 10294 reset in 153 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)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 176 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 7 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 199 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 30 rows 44 cols
[2022-05-20 23:16:27] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-20 23:16:27] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2022-05-20 23:16:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 23:16:27] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-05-20 23:16:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 23:16:28] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-20 23:16:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 23:16:28] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-20 23:16:28] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 3 ms to minimize.
[2022-05-20 23:16:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2022-05-20 23:16:28] [INFO ] Computed and/alt/rep : 28/28/28 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-20 23:16:28] [INFO ] Added : 22 causal constraints over 5 iterations in 34 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 44 cols
[2022-05-20 23:16:28] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 23:16:28] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 30 rows 44 cols
[2022-05-20 23:16:28] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 23:16:28] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2022-05-20 23:16:28] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 30 rows 44 cols
[2022-05-20 23:16:28] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 23:16:28] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 44/44 places, 30/30 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)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 9 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 330 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 30 rows 44 cols
[2022-05-20 23:16:28] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-20 23:16:29] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2022-05-20 23:16:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 23:16:29] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-20 23:16:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 23:16:29] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-20 23:16:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 23:16:29] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-05-20 23:16:29] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2022-05-20 23:16:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2022-05-20 23:16:29] [INFO ] Computed and/alt/rep : 28/28/28 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-20 23:16:29] [INFO ] Added : 22 causal constraints over 5 iterations in 40 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10304 reset in 135 ms.
Product exploration explored 100000 steps with 10216 reset in 309 ms.
Built C files in :
/tmp/ltsmin4083599505517646978
[2022-05-20 23:16:29] [INFO ] Computing symmetric may disable matrix : 30 transitions.
[2022-05-20 23:16:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:16:29] [INFO ] Computing symmetric may enable matrix : 30 transitions.
[2022-05-20 23:16:29] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:16:29] [INFO ] Computing Do-Not-Accords matrix : 30 transitions.
[2022-05-20 23:16:29] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:16:29] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4083599505517646978
Running compilation step : cd /tmp/ltsmin4083599505517646978;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 249 ms.
Running link step : cd /tmp/ltsmin4083599505517646978;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin4083599505517646978;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1480325868740903952.hoa' '--buchi-type=spotba'
LTSmin run took 214 ms.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ResAllocation-PT-R015C002-LTLCardinality-01 finished in 3649 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 50 transition count 30
Applied a total of 4 rules in 8 ms. Remains 50 /52 variables (removed 2) and now considering 30/32 (removed 2) transitions.
// Phase 1: matrix 30 rows 50 cols
[2022-05-20 23:16:30] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 23:16:30] [INFO ] Implicit Places using invariants in 93 ms returned [30, 32, 37, 40, 43, 47, 49]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 95 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/52 places, 30/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 43/52 places, 30/32 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLCardinality-03 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:(OR (GT s2 s25) (LEQ 3 s30))], 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 14150 steps with 935 reset in 32 ms.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLCardinality-03 finished in 208 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 52 cols
[2022-05-20 23:16:30] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 23:16:30] [INFO ] Implicit Places using invariants in 77 ms returned [32, 39, 42, 49, 51]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 79 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/52 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 47/52 places, 32/32 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s33 s42)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 342 steps with 16 reset in 1 ms.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLCardinality-06 finished in 160 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((false U G(X((X(p0)&&F(p1))))))'
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 52 cols
[2022-05-20 23:16:30] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 23:16:30] [INFO ] Implicit Places using invariants in 59 ms returned [32, 34, 42, 45, 51]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 60 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/52 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 47/52 places, 32/32 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s37 s45), p0:(LEQ s38 s45)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 24483 reset in 168 ms.
Product exploration explored 100000 steps with 24579 reset in 161 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 p1 p0), (X p1), true, (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 259 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Finished random walk after 22 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 272 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 47 cols
[2022-05-20 23:16:32] [INFO ] Computed 17 place invariants in 13 ms
[2022-05-20 23:16:32] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 32 rows 47 cols
[2022-05-20 23:16:32] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-20 23:16:32] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 47 cols
[2022-05-20 23:16:32] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-20 23:16:32] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 47/47 places, 32/32 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 p1 p0), (X p1), true, (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 276 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Finished random walk after 510 steps, including 7 resets, run visited all 2 properties in 3 ms. (steps per millisecond=170 )
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 358 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Product exploration explored 100000 steps with 24509 reset in 97 ms.
Stuttering criterion allowed to conclude after 54685 steps with 13368 reset in 67 ms.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLCardinality-08 finished in 3387 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(p0))))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 52 cols
[2022-05-20 23:16:34] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 23:16:34] [INFO ] Implicit Places using invariants in 67 ms returned [34, 39, 42, 45, 49, 51]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 68 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/52 places, 32/32 transitions.
Applied a total of 0 rules in 6 ms. Remains 46 /46 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 46/52 places, 32/32 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLCardinality-09 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 s32 s8)], 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]]
Stuttering criterion allowed to conclude after 587 steps with 32 reset in 2 ms.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLCardinality-09 finished in 222 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 52 cols
[2022-05-20 23:16:34] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 23:16:34] [INFO ] Implicit Places using invariants in 54 ms returned [32, 34, 39, 42, 45, 49, 51]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 55 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/52 places, 32/32 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 45/52 places, 32/32 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLCardinality-10 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 s18 s25)], 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 33333 reset in 88 ms.
Product exploration explored 100000 steps with 33333 reset in 90 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R015C002-LTLCardinality-10 finished in 448 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&(X(p0)||p1)))))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 52 cols
[2022-05-20 23:16:34] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-20 23:16:34] [INFO ] Implicit Places using invariants in 78 ms returned [32, 34, 39, 42, 45, 49, 51]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 80 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/52 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 45 /45 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 45/52 places, 32/32 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p0:(GT 1 s1), p1:(GT 1 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 16459 reset in 100 ms.
Product exploration explored 100000 steps with 16177 reset in 117 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) p1), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 347 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 852 steps, including 12 resets, run visited all 2 properties in 5 ms. (steps per millisecond=170 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 277 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 32 rows 45 cols
[2022-05-20 23:16:36] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-20 23:16:36] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-20 23:16:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 23:16:36] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-20 23:16:36] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-20 23:16:36] [INFO ] Added : 13 causal constraints over 3 iterations in 18 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 32/32 transitions.
Applied a total of 0 rules in 4 ms. Remains 45 /45 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 45 cols
[2022-05-20 23:16:36] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-20 23:16:36] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 32 rows 45 cols
[2022-05-20 23:16:36] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-20 23:16:36] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 45 cols
[2022-05-20 23:16:36] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-20 23:16:36] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/45 places, 32/32 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) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 265 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 89 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 310 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 32 rows 45 cols
[2022-05-20 23:16:37] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-20 23:16:37] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2022-05-20 23:16:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 23:16:37] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-20 23:16:37] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-20 23:16:37] [INFO ] Added : 13 causal constraints over 3 iterations in 21 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16076 reset in 131 ms.
Product exploration explored 100000 steps with 16329 reset in 141 ms.
Built C files in :
/tmp/ltsmin2142945162731485888
[2022-05-20 23:16:38] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2142945162731485888
Running compilation step : cd /tmp/ltsmin2142945162731485888;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 159 ms.
Running link step : cd /tmp/ltsmin2142945162731485888;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin2142945162731485888;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1257779652162468649.hoa' '--buchi-type=spotba'
LTSmin run took 12446 ms.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ResAllocation-PT-R015C002-LTLCardinality-12 finished in 16118 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((G(G(p0))||p1)))))'
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 50 transition count 30
Applied a total of 4 rules in 3 ms. Remains 50 /52 variables (removed 2) and now considering 30/32 (removed 2) transitions.
// Phase 1: matrix 30 rows 50 cols
[2022-05-20 23:16:50] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 23:16:50] [INFO ] Implicit Places using invariants in 50 ms returned [30, 32, 37, 40, 43, 47]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 64 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/52 places, 30/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 44/52 places, 30/32 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s33), p1:(GT s0 s43)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1464 reset in 201 ms.
Product exploration explored 100000 steps with 1462 reset in 190 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)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 7 factoid took 349 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 48 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 503 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 30 rows 44 cols
[2022-05-20 23:16:52] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-20 23:16:52] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-20 23:16:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 23:16:52] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-20 23:16:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 23:16:52] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-20 23:16:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 23:16:52] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-20 23:16:52] [INFO ] Computed and/alt/rep : 28/28/28 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-20 23:16:52] [INFO ] Added : 13 causal constraints over 3 iterations in 29 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 44 cols
[2022-05-20 23:16:52] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-20 23:16:52] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 30 rows 44 cols
[2022-05-20 23:16:52] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 23:16:52] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2022-05-20 23:16:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 44 cols
[2022-05-20 23:16:52] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-20 23:16:52] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 44/44 places, 30/30 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)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 7 factoid took 276 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 388 steps, including 5 resets, run visited all 4 properties in 14 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 389 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 30 rows 44 cols
[2022-05-20 23:16:53] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-20 23:16:53] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-20 23:16:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 23:16:53] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-20 23:16:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 23:16:53] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-20 23:16:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 23:16:53] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-20 23:16:53] [INFO ] Computed and/alt/rep : 28/28/28 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-20 23:16:53] [INFO ] Added : 13 causal constraints over 3 iterations in 18 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1463 reset in 143 ms.
Product exploration explored 100000 steps with 1460 reset in 223 ms.
Built C files in :
/tmp/ltsmin16837659286128135723
[2022-05-20 23:16:54] [INFO ] Computing symmetric may disable matrix : 30 transitions.
[2022-05-20 23:16:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:16:54] [INFO ] Computing symmetric may enable matrix : 30 transitions.
[2022-05-20 23:16:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:16:54] [INFO ] Computing Do-Not-Accords matrix : 30 transitions.
[2022-05-20 23:16:54] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:16:54] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16837659286128135723
Running compilation step : cd /tmp/ltsmin16837659286128135723;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 181 ms.
Running link step : cd /tmp/ltsmin16837659286128135723;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16837659286128135723;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16584167586263959993.hoa' '--buchi-type=spotba'
LTSmin run took 4304 ms.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ResAllocation-PT-R015C002-LTLCardinality-15 finished in 7922 ms.
All properties solved by simple procedures.
Total runtime 33885 ms.

BK_STOP 1653088618947

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-R015C002"
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-4028"
echo " Executing tool itstools"
echo " Input is ResAllocation-PT-R015C002, 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 r186-tajo-165281572600675"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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