Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r311-tall-162132107900148.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ServersAndClients-PT-100160, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-162132107900148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 31M
-rw-r--r-- 1 mcc users 11K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 12 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 12 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.8K May 11 20:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 11 20:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 11 17:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 11 17:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 7 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 31M May 12 08:13 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 ServersAndClients-PT-100160-00
FORMULA_NAME ServersAndClients-PT-100160-01
FORMULA_NAME ServersAndClients-PT-100160-02
FORMULA_NAME ServersAndClients-PT-100160-03
FORMULA_NAME ServersAndClients-PT-100160-04
FORMULA_NAME ServersAndClients-PT-100160-05
FORMULA_NAME ServersAndClients-PT-100160-06
FORMULA_NAME ServersAndClients-PT-100160-07
FORMULA_NAME ServersAndClients-PT-100160-08
FORMULA_NAME ServersAndClients-PT-100160-09
FORMULA_NAME ServersAndClients-PT-100160-10
FORMULA_NAME ServersAndClients-PT-100160-11
FORMULA_NAME ServersAndClients-PT-100160-12
FORMULA_NAME ServersAndClients-PT-100160-13
FORMULA_NAME ServersAndClients-PT-100160-14
FORMULA_NAME ServersAndClients-PT-100160-15

=== Now, execution of the tool begins

BK_START 1621438565293

Running Version 0
[2021-05-19 15:36:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-19 15:36:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 15:36:17] [INFO ] Load time of PNML (sax parser for PT used): 905 ms
[2021-05-19 15:36:17] [INFO ] Transformed 16561 places.
[2021-05-19 15:36:17] [INFO ] Transformed 32200 transitions.
[2021-05-19 15:36:17] [INFO ] Found NUPN structural information;
[2021-05-19 15:36:17] [INFO ] Parsed PT model containing 16561 places and 32200 transitions in 1070 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2021-05-19 15:36:17] [INFO ] Initial state test concluded for 5 properties.
FORMULA ServersAndClients-PT-100160-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100160-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100160-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100160-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100160-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100160-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 16561 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 342 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2021-05-19 15:36:18] [INFO ] Computed 361 place invariants in 433 ms
[2021-05-19 15:36:21] [INFO ] Implicit Places using invariants in 2815 ms returned []
Implicit Place search using SMT only with invariants took 2841 ms to find 0 implicit places.
// Phase 1: matrix 32200 rows 16561 cols
[2021-05-19 15:36:21] [INFO ] Computed 361 place invariants in 245 ms
[2021-05-19 15:36:23] [INFO ] Dead Transitions using invariants and state equation in 2517 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16561/16561 places, 32200/32200 transitions.
[2021-05-19 15:36:25] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-19 15:36:25] [INFO ] Flatten gal took : 1463 ms
FORMULA ServersAndClients-PT-100160-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100160-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 15:36:26] [INFO ] Flatten gal took : 1079 ms
[2021-05-19 15:36:28] [INFO ] Input system was already deterministic with 32200 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 5484 ms. (steps per millisecond=18 ) properties (out of 16) seen :11
Running SMT prover for 5 properties.
// Phase 1: matrix 32200 rows 16561 cols
[2021-05-19 15:36:34] [INFO ] Computed 361 place invariants in 205 ms
[2021-05-19 15:36:39] [INFO ] [Real]Absence check using 261 positive place invariants in 720 ms returned sat
[2021-05-19 15:36:39] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 277 ms returned sat
[2021-05-19 15:36:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 15:37:22] [INFO ] [Real]Absence check using state equation in 41862 ms returned unsat :0 sat :4 real:1
Attempting to minimize the solution found.
Minimization took 3667 ms.
[2021-05-19 15:37:26] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :4 real:1
[2021-05-19 15:37:31] [INFO ] [Nat]Absence check using 261 positive place invariants in 724 ms returned sat
[2021-05-19 15:37:31] [INFO ] [Nat]Absence check using 261 positive and 100 generalized place invariants in 258 ms returned sat
[2021-05-19 15:37:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 15:38:17] [INFO ] [Nat]Absence check using state equation in 44683 ms returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 3568 ms.
[2021-05-19 15:38:21] [INFO ] SMT Verify possible in nat domain returned unsat :1 sat :4
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0)&&F(p1)&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 16561 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 163 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2021-05-19 15:38:21] [INFO ] Computed 361 place invariants in 227 ms
[2021-05-19 15:38:23] [INFO ] Implicit Places using invariants in 2501 ms returned []
Implicit Place search using SMT only with invariants took 2503 ms to find 0 implicit places.
// Phase 1: matrix 32200 rows 16561 cols
[2021-05-19 15:38:24] [INFO ] Computed 361 place invariants in 196 ms
[2021-05-19 15:38:26] [INFO ] Dead Transitions using invariants and state equation in 2615 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16561/16561 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 314 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-100160-04 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 5}], [{ cond=(AND p0 p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={0} source=6 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=6 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=6 dest: 2}, { cond=(NOT p0), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p0:(EQ s2990 1), p1:(OR (EQ s12002 0) (EQ s7113 1)), p2:(OR (NEQ s3785 0) (NEQ s13929 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 6 ms.
FORMULA ServersAndClients-PT-100160-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-04 finished in 5736 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 16561 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Drop transitions removed 15998 transitions
Trivial Post-agglo rules discarded 15998 transitions
Performed 15998 trivial Post agglomeration. Transition count delta: 15998
Iterating post reduction 0 with 15998 rules applied. Total rules applied 15998 place count 16561 transition count 16202
Reduce places removed 16156 places and 0 transitions.
Ensure Unique test removed 15700 transitions
Reduce isomorphic transitions removed 15700 transitions.
Iterating post reduction 1 with 31856 rules applied. Total rules applied 47854 place count 405 transition count 502
Drop transitions removed 198 transitions
Redundant transition composition rules discarded 198 transitions
Iterating global reduction 2 with 198 rules applied. Total rules applied 48052 place count 405 transition count 304
Discarding 98 places :
Implicit places reduction removed 98 places
Drop transitions removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 2 with 294 rules applied. Total rules applied 48346 place count 307 transition count 108
Reduce places removed 294 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 3 with 391 rules applied. Total rules applied 48737 place count 13 transition count 11
Applied a total of 48737 rules in 424 ms. Remains 13 /16561 variables (removed 16548) and now considering 11/32200 (removed 32189) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-19 15:38:27] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-19 15:38:27] [INFO ] Implicit Places using invariants in 34 ms returned [0, 1, 2, 3, 9, 11]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 35 ms to find 6 implicit places.
[2021-05-19 15:38:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 7 cols
[2021-05-19 15:38:27] [INFO ] Computed 1 place invariants in 3 ms
[2021-05-19 15:38:27] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 7/16561 places, 11/32200 transitions.
Graph (trivial) has 7 edges and 7 vertex of which 5 / 7 are part of one of the 1 SCC in 9 ms
Free SCC test removed 4 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Applied a total of 1 rules in 9 ms. Remains 3 /7 variables (removed 4) and now considering 5/11 (removed 6) transitions.
// Phase 1: matrix 5 rows 3 cols
[2021-05-19 15:38:27] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 15:38:27] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-19 15:38:27] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 15:38:27] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 3/16561 places, 5/32200 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-05 automaton TGBA [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:(AND (NEQ s1 0) (NEQ s2 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100160-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-05 finished in 597 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 16561 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 205 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2021-05-19 15:38:27] [INFO ] Computed 361 place invariants in 209 ms
[2021-05-19 15:38:30] [INFO ] Implicit Places using invariants in 2431 ms returned []
Implicit Place search using SMT only with invariants took 2432 ms to find 0 implicit places.
// Phase 1: matrix 32200 rows 16561 cols
[2021-05-19 15:38:30] [INFO ] Computed 361 place invariants in 201 ms
[2021-05-19 15:38:32] [INFO ] Dead Transitions using invariants and state equation in 2792 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16561/16561 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-06 automaton TGBA [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:(OR (EQ s11554 0) (EQ s10065 1) (EQ s15844 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 4249 ms.
Entered a terminal (fully accepting) state of product in 67958 steps with 0 reset in 2966 ms.
FORMULA ServersAndClients-PT-100160-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-06 finished in 12782 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((X((X(p1) U G(p1)))||p0)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 16561 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 98 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2021-05-19 15:38:40] [INFO ] Computed 361 place invariants in 198 ms
[2021-05-19 15:38:42] [INFO ] Implicit Places using invariants in 2591 ms returned []
Implicit Place search using SMT only with invariants took 2592 ms to find 0 implicit places.
// Phase 1: matrix 32200 rows 16561 cols
[2021-05-19 15:38:43] [INFO ] Computed 361 place invariants in 201 ms
[2021-05-19 15:38:45] [INFO ] Dead Transitions using invariants and state equation in 2388 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16561/16561 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100160-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s7319 0) (EQ s413 1)), p1:(OR (EQ s4291 0) (EQ s7786 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 96220 steps with 32072 reset in 10002 ms.
Product exploration explored 100000 steps with 33333 reset in 9731 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 99940 steps with 33313 reset in 10001 ms.
Product exploration timeout after 97720 steps with 32573 reset in 10001 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 16561 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Performed 15996 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15996 rules applied. Total rules applied 15996 place count 16561 transition count 32200
Discarding 155 places :
Symmetric choice reduction at 1 with 155 rule applications. Total rules 16151 place count 16406 transition count 16700
Deduced a syphon composed of 15996 places in 4 ms
Iterating global reduction 1 with 155 rules applied. Total rules applied 16306 place count 16406 transition count 16700
Deduced a syphon composed of 15996 places in 4 ms
Applied a total of 16306 rules in 6104 ms. Remains 16406 /16561 variables (removed 155) and now considering 16700/32200 (removed 15500) transitions.
[2021-05-19 15:39:31] [INFO ] Flow matrix only has 16304 transitions (discarded 396 similar events)
// Phase 1: matrix 16304 rows 16406 cols
[2021-05-19 15:39:35] [INFO ] Computed 206 place invariants in 3695 ms
[2021-05-19 15:39:36] [INFO ] Dead Transitions using invariants and state equation in 5098 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16406/16561 places, 16700/32200 transitions.
Product exploration timeout after 20730 steps with 6910 reset in 10001 ms.
Product exploration timeout after 20730 steps with 6910 reset in 10006 ms.
[2021-05-19 15:39:58] [INFO ] Flatten gal took : 1017 ms
[2021-05-19 15:39:59] [INFO ] Flatten gal took : 940 ms
[2021-05-19 15:39:59] [INFO ] Time to serialize gal into /tmp/LTL10427547873844280210.gal : 196 ms
[2021-05-19 15:39:59] [INFO ] Time to serialize properties into /tmp/LTL4974699826940181870.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10427547873844280210.gal, -t, CGAL, -LTL, /tmp/LTL4974699826940181870.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10427547873844280210.gal -t CGAL -LTL /tmp/LTL4974699826940181870.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("((sv68_c49==0)||(sv0_c11==1))")||(X((X("((sv38_c51==0)||(sv73_c11==1))"))U(G("((sv38_c51==0)||(sv73_c11==1))")))))))))
Formula 0 simplified : !XXF("((sv68_c49==0)||(sv0_c11==1))" | X(X"((sv38_c51==0)||(sv73_c11==1))" U G"((sv38_c51==0)||(sv73_c11==1))"))
Detected timeout of ITS tools.
[2021-05-19 15:40:15] [INFO ] Flatten gal took : 903 ms
[2021-05-19 15:40:15] [INFO ] Applying decomposition
[2021-05-19 15:40:16] [INFO ] Flatten gal took : 938 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16365908854735211013.txt, -o, /tmp/graph16365908854735211013.bin, -w, /tmp/graph16365908854735211013.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16365908854735211013.bin, -l, -1, -v, -w, /tmp/graph16365908854735211013.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 15:40:18] [INFO ] Decomposing Gal with order
[2021-05-19 15:40:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 15:40:27] [INFO ] Removed a total of 31581 redundant transitions.
[2021-05-19 15:40:27] [INFO ] Flatten gal took : 5855 ms
[2021-05-19 15:40:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 244 ms.
[2021-05-19 15:40:28] [INFO ] Time to serialize gal into /tmp/LTL5760501545751548688.gal : 155 ms
[2021-05-19 15:40:28] [INFO ] Time to serialize properties into /tmp/LTL3099806923606152862.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5760501545751548688.gal, -t, CGAL, -LTL, /tmp/LTL3099806923606152862.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5760501545751548688.gal -t CGAL -LTL /tmp/LTL3099806923606152862.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("((i125.u168.sv68_c49==0)||(u100.sv0_c11==1))")||(X((X("((i32.u138.sv38_c51==0)||(u173.sv73_c11==1))"))U(G("((i32.u138.sv38_c51==0)||(u173.sv73_c11==1))")))))))))
Formula 0 simplified : !XXF("((i125.u168.sv68_c49==0)||(u100.sv0_c11==1))" | X(X"((i32.u138.sv38_c51==0)||(u173.sv73_c11==1))" U G"((i32.u138.sv38_c51==0)||(u173.sv73_c11==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6121953400466183495
[2021-05-19 15:40:44] [INFO ] Built C files in 338ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6121953400466183495
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6121953400466183495]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6121953400466183495] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6121953400466183495] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ServersAndClients-PT-100160-07 finished in 124871 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(p0)&&(G(p2)||p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 16561 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 81 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2021-05-19 15:40:45] [INFO ] Computed 361 place invariants in 207 ms
[2021-05-19 15:40:48] [INFO ] Implicit Places using invariants in 2916 ms returned []
Implicit Place search using SMT only with invariants took 2917 ms to find 0 implicit places.
// Phase 1: matrix 32200 rows 16561 cols
[2021-05-19 15:40:48] [INFO ] Computed 361 place invariants in 225 ms
[2021-05-19 15:40:50] [INFO ] Dead Transitions using invariants and state equation in 2836 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16561/16561 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : ServersAndClients-PT-100160-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR p1 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s9553 0) (EQ s15864 1)), p2:(AND (NEQ s5031 0) (NEQ s14919 1)), p0:(AND (EQ s14919 0) (EQ s5031 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, terminal, 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 2 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100160-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-08 finished in 6031 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 16561 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 83 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2021-05-19 15:40:51] [INFO ] Computed 361 place invariants in 224 ms
[2021-05-19 15:40:53] [INFO ] Implicit Places using invariants in 2358 ms returned []
Implicit Place search using SMT only with invariants took 2360 ms to find 0 implicit places.
// Phase 1: matrix 32200 rows 16561 cols
[2021-05-19 15:40:53] [INFO ] Computed 361 place invariants in 224 ms
[2021-05-19 15:40:56] [INFO ] Dead Transitions using invariants and state equation in 2894 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16561/16561 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100160-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s9742 1), p1:(OR (EQ s3029 0) (EQ s12471 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 10 reset in 5416 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 2 ms.
FORMULA ServersAndClients-PT-100160-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-12 finished in 10883 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 16561 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 84 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2021-05-19 15:41:02] [INFO ] Computed 361 place invariants in 227 ms
[2021-05-19 15:41:04] [INFO ] Implicit Places using invariants in 2588 ms returned []
Implicit Place search using SMT only with invariants took 2589 ms to find 0 implicit places.
// Phase 1: matrix 32200 rows 16561 cols
[2021-05-19 15:41:04] [INFO ] Computed 361 place invariants in 195 ms
[2021-05-19 15:41:07] [INFO ] Dead Transitions using invariants and state equation in 2771 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16561/16561 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : ServersAndClients-PT-100160-13 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s14383 1), p1:(OR (EQ s14633 0) (EQ s3910 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 34538 steps with 0 reset in 1501 ms.
FORMULA ServersAndClients-PT-100160-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-13 finished in 7101 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 16561 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Drop transitions removed 15999 transitions
Trivial Post-agglo rules discarded 15999 transitions
Performed 15999 trivial Post agglomeration. Transition count delta: 15999
Iterating post reduction 0 with 15999 rules applied. Total rules applied 15999 place count 16561 transition count 16201
Reduce places removed 16158 places and 0 transitions.
Ensure Unique test removed 15800 transitions
Reduce isomorphic transitions removed 15800 transitions.
Iterating post reduction 1 with 31958 rules applied. Total rules applied 47957 place count 403 transition count 401
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 48056 place count 403 transition count 302
Discarding 99 places :
Implicit places reduction removed 99 places
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 2 with 297 rules applied. Total rules applied 48353 place count 304 transition count 104
Reduce places removed 297 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 395 rules applied. Total rules applied 48748 place count 7 transition count 6
Applied a total of 48748 rules in 257 ms. Remains 7 /16561 variables (removed 16554) and now considering 6/32200 (removed 32194) transitions.
// Phase 1: matrix 6 rows 7 cols
[2021-05-19 15:41:09] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-19 15:41:09] [INFO ] Implicit Places using invariants in 11 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 11 ms to find 3 implicit places.
[2021-05-19 15:41:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2021-05-19 15:41:09] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 15:41:09] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 4/16561 places, 6/32200 transitions.
Graph (trivial) has 4 edges and 4 vertex of which 3 / 4 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 1 ms. Remains 2 /4 variables (removed 2) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-19 15:41:09] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 15:41:09] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-19 15:41:09] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 15:41:09] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2/16561 places, 3/32200 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-15 automaton TGBA [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:(EQ s1 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100160-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-15 finished in 388 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12271316807196018740
[2021-05-19 15:41:09] [INFO ] Too many transitions (32200) to apply POR reductions. Disabling POR matrices.
[2021-05-19 15:41:10] [INFO ] Built C files in 267ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12271316807196018740
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12271316807196018740]
[2021-05-19 15:41:10] [INFO ] Applying decomposition
[2021-05-19 15:41:11] [INFO ] Flatten gal took : 1248 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13155496004939762683.txt, -o, /tmp/graph13155496004939762683.bin, -w, /tmp/graph13155496004939762683.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13155496004939762683.bin, -l, -1, -v, -w, /tmp/graph13155496004939762683.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 15:41:13] [INFO ] Decomposing Gal with order
[2021-05-19 15:41:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 15:41:21] [INFO ] Removed a total of 31594 redundant transitions.
[2021-05-19 15:41:22] [INFO ] Flatten gal took : 5688 ms
[2021-05-19 15:41:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 127 ms.
[2021-05-19 15:41:22] [INFO ] Time to serialize gal into /tmp/LTLCardinality18295729941028644970.gal : 303 ms
[2021-05-19 15:41:22] [INFO ] Time to serialize properties into /tmp/LTLCardinality8416703188540814345.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality18295729941028644970.gal, -t, CGAL, -LTL, /tmp/LTLCardinality8416703188540814345.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality18295729941028644970.gal -t CGAL -LTL /tmp/LTLCardinality8416703188540814345.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("((i22.u168.sv68_c49==0)||(u100.sv0_c11==1))")||(X((X("((u51.sv38_c51==0)||(u173.sv73_c11==1))"))U(G("((u51.sv38_c51==0)||(u173.sv73_c11==1))")))))))))
Formula 0 simplified : !XXF("((i22.u168.sv68_c49==0)||(u100.sv0_c11==1))" | X(X"((u51.sv38_c51==0)||(u173.sv73_c11==1))" U G"((u51.sv38_c51==0)||(u173.sv73_c11==1))"))
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12271316807196018740] killed by timeout after 45 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12271316807196018740] killed by timeout after 45 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
36342 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,373.495,2330748,1,0,2.18729e+06,1.1287e+06,171507,744931,4880,3.75898e+06,191639
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ServersAndClients-PT-100160-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1621439258396

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="ServersAndClients-PT-100160"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ServersAndClients-PT-100160, 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 r311-tall-162132107900148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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