Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016500324.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Philosophers-PT-000200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016500324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 115K Apr 29 11:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 632K Apr 29 11:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 178K Apr 29 11:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 29 11:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 97K May 9 08:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 366K May 9 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 69K May 9 08:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 344K May 9 08:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 9 08:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 54K May 9 08:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 445K 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 Philosophers-PT-000200-LTLFireability-00
FORMULA_NAME Philosophers-PT-000200-LTLFireability-01
FORMULA_NAME Philosophers-PT-000200-LTLFireability-02
FORMULA_NAME Philosophers-PT-000200-LTLFireability-03
FORMULA_NAME Philosophers-PT-000200-LTLFireability-04
FORMULA_NAME Philosophers-PT-000200-LTLFireability-05
FORMULA_NAME Philosophers-PT-000200-LTLFireability-06
FORMULA_NAME Philosophers-PT-000200-LTLFireability-07
FORMULA_NAME Philosophers-PT-000200-LTLFireability-08
FORMULA_NAME Philosophers-PT-000200-LTLFireability-09
FORMULA_NAME Philosophers-PT-000200-LTLFireability-10
FORMULA_NAME Philosophers-PT-000200-LTLFireability-11
FORMULA_NAME Philosophers-PT-000200-LTLFireability-12
FORMULA_NAME Philosophers-PT-000200-LTLFireability-13
FORMULA_NAME Philosophers-PT-000200-LTLFireability-14
FORMULA_NAME Philosophers-PT-000200-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652824400802

Running Version 202205111006
[2022-05-17 21:53:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-17 21:53:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 21:53:22] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2022-05-17 21:53:22] [INFO ] Transformed 1000 places.
[2022-05-17 21:53:22] [INFO ] Transformed 1000 transitions.
[2022-05-17 21:53:22] [INFO ] Parsed PT model containing 1000 places and 1000 transitions in 240 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-PT-000200-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-PT-000200-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1000 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:53:22] [INFO ] Computed 400 place invariants in 25 ms
[2022-05-17 21:53:22] [INFO ] Implicit Places using invariants in 296 ms returned []
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:53:22] [INFO ] Computed 400 place invariants in 8 ms
[2022-05-17 21:53:23] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:53:23] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-17 21:53:23] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1000/1000 transitions.
Support contains 1000 out of 1000 places after structural reductions.
[2022-05-17 21:53:24] [INFO ] Flatten gal took : 105 ms
[2022-05-17 21:53:24] [INFO ] Flatten gal took : 80 ms
[2022-05-17 21:53:24] [INFO ] Input system was already deterministic with 1000 transitions.
Finished random walk after 4319 steps, including 1 resets, run visited all 22 properties in 223 ms. (steps per millisecond=19 )
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' '!(G(F(p0)))'
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 74 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:53:25] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-17 21:53:25] [INFO ] Implicit Places using invariants in 313 ms returned []
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:53:25] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-17 21:53:26] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
[2022-05-17 21:53:26] [INFO ] Redundant transitions in 80 ms returned []
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:53:26] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-17 21:53:26] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-01 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 (AND (GEQ s282 1) (GEQ s454 1)) (AND (GEQ s333 1) (GEQ s551 1)) (AND (GEQ s277 1) (GEQ s457 1)) (AND (GEQ s338 1) (GEQ s556 1)) (AND (GEQ s406 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 117 reset in 1469 ms.
Product exploration explored 100000 steps with 94 reset in 1432 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 (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:53:31] [INFO ] Computed 400 place invariants in 7 ms
[2022-05-17 21:53:36] [INFO ] [Real]Absence check using 400 positive place invariants in 416 ms returned sat
[2022-05-17 21:53:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:53:39] [INFO ] [Real]Absence check using state equation in 2915 ms returned sat
[2022-05-17 21:53:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:53:45] [INFO ] [Nat]Absence check using 400 positive place invariants in 364 ms returned sat
[2022-05-17 21:53:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:53:47] [INFO ] [Nat]Absence check using state equation in 1823 ms returned sat
[2022-05-17 21:53:47] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 40 ms.
[2022-05-17 21:53:47] [INFO ] Added : 37 causal constraints over 8 iterations in 599 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 31 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:53:47] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-17 21:53:48] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:53:48] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-17 21:53:48] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 956 ms to find 0 implicit places.
[2022-05-17 21:53:49] [INFO ] Redundant transitions in 123 ms returned []
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:53:49] [INFO ] Computed 400 place invariants in 8 ms
[2022-05-17 21:53:49] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1000/1000 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 (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 813 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:53:51] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-17 21:53:57] [INFO ] [Real]Absence check using 400 positive place invariants in 420 ms returned sat
[2022-05-17 21:53:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:54:00] [INFO ] [Real]Absence check using state equation in 2940 ms returned sat
[2022-05-17 21:54:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:54:05] [INFO ] [Nat]Absence check using 400 positive place invariants in 362 ms returned sat
[2022-05-17 21:54:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:54:07] [INFO ] [Nat]Absence check using state equation in 1781 ms returned sat
[2022-05-17 21:54:07] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 46 ms.
[2022-05-17 21:54:07] [INFO ] Added : 37 causal constraints over 8 iterations in 585 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 141 reset in 1316 ms.
Product exploration explored 100000 steps with 112 reset in 1413 ms.
Built C files in :
/tmp/ltsmin9704929256393921496
[2022-05-17 21:54:10] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2022-05-17 21:54:10] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 21:54:10] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2022-05-17 21:54:10] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 21:54:10] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2022-05-17 21:54:10] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 21:54:10] [INFO ] Built C files in 202ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9704929256393921496
Running compilation step : cd /tmp/ltsmin9704929256393921496;'/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 2971 ms.
Running link step : cd /tmp/ltsmin9704929256393921496;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin9704929256393921496;'/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/stateBased7563064409415577986.hoa' '--buchi-type=spotba'
LTSmin run took 10804 ms.
FORMULA Philosophers-PT-000200-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Philosophers-PT-000200-LTLFireability-01 finished in 59771 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&((p2 U X(F(G(p0))))||p1))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 12 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:54:24] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-17 21:54:25] [INFO ] Implicit Places using invariants in 224 ms returned []
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:54:25] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-17 21:54:25] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:54:25] [INFO ] Computed 400 place invariants in 7 ms
[2022-05-17 21:54:25] [INFO ] Dead Transitions using invariants and state equation in 447 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 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=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s58 1) (GEQ s273 1)) (AND (GEQ s194 1) (GEQ s391 1)) (AND (GEQ s14 1) (GEQ s209 1)) (AND (GEQ s51 1) (GEQ s240 1)) (AND (GEQ s187 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 85082 steps with 0 reset in 1089 ms.
FORMULA Philosophers-PT-000200-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-02 finished in 2471 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(G(!G(!X(p0)))) U G(X(p0))))'
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 52 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:54:27] [INFO ] Computed 400 place invariants in 6 ms
[2022-05-17 21:54:27] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:54:27] [INFO ] Computed 400 place invariants in 6 ms
[2022-05-17 21:54:28] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 894 ms to find 0 implicit places.
[2022-05-17 21:54:28] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:54:28] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-17 21:54:28] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 55 ms :[p0, p0]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s100 1) (GEQ s309 1)) (AND (GEQ s168 1) (GEQ s368 1)) (AND (GEQ s95 1) (GEQ s312 1)) (AND (GEQ s72 1) (GEQ s258 1)) (AND (GEQ s113 1) (GE...], 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 58 reset in 1437 ms.
Stack based approach found an accepted trace after 2533 steps with 0 reset with depth 2534 and stack size 2534 in 36 ms.
FORMULA Philosophers-PT-000200-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-03 finished in 2967 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(G((G((p1 U p2))&&F(!p1)))))))'
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 7 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:54:30] [INFO ] Computed 400 place invariants in 6 ms
[2022-05-17 21:54:30] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:54:30] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-17 21:54:30] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:54:30] [INFO ] Computed 400 place invariants in 9 ms
[2022-05-17 21:54:31] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s58 1) (LT s273 1)) (OR (LT s194 1) (LT s391 1)) (OR (LT s14 1) (LT s209 1)) (OR (LT s51 1) (LT s240 1)) (OR (LT s187 1) (LT s358 1)) (OR ...], 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 129 reset in 1627 ms.
Stack based approach found an accepted trace after 1160 steps with 0 reset with depth 1161 and stack size 1161 in 23 ms.
FORMULA Philosophers-PT-000200-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-04 finished in 2938 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 25 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:54:33] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-17 21:54:33] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:54:33] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-17 21:54:34] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 933 ms to find 0 implicit places.
[2022-05-17 21:54:34] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:54:34] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-17 21:54:34] [INFO ] Dead Transitions using invariants and state equation in 460 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s366 1) (GEQ s729 1)) (AND (GEQ s271 1) (GEQ s698 1)) (AND (GEQ s371 1) (GEQ s726 1)) (AND (GEQ s321 1) (GEQ s716 1)) (AND (GEQ s218 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 33241 reset in 5821 ms.
Product exploration explored 100000 steps with 33366 reset in 5889 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 (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 128 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:54:47] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-17 21:54:53] [INFO ] [Real]Absence check using 400 positive place invariants in 422 ms returned sat
[2022-05-17 21:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:54:56] [INFO ] [Real]Absence check using state equation in 3196 ms returned sat
[2022-05-17 21:54:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:55:01] [INFO ] [Nat]Absence check using 400 positive place invariants in 366 ms returned sat
[2022-05-17 21:55:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:55:03] [INFO ] [Nat]Absence check using state equation in 1769 ms returned sat
[2022-05-17 21:55:03] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 44 ms.
[2022-05-17 21:55:04] [INFO ] Added : 40 causal constraints over 8 iterations in 566 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 24 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:55:04] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-17 21:55:04] [INFO ] Implicit Places using invariants in 292 ms returned []
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:55:04] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-17 21:55:05] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 936 ms to find 0 implicit places.
[2022-05-17 21:55:05] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:55:05] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-17 21:55:05] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1000/1000 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 (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 216 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:55:07] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-17 21:55:12] [INFO ] [Real]Absence check using 400 positive place invariants in 411 ms returned sat
[2022-05-17 21:55:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:55:15] [INFO ] [Real]Absence check using state equation in 3106 ms returned sat
[2022-05-17 21:55:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:55:20] [INFO ] [Nat]Absence check using 400 positive place invariants in 370 ms returned sat
[2022-05-17 21:55:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:55:22] [INFO ] [Nat]Absence check using state equation in 1790 ms returned sat
[2022-05-17 21:55:22] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 45 ms.
[2022-05-17 21:55:23] [INFO ] Added : 40 causal constraints over 8 iterations in 554 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Product exploration explored 100000 steps with 33296 reset in 5653 ms.
Product exploration explored 100000 steps with 33276 reset in 5807 ms.
Built C files in :
/tmp/ltsmin3284474782949287458
[2022-05-17 21:55:34] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2022-05-17 21:55:34] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 21:55:34] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2022-05-17 21:55:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 21:55:35] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2022-05-17 21:55:35] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 21:55:35] [INFO ] Built C files in 148ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3284474782949287458
Running compilation step : cd /tmp/ltsmin3284474782949287458;'/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 2783 ms.
Running link step : cd /tmp/ltsmin3284474782949287458;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin3284474782949287458;'/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/stateBased6396286311596852104.hoa' '--buchi-type=spotba'
LTSmin run took 8636 ms.
FORMULA Philosophers-PT-000200-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Philosophers-PT-000200-LTLFireability-05 finished in 73388 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p0)))'
Support contains 200 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 8 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:55:46] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-17 21:55:46] [INFO ] Implicit Places using invariants in 430 ms returned []
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:55:46] [INFO ] Computed 400 place invariants in 6 ms
[2022-05-17 21:55:47] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 1297 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:55:47] [INFO ] Computed 400 place invariants in 1 ms
[2022-05-17 21:55:48] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s846 1) (LT s911 1) (LT s781 1) (LT s968 1) (LT s838 1) (LT s903 1) (LT s773 1) (LT s960 1) (LT s927 1) (LT s862 1) (LT s984 1) (LT s789 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 3359 ms.
Product exploration explored 100000 steps with 50000 reset in 3518 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Philosophers-PT-000200-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-000200-LTLFireability-07 finished in 9671 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F((G(p0)||X(X(p1))))&&G((p2 U !p1))))))'
Support contains 5 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:55:56] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-17 21:55:56] [INFO ] Implicit Places using invariants in 420 ms returned []
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:55:56] [INFO ] Computed 400 place invariants in 1 ms
[2022-05-17 21:55:57] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 1257 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:55:57] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-17 21:55:57] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND (NOT p1) (NOT p0)), p1, p1, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(OR (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(OR (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (LT s208 1) (LT s443 1)), p2:(AND (GEQ s353 1) (GEQ s817 1)), p0:(LT s867 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 98 reset in 1469 ms.
Stack based approach found an accepted trace after 8330 steps with 11 reset with depth 2842 and stack size 2842 in 170 ms.
FORMULA Philosophers-PT-000200-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-08 finished in 3647 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((X(p0)&&p1))))))'
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:55:59] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-17 21:56:00] [INFO ] Implicit Places using invariants in 421 ms returned []
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:56:00] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-17 21:56:01] [INFO ] Implicit Places using invariants and state equation in 838 ms returned []
Implicit Place search using SMT with State Equation took 1261 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:56:01] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-17 21:56:01] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(GEQ s907 1), p0:(AND (GEQ s319 1) (GEQ s714 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000200-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-10 finished in 1902 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(p0))))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:56:01] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-17 21:56:02] [INFO ] Implicit Places using invariants in 420 ms returned []
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:56:02] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-17 21:56:03] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1268 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:56:03] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-17 21:56:03] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-11 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:(AND (GEQ s14 1) (GEQ s216 1))], 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 124 steps with 0 reset in 12 ms.
FORMULA Philosophers-PT-000200-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-11 finished in 1828 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U !X((G(p1)&&X((X(!p3)&&p2))))))'
Support contains 6 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:56:03] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-17 21:56:04] [INFO ] Implicit Places using invariants in 432 ms returned []
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:56:04] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-17 21:56:04] [INFO ] Implicit Places using invariants and state equation in 841 ms returned []
Implicit Place search using SMT with State Equation took 1274 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:56:04] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-17 21:56:05] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 409 ms :[(AND p1 p2 (NOT p3)), (AND p1 (NOT p3)), p1, (AND p1 (NOT p3) p2), (AND p1 (NOT p3) p2), (AND p1 (NOT p3) p2), (AND p1 p2 (NOT p3)), (AND p1 (NOT p3) p2), (AND p1 p2 (NOT p3)), (AND p1 (NOT p3) p2), (AND p1 p2 (NOT p3))]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 5}, { cond=p0, acceptance={} source=0 dest: 6}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 1}], [{ cond=(AND p1 p2 (NOT p3)), acceptance={} source=4 dest: 1}], [{ cond=p1, acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 7}, { cond=(AND p0 p1), acceptance={} source=6 dest: 8}], [{ cond=(AND p1 p2), acceptance={} source=7 dest: 4}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=8 dest: 9}, { cond=(AND p0 p1 p2), acceptance={} source=8 dest: 10}], [{ cond=(AND p1 p2 (NOT p3)), acceptance={} source=9 dest: 4}], [{ cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={0} source=10 dest: 9}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p0:(OR (AND (GEQ s78 1) (GEQ s268 1)) (AND (GEQ s217 1) (GEQ s383 1))), p1:(AND (GEQ s78 1) (GEQ s268 1)), p3:(AND (GEQ s335 1) (GEQ s762 1)), p2:(AND (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33362 reset in 3949 ms.
Product exploration explored 100000 steps with 33353 reset in 4138 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT p1)), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2))))]
Knowledge based reduction with 3 factoid took 347 ms. Reduced automaton from 11 states, 15 edges and 4 AP to 8 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 296 ms :[(AND p1 p2 (NOT p3)), (AND p1 (NOT p3)), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3)), (AND p1 (NOT p3) p2), (AND p1 (NOT p3) p2), (AND p1 p2 (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:56:15] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-17 21:56:16] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 p2)))), (G (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (G (NOT (AND p1 p2 (NOT p3)))), (G (NOT (AND p0 p1 p2 (NOT p3))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT p1)), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (F (NOT (AND p1 (NOT p3)))), (F (NOT p1)), (F (AND p1 p2))]
Property proved to be true thanks to knowledge :(G (NOT (AND p1 p2 (NOT p3))))
Knowledge based reduction with 6 factoid took 997 ms. Reduced automaton from 8 states, 9 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA Philosophers-PT-000200-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-000200-LTLFireability-13 finished in 13469 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&X(!p1))))'
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:56:17] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-17 21:56:17] [INFO ] Implicit Places using invariants in 427 ms returned []
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:56:17] [INFO ] Computed 400 place invariants in 1 ms
[2022-05-17 21:56:18] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1290 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:56:18] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-17 21:56:18] [INFO ] Dead Transitions using invariants and state equation in 430 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p1), p1]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s982 1), p0:(AND (GEQ s178 1) (GEQ s410 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 71081 steps with 196 reset in 1230 ms.
FORMULA Philosophers-PT-000200-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-14 finished in 3073 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p0)&&G(p1)))||(p2 U p3)))'
Support contains 8 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 17 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:56:20] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-17 21:56:20] [INFO ] Implicit Places using invariants in 434 ms returned []
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:56:20] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-17 21:56:21] [INFO ] Implicit Places using invariants and state equation in 841 ms returned []
Implicit Place search using SMT with State Equation took 1276 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 21:56:21] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-17 21:56:21] [INFO ] Dead Transitions using invariants and state equation in 447 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 298 ms :[true, (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (NOT p1) (NOT p0)), (NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 6}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND (NOT p3) (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p3) p2 p1 p0), acceptance={} source=3 dest: 7}, { cond=(OR (AND (NOT p3) p2 (NOT p1)) (AND (NOT p3) p2 (NOT p0))), acceptance={} source=3 dest: 8}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 2}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=8 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=8 dest: 8}]], initial=1, aps=[p3:(AND (GEQ s340 1) (GEQ s759 1)), p2:(AND (GEQ s58 1) (GEQ s273 1)), p1:(AND (GEQ s151 1) (GEQ s331 1)), p0:(OR (LT s7 1) (LT s218 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 89 steps with 0 reset in 9 ms.
FORMULA Philosophers-PT-000200-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-15 finished in 2073 ms.
All properties solved by simple procedures.
Total runtime 180296 ms.

BK_STOP 1652824582268

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -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="Philosophers-PT-000200"
export BK_EXAMINATION="LTLFireability"
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 Philosophers-PT-000200, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277016500324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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