fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r285-smll-171654422300247
Last Updated
July 7, 2024

About the Execution of 2023-gold for Philosophers-COL-000020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1592.579 50227.00 150373.00 620.00 FTFFFFFTFFFTFTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r285-smll-171654422300247.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Philosophers-COL-000020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654422300247
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.9K Apr 13 09:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 13 09:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 13 09:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 13 09:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 09:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 13 09:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 09:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 13 09:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 11K May 18 16:43 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-COL-000020-LTLCardinality-00
FORMULA_NAME Philosophers-COL-000020-LTLCardinality-01
FORMULA_NAME Philosophers-COL-000020-LTLCardinality-02
FORMULA_NAME Philosophers-COL-000020-LTLCardinality-03
FORMULA_NAME Philosophers-COL-000020-LTLCardinality-04
FORMULA_NAME Philosophers-COL-000020-LTLCardinality-05
FORMULA_NAME Philosophers-COL-000020-LTLCardinality-06
FORMULA_NAME Philosophers-COL-000020-LTLCardinality-07
FORMULA_NAME Philosophers-COL-000020-LTLCardinality-08
FORMULA_NAME Philosophers-COL-000020-LTLCardinality-09
FORMULA_NAME Philosophers-COL-000020-LTLCardinality-10
FORMULA_NAME Philosophers-COL-000020-LTLCardinality-11
FORMULA_NAME Philosophers-COL-000020-LTLCardinality-12
FORMULA_NAME Philosophers-COL-000020-LTLCardinality-13
FORMULA_NAME Philosophers-COL-000020-LTLCardinality-14
FORMULA_NAME Philosophers-COL-000020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716938587821

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000020
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-28 23:23:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 23:23:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 23:23:10] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 23:23:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 23:23:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 910 ms
[2024-05-28 23:23:11] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 100 PT places and 100.0 transition bindings in 40 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 23:23:12] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 9 ms.
[2024-05-28 23:23:12] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 7 formulas.
FORMULA Philosophers-COL-000020-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 9 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10019 steps, including 453 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 18) seen :17
Finished Best-First random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 2 ms.
[2024-05-28 23:23:12] [INFO ] Flatten gal took : 28 ms
[2024-05-28 23:23:12] [INFO ] Flatten gal took : 5 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 20) 20) 20)]] contains successor/predecessor on variables of sort Philo
[2024-05-28 23:23:12] [INFO ] Unfolded HLPN to a Petri net with 100 places and 100 transitions 320 arcs in 21 ms.
[2024-05-28 23:23:12] [INFO ] Unfolded 9 HLPN properties in 1 ms.
Support contains 100 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 13 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2024-05-28 23:23:12] [INFO ] Computed 40 invariants in 12 ms
[2024-05-28 23:23:12] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-28 23:23:12] [INFO ] Invariant cache hit.
[2024-05-28 23:23:13] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2024-05-28 23:23:13] [INFO ] Invariant cache hit.
[2024-05-28 23:23:13] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 674 ms. Remains : 100/100 places, 100/100 transitions.
Support contains 100 out of 100 places after structural reductions.
[2024-05-28 23:23:13] [INFO ] Flatten gal took : 31 ms
[2024-05-28 23:23:13] [INFO ] Flatten gal took : 27 ms
[2024-05-28 23:23:13] [INFO ] Input system was already deterministic with 100 transitions.
Finished random walk after 3395 steps, including 8 resets, run visited all 18 properties in 102 ms. (steps per millisecond=33 )
Parikh walk visited 0 properties in 0 ms.
FORMULA Philosophers-COL-000020-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 20 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 35 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-28 23:23:13] [INFO ] Invariant cache hit.
[2024-05-28 23:23:14] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-28 23:23:14] [INFO ] Invariant cache hit.
[2024-05-28 23:23:14] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-05-28 23:23:14] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-28 23:23:14] [INFO ] Invariant cache hit.
[2024-05-28 23:23:14] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 522 ms. Remains : 100/100 places, 100/100 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 279 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000020-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99))], 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 11234 reset in 851 ms.
Product exploration explored 100000 steps with 11268 reset in 809 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), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 209 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
[2024-05-28 23:23:16] [INFO ] Invariant cache hit.
[2024-05-28 23:23:17] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-28 23:23:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 23:23:17] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2024-05-28 23:23:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 23:23:17] [INFO ] [Nat]Absence check using 40 positive place invariants in 23 ms returned sat
[2024-05-28 23:23:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 23:23:17] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-05-28 23:23:17] [INFO ] Computed and/alt/rep : 60/80/60 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-28 23:23:17] [INFO ] Added : 0 causal constraints over 0 iterations in 48 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 20 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-28 23:23:17] [INFO ] Invariant cache hit.
[2024-05-28 23:23:17] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-28 23:23:17] [INFO ] Invariant cache hit.
[2024-05-28 23:23:17] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2024-05-28 23:23:17] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 23:23:17] [INFO ] Invariant cache hit.
[2024-05-28 23:23:18] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 377 ms. Remains : 100/100 places, 100/100 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), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 203 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-05-28 23:23:18] [INFO ] Invariant cache hit.
[2024-05-28 23:23:18] [INFO ] [Real]Absence check using 40 positive place invariants in 16 ms returned sat
[2024-05-28 23:23:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 23:23:18] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2024-05-28 23:23:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 23:23:18] [INFO ] [Nat]Absence check using 40 positive place invariants in 12 ms returned sat
[2024-05-28 23:23:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 23:23:18] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-28 23:23:18] [INFO ] Computed and/alt/rep : 60/80/60 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-28 23:23:18] [INFO ] Added : 0 causal constraints over 0 iterations in 34 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11270 reset in 492 ms.
Product exploration explored 100000 steps with 11252 reset in 501 ms.
Built C files in :
/tmp/ltsmin8134050574288880992
[2024-05-28 23:23:20] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2024-05-28 23:23:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:23:20] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2024-05-28 23:23:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:23:20] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2024-05-28 23:23:20] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:23:20] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8134050574288880992
Running compilation step : cd /tmp/ltsmin8134050574288880992;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 525 ms.
Running link step : cd /tmp/ltsmin8134050574288880992;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin8134050574288880992;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2240087006039430218.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 11 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-28 23:23:35] [INFO ] Invariant cache hit.
[2024-05-28 23:23:35] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-28 23:23:35] [INFO ] Invariant cache hit.
[2024-05-28 23:23:35] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2024-05-28 23:23:35] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-28 23:23:35] [INFO ] Invariant cache hit.
[2024-05-28 23:23:35] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 502 ms. Remains : 100/100 places, 100/100 transitions.
Built C files in :
/tmp/ltsmin7215577995432578819
[2024-05-28 23:23:35] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2024-05-28 23:23:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:23:35] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2024-05-28 23:23:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:23:35] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2024-05-28 23:23:35] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:23:35] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7215577995432578819
Running compilation step : cd /tmp/ltsmin7215577995432578819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 412 ms.
Running link step : cd /tmp/ltsmin7215577995432578819;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin7215577995432578819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1494805341510237535.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 23:23:50] [INFO ] Flatten gal took : 15 ms
[2024-05-28 23:23:50] [INFO ] Flatten gal took : 11 ms
[2024-05-28 23:23:50] [INFO ] Time to serialize gal into /tmp/LTL17648106130360021982.gal : 3 ms
[2024-05-28 23:23:50] [INFO ] Time to serialize properties into /tmp/LTL11789358616518230302.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17648106130360021982.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10306068504681520014.hoa' '-atoms' '/tmp/LTL11789358616518230302.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11789358616518230302.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10306068504681520014.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
33 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.371239,26364,1,0,104,71970,20,83,2457,65405,215
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-COL-000020-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Philosophers-COL-000020-LTLCardinality-00 finished in 37495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-28 23:23:51] [INFO ] Invariant cache hit.
[2024-05-28 23:23:51] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-28 23:23:51] [INFO ] Invariant cache hit.
[2024-05-28 23:23:51] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-05-28 23:23:51] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 23:23:51] [INFO ] Invariant cache hit.
[2024-05-28 23:23:51] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 395 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000020-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39) (ADD s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 176 reset in 349 ms.
Stack based approach found an accepted trace after 83 steps with 0 reset with depth 84 and stack size 84 in 1 ms.
FORMULA Philosophers-COL-000020-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000020-LTLCardinality-02 finished in 923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 16 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-28 23:23:52] [INFO ] Invariant cache hit.
[2024-05-28 23:23:52] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-28 23:23:52] [INFO ] Invariant cache hit.
[2024-05-28 23:23:52] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-05-28 23:23:52] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-28 23:23:52] [INFO ] Invariant cache hit.
[2024-05-28 23:23:52] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 354 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000020-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19) (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 442 reset in 585 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 0 ms.
FORMULA Philosophers-COL-000020-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000020-LTLCardinality-03 finished in 1054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 40 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-28 23:23:53] [INFO ] Invariant cache hit.
[2024-05-28 23:23:53] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 23:23:53] [INFO ] Invariant cache hit.
[2024-05-28 23:23:53] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-05-28 23:23:53] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 23:23:53] [INFO ] Invariant cache hit.
[2024-05-28 23:23:53] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 314 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000020-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79) (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 146 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000020-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000020-LTLCardinality-05 finished in 382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(X(p2))||G(p3)||(!p0 U (p4||G(!p0)))))'
Support contains 80 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-28 23:23:53] [INFO ] Invariant cache hit.
[2024-05-28 23:23:53] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-28 23:23:53] [INFO ] Invariant cache hit.
[2024-05-28 23:23:53] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2024-05-28 23:23:53] [INFO ] Invariant cache hit.
[2024-05-28 23:23:53] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 230 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 794 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) p0 (NOT p3) (NOT p4)), (AND (NOT p2) p0 (NOT p4)), (AND (NOT p2) p0 (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p4) (NOT p2)), (AND p0 (NOT p3) (NOT p4) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p4)), (NOT p3), (AND p0 (NOT p4) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000020-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 16}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p4)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p3 (NOT p4)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0 p3 (NOT p4)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p4)), acceptance={} source=3 dest: 15}], [{ cond=(AND p0 (NOT p4)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p4)), acceptance={} source=4 dest: 7}], [{ cond=(AND p0 (NOT p3) (NOT p4)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p4)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) p3 (NOT p4)), acceptance={} source=5 dest: 8}, { cond=(AND p0 p3 (NOT p4)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=6 dest: 10}], [{ cond=(AND p0 (NOT p4) (NOT p2)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) (NOT p4) (NOT p2)), acceptance={} source=7 dest: 11}], [{ cond=(AND p0 (NOT p3) (NOT p4) (NOT p2)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p4) (NOT p2)), acceptance={} source=8 dest: 11}, { cond=(AND p0 p3 (NOT p4) (NOT p2)), acceptance={} source=8 dest: 12}, { cond=(AND (NOT p0) p3 (NOT p4) (NOT p2)), acceptance={} source=8 dest: 13}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=9 dest: 0}, { cond=(AND p3 (NOT p2)), acceptance={} source=9 dest: 12}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=10 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p3 (NOT p2)), acceptance={} source=10 dest: 12}, { cond=(AND (NOT p1) p0 p3 (NOT p2)), acceptance={} source=10 dest: 14}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=10 dest: 16}], [{ cond=(AND p0 (NOT p4)), acceptance={} source=11 dest: 0}, { cond=(AND (NOT p0) (NOT p4)), acceptance={} source=11 dest: 11}], [{ cond=(NOT p3), acceptance={} source=12 dest: 0}, { cond=p3, acceptance={} source=12 dest: 12}], [{ cond=(AND p0 (NOT p3) (NOT p4)), acceptance={} source=13 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p4)), acceptance={} source=13 dest: 11}, { cond=(AND p0 p3 (NOT p4)), acceptance={} source=13 dest: 12}, { cond=(AND (NOT p0) p3 (NOT p4)), acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=14 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=14 dest: 12}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=14 dest: 14}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=14 dest: 16}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=15 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=15 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=16 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=16 dest: 16}]], initial=3, aps=[p2:(LEQ (ADD s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59) (ADD s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73...], 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 88 steps with 16 reset in 1 ms.
FORMULA Philosophers-COL-000020-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000020-LTLCardinality-06 finished in 1060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(F(p1)))))'
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-28 23:23:54] [INFO ] Invariant cache hit.
[2024-05-28 23:23:54] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-28 23:23:54] [INFO ] Invariant cache hit.
[2024-05-28 23:23:54] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-28 23:23:54] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 23:23:54] [INFO ] Invariant cache hit.
[2024-05-28 23:23:55] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 319 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000020-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LEQ (ADD s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79) (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s3...], 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 7316 reset in 662 ms.
Stack based approach found an accepted trace after 164 steps with 11 reset with depth 12 and stack size 12 in 2 ms.
FORMULA Philosophers-COL-000020-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000020-LTLCardinality-09 finished in 1084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0||G(p1))) U X(p2)))'
Support contains 80 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-28 23:23:55] [INFO ] Invariant cache hit.
[2024-05-28 23:23:55] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-28 23:23:55] [INFO ] Invariant cache hit.
[2024-05-28 23:23:56] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2024-05-28 23:23:56] [INFO ] Invariant cache hit.
[2024-05-28 23:23:56] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 272 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 306 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : Philosophers-COL-000020-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p0 p1), acceptance={} source=7 dest: 6}, { cond=(NOT p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (LEQ (ADD s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99) (ADD s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72...], 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, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000020-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000020-LTLCardinality-10 finished in 608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(!p0)&&(!p1 U p2)))))'
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-28 23:23:56] [INFO ] Invariant cache hit.
[2024-05-28 23:23:56] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-28 23:23:56] [INFO ] Invariant cache hit.
[2024-05-28 23:23:56] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-05-28 23:23:56] [INFO ] Invariant cache hit.
[2024-05-28 23:23:56] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 289 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), true, p0, (NOT p2)]
Running random walk in product with property : Philosophers-COL-000020-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(GT (ADD s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s1...], 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]]
Entered a terminal (fully accepting) state of product in 28 steps with 2 reset in 1 ms.
FORMULA Philosophers-COL-000020-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000020-LTLCardinality-12 finished in 524 ms.
All properties solved by simple procedures.
Total runtime 46142 ms.

BK_STOP 1716938638048

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-COL-000020"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Philosophers-COL-000020, 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 r285-smll-171654422300247"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000020.tgz
mv Philosophers-COL-000020 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 ;