Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.2K Apr 29 12:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 29 12:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 29 12:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 29 12:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K May 9 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 9 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.4M May 10 09:33 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 CANConstruction-PT-030-LTLFireability-00
FORMULA_NAME CANConstruction-PT-030-LTLFireability-01
FORMULA_NAME CANConstruction-PT-030-LTLFireability-02
FORMULA_NAME CANConstruction-PT-030-LTLFireability-03
FORMULA_NAME CANConstruction-PT-030-LTLFireability-04
FORMULA_NAME CANConstruction-PT-030-LTLFireability-05
FORMULA_NAME CANConstruction-PT-030-LTLFireability-06
FORMULA_NAME CANConstruction-PT-030-LTLFireability-07
FORMULA_NAME CANConstruction-PT-030-LTLFireability-08
FORMULA_NAME CANConstruction-PT-030-LTLFireability-09
FORMULA_NAME CANConstruction-PT-030-LTLFireability-10
FORMULA_NAME CANConstruction-PT-030-LTLFireability-11
FORMULA_NAME CANConstruction-PT-030-LTLFireability-12
FORMULA_NAME CANConstruction-PT-030-LTLFireability-13
FORMULA_NAME CANConstruction-PT-030-LTLFireability-14
FORMULA_NAME CANConstruction-PT-030-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652645952046

Running Version 202205111006
[2022-05-15 20:19:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 20:19:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 20:19:13] [INFO ] Load time of PNML (sax parser for PT used): 225 ms
[2022-05-15 20:19:13] [INFO ] Transformed 2162 places.
[2022-05-15 20:19:13] [INFO ] Transformed 3840 transitions.
[2022-05-15 20:19:13] [INFO ] Parsed PT model containing 2162 places and 3840 transitions in 351 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CANConstruction-PT-030-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-030-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-030-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-030-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-030-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 2162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2162/2162 places, 3840/3840 transitions.
Discarding 828 places :
Symmetric choice reduction at 0 with 828 rule applications. Total rules 828 place count 1334 transition count 2184
Iterating global reduction 0 with 828 rules applied. Total rules applied 1656 place count 1334 transition count 2184
Applied a total of 1656 rules in 334 ms. Remains 1334 /2162 variables (removed 828) and now considering 2184/3840 (removed 1656) transitions.
// Phase 1: matrix 2184 rows 1334 cols
[2022-05-15 20:19:14] [INFO ] Computed 61 place invariants in 45 ms
[2022-05-15 20:19:15] [INFO ] Implicit Places using invariants in 954 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 986 ms to find 30 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1304/2162 places, 2184/3840 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 1275 transition count 2155
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 1275 transition count 2155
Applied a total of 58 rules in 158 ms. Remains 1275 /1304 variables (removed 29) and now considering 2155/2184 (removed 29) transitions.
// Phase 1: matrix 2155 rows 1275 cols
[2022-05-15 20:19:15] [INFO ] Computed 31 place invariants in 23 ms
[2022-05-15 20:19:15] [INFO ] Implicit Places using invariants in 622 ms returned []
// Phase 1: matrix 2155 rows 1275 cols
[2022-05-15 20:19:15] [INFO ] Computed 31 place invariants in 33 ms
[2022-05-15 20:19:16] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:19:24] [INFO ] Implicit Places using invariants and state equation in 8566 ms returned []
Implicit Place search using SMT with State Equation took 9197 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1275/2162 places, 2155/3840 transitions.
Finished structural reductions, in 2 iterations. Remains : 1275/2162 places, 2155/3840 transitions.
Support contains 29 out of 1275 places after structural reductions.
[2022-05-15 20:19:24] [INFO ] Flatten gal took : 154 ms
[2022-05-15 20:19:24] [INFO ] Flatten gal took : 108 ms
[2022-05-15 20:19:25] [INFO ] Input system was already deterministic with 2155 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 590 ms. (steps per millisecond=16 ) properties (out of 22) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2155 rows 1275 cols
[2022-05-15 20:19:25] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-15 20:19:26] [INFO ] [Real]Absence check using 31 positive place invariants in 27 ms returned sat
[2022-05-15 20:19:27] [INFO ] After 654ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:6
[2022-05-15 20:19:27] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:19:27] [INFO ] After 160ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-15 20:19:27] [INFO ] After 1519ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-15 20:19:27] [INFO ] [Nat]Absence check using 31 positive place invariants in 31 ms returned sat
[2022-05-15 20:19:28] [INFO ] After 943ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-15 20:19:29] [INFO ] After 732ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-15 20:19:30] [INFO ] After 1630ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 539 ms.
[2022-05-15 20:19:30] [INFO ] After 3568ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 6 properties in 25 ms.
Support contains 3 out of 1275 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1275/1275 places, 2155/2155 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1275 transition count 1955
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1075 transition count 1955
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 400 place count 1075 transition count 1925
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 460 place count 1045 transition count 1925
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 471 place count 1034 transition count 1903
Iterating global reduction 2 with 11 rules applied. Total rules applied 482 place count 1034 transition count 1903
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 10 rules applied. Total rules applied 492 place count 1034 transition count 1893
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 502 place count 1024 transition count 1893
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 560 place count 995 transition count 1864
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 561 place count 995 transition count 1863
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 562 place count 994 transition count 1863
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 563 place count 994 transition count 1863
Applied a total of 563 rules in 550 ms. Remains 994 /1275 variables (removed 281) and now considering 1863/2155 (removed 292) transitions.
Finished structural reductions, in 1 iterations. Remains : 994/1275 places, 1863/2155 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 261108 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 261108 steps, saw 50757 distinct states, run finished after 3002 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1863 rows 994 cols
[2022-05-15 20:19:34] [INFO ] Computed 31 place invariants in 24 ms
[2022-05-15 20:19:34] [INFO ] [Real]Absence check using 31 positive place invariants in 19 ms returned sat
[2022-05-15 20:19:35] [INFO ] After 452ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 20:19:35] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:19:35] [INFO ] After 190ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:19:35] [INFO ] After 831ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:19:35] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-15 20:19:36] [INFO ] After 486ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:19:36] [INFO ] After 240ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:19:36] [INFO ] After 336ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2022-05-15 20:19:36] [INFO ] After 1061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 25 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 1 ms.
Computed a total of 92 stabilizing places and 121 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p0)||p1))||F(X(p2))))'
Support contains 4 out of 1275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1275/1275 places, 2155/2155 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1264 transition count 2134
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1264 transition count 2134
Applied a total of 22 rules in 96 ms. Remains 1264 /1275 variables (removed 11) and now considering 2134/2155 (removed 21) transitions.
// Phase 1: matrix 2134 rows 1264 cols
[2022-05-15 20:19:36] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-15 20:19:37] [INFO ] Implicit Places using invariants in 609 ms returned []
// Phase 1: matrix 2134 rows 1264 cols
[2022-05-15 20:19:37] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-15 20:19:38] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:19:45] [INFO ] Implicit Places using invariants and state equation in 7845 ms returned []
Implicit Place search using SMT with State Equation took 8457 ms to find 0 implicit places.
// Phase 1: matrix 2134 rows 1264 cols
[2022-05-15 20:19:45] [INFO ] Computed 31 place invariants in 18 ms
[2022-05-15 20:19:46] [INFO ] Dead Transitions using invariants and state equation in 857 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1264/1275 places, 2134/2155 transitions.
Finished structural reductions, in 1 iterations. Remains : 1264/1275 places, 2134/2155 transitions.
Stuttering acceptance computed with spot in 358 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s18 1) (GEQ s167 1)), p1:(AND (GEQ s18 1) (GEQ s167 1) (GEQ s730 1)), p0:(GEQ s506 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1009 steps with 1 reset in 19 ms.
FORMULA CANConstruction-PT-030-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-01 finished in 9848 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 1 out of 1275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1275/1275 places, 2155/2155 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1263 transition count 2131
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1263 transition count 2131
Applied a total of 24 rules in 94 ms. Remains 1263 /1275 variables (removed 12) and now considering 2131/2155 (removed 24) transitions.
// Phase 1: matrix 2131 rows 1263 cols
[2022-05-15 20:19:46] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-15 20:19:47] [INFO ] Implicit Places using invariants in 587 ms returned []
// Phase 1: matrix 2131 rows 1263 cols
[2022-05-15 20:19:47] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-15 20:19:48] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:19:55] [INFO ] Implicit Places using invariants and state equation in 7711 ms returned []
Implicit Place search using SMT with State Equation took 8316 ms to find 0 implicit places.
// Phase 1: matrix 2131 rows 1263 cols
[2022-05-15 20:19:55] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-15 20:19:55] [INFO ] Dead Transitions using invariants and state equation in 862 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1263/1275 places, 2131/2155 transitions.
Finished structural reductions, in 1 iterations. Remains : 1263/1275 places, 2131/2155 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s161 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 517 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-030-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-02 finished in 9408 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((p0||((G(p1)||p2)&&p3)))))'
Support contains 8 out of 1275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1275/1275 places, 2155/2155 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1262 transition count 2130
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1262 transition count 2130
Applied a total of 26 rules in 90 ms. Remains 1262 /1275 variables (removed 13) and now considering 2130/2155 (removed 25) transitions.
// Phase 1: matrix 2130 rows 1262 cols
[2022-05-15 20:19:56] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-15 20:19:56] [INFO ] Implicit Places using invariants in 541 ms returned []
// Phase 1: matrix 2130 rows 1262 cols
[2022-05-15 20:19:56] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-15 20:19:57] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:20:03] [INFO ] Implicit Places using invariants and state equation in 7193 ms returned []
Implicit Place search using SMT with State Equation took 7746 ms to find 0 implicit places.
// Phase 1: matrix 2130 rows 1262 cols
[2022-05-15 20:20:04] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-15 20:20:04] [INFO ] Dead Transitions using invariants and state equation in 897 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1262/1275 places, 2130/2155 transitions.
Finished structural reductions, in 1 iterations. Remains : 1262/1275 places, 2130/2155 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p2) p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3) p1) (AND (NOT p0) (NOT p2) p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s138 1) (GEQ s751 1)), p3:(OR (LT s138 1) (LT s751 1) (AND (GEQ s126 1) (GEQ s191 1))), p2:(AND (GEQ s11 1) (GEQ s102 1)), p1:(AND (GEQ s23 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1174 steps with 2 reset in 14 ms.
FORMULA CANConstruction-PT-030-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-04 finished in 9043 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(F((!(G(p1) U X(X(!p0)))&&p1))))))'
Support contains 2 out of 1275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1275/1275 places, 2155/2155 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1263 transition count 2132
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1263 transition count 2132
Applied a total of 24 rules in 91 ms. Remains 1263 /1275 variables (removed 12) and now considering 2132/2155 (removed 23) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2022-05-15 20:20:05] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 20:20:05] [INFO ] Implicit Places using invariants in 570 ms returned []
// Phase 1: matrix 2132 rows 1263 cols
[2022-05-15 20:20:05] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 20:20:06] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:20:13] [INFO ] Implicit Places using invariants and state equation in 7883 ms returned []
Implicit Place search using SMT with State Equation took 8456 ms to find 0 implicit places.
// Phase 1: matrix 2132 rows 1263 cols
[2022-05-15 20:20:13] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-15 20:20:14] [INFO ] Dead Transitions using invariants and state equation in 862 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1263/1275 places, 2132/2155 transitions.
Finished structural reductions, in 1 iterations. Remains : 1263/1275 places, 2132/2155 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 5}, { cond=p1, acceptance={} source=3 dest: 6}, { cond=p1, acceptance={0} source=3 dest: 7}], [{ cond=p1, acceptance={} source=4 dest: 6}, { cond=p1, acceptance={0} source=4 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=6 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={0} source=7 dest: 7}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(GEQ s212 1), p0:(LT s444 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 8666 steps with 121 reset in 46 ms.
FORMULA CANConstruction-PT-030-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-06 finished in 9820 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0 U (G(p0)||(p0&&G(p1)))))))'
Support contains 2 out of 1275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1275/1275 places, 2155/2155 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1264 transition count 2134
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1264 transition count 2134
Applied a total of 22 rules in 86 ms. Remains 1264 /1275 variables (removed 11) and now considering 2134/2155 (removed 21) transitions.
// Phase 1: matrix 2134 rows 1264 cols
[2022-05-15 20:20:15] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 20:20:15] [INFO ] Implicit Places using invariants in 512 ms returned []
// Phase 1: matrix 2134 rows 1264 cols
[2022-05-15 20:20:15] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 20:20:16] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:20:22] [INFO ] Implicit Places using invariants and state equation in 7091 ms returned []
Implicit Place search using SMT with State Equation took 7615 ms to find 0 implicit places.
// Phase 1: matrix 2134 rows 1264 cols
[2022-05-15 20:20:22] [INFO ] Computed 31 place invariants in 20 ms
[2022-05-15 20:20:23] [INFO ] Dead Transitions using invariants and state equation in 877 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1264/1275 places, 2134/2155 transitions.
Finished structural reductions, in 1 iterations. Remains : 1264/1275 places, 2134/2155 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(LT s790 1), p0:(LT s1126 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 190 reset in 448 ms.
Product exploration explored 100000 steps with 190 reset in 573 ms.
Computed a total of 91 stabilizing places and 120 stable transitions
Computed a total of 91 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 398 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2134 rows 1264 cols
[2022-05-15 20:20:25] [INFO ] Computed 31 place invariants in 27 ms
[2022-05-15 20:20:25] [INFO ] [Real]Absence check using 31 positive place invariants in 22 ms returned sat
[2022-05-15 20:20:26] [INFO ] After 757ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:20:26] [INFO ] [Nat]Absence check using 31 positive place invariants in 23 ms returned sat
[2022-05-15 20:20:27] [INFO ] After 543ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:20:27] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:20:27] [INFO ] After 216ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:20:27] [INFO ] After 331ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2022-05-15 20:20:27] [INFO ] After 1146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 1264 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1264/1264 places, 2134/2134 transitions.
Drop transitions removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 208 rules applied. Total rules applied 208 place count 1264 transition count 1926
Reduce places removed 208 places and 0 transitions.
Iterating post reduction 1 with 208 rules applied. Total rules applied 416 place count 1056 transition count 1926
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 416 place count 1056 transition count 1896
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 476 place count 1026 transition count 1896
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 540 place count 994 transition count 1864
Applied a total of 540 rules in 160 ms. Remains 994 /1264 variables (removed 270) and now considering 1864/2134 (removed 270) transitions.
Finished structural reductions, in 1 iterations. Remains : 994/1264 places, 1864/2134 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 263965 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 263965 steps, saw 51997 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:20:30] [INFO ] Computed 31 place invariants in 22 ms
[2022-05-15 20:20:31] [INFO ] [Real]Absence check using 31 positive place invariants in 33 ms returned sat
[2022-05-15 20:20:31] [INFO ] After 433ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 20:20:31] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:20:31] [INFO ] After 243ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:20:31] [INFO ] After 951ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:20:31] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2022-05-15 20:20:32] [INFO ] After 409ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:20:32] [INFO ] After 195ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:20:32] [INFO ] After 287ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2022-05-15 20:20:32] [INFO ] After 938ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 402 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1264/1264 places, 2134/2134 transitions.
Applied a total of 0 rules in 47 ms. Remains 1264 /1264 variables (removed 0) and now considering 2134/2134 (removed 0) transitions.
// Phase 1: matrix 2134 rows 1264 cols
[2022-05-15 20:20:33] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-15 20:20:34] [INFO ] Implicit Places using invariants in 756 ms returned []
// Phase 1: matrix 2134 rows 1264 cols
[2022-05-15 20:20:34] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-15 20:20:34] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:20:41] [INFO ] Implicit Places using invariants and state equation in 7171 ms returned []
Implicit Place search using SMT with State Equation took 7932 ms to find 0 implicit places.
// Phase 1: matrix 2134 rows 1264 cols
[2022-05-15 20:20:41] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-15 20:20:42] [INFO ] Dead Transitions using invariants and state equation in 837 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1264/1264 places, 2134/2134 transitions.
Computed a total of 91 stabilizing places and 120 stable transitions
Computed a total of 91 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 317 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2134 rows 1264 cols
[2022-05-15 20:20:42] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 20:20:43] [INFO ] [Real]Absence check using 31 positive place invariants in 22 ms returned sat
[2022-05-15 20:20:43] [INFO ] After 779ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 20:20:43] [INFO ] [Nat]Absence check using 31 positive place invariants in 22 ms returned sat
[2022-05-15 20:20:44] [INFO ] After 566ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 20:20:44] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:20:44] [INFO ] After 333ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 20:20:44] [INFO ] After 541ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 143 ms.
[2022-05-15 20:20:45] [INFO ] After 1470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 1264 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1264/1264 places, 2134/2134 transitions.
Drop transitions removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 208 rules applied. Total rules applied 208 place count 1264 transition count 1926
Reduce places removed 208 places and 0 transitions.
Iterating post reduction 1 with 208 rules applied. Total rules applied 416 place count 1056 transition count 1926
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 416 place count 1056 transition count 1896
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 476 place count 1026 transition count 1896
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 540 place count 994 transition count 1864
Applied a total of 540 rules in 174 ms. Remains 994 /1264 variables (removed 270) and now considering 1864/2134 (removed 270) transitions.
Finished structural reductions, in 1 iterations. Remains : 994/1264 places, 1864/2134 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:20:45] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 20:20:45] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-15 20:20:46] [INFO ] After 410ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 20:20:46] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:20:46] [INFO ] After 162ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:20:46] [INFO ] After 843ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:20:46] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-15 20:20:46] [INFO ] After 501ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:20:47] [INFO ] After 195ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:20:47] [INFO ] After 286ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2022-05-15 20:20:47] [INFO ] After 997ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 424 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 185 reset in 426 ms.
Product exploration explored 100000 steps with 189 reset in 412 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1264/1264 places, 2134/2134 transitions.
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 1264 transition count 2134
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 120 place count 1264 transition count 2134
Deduced a syphon composed of 150 places in 1 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 150 place count 1264 transition count 2134
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 210 place count 1204 transition count 2074
Deduced a syphon composed of 90 places in 1 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 270 place count 1204 transition count 2074
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 390 place count 1204 transition count 2074
Discarding 150 places :
Symmetric choice reduction at 1 with 150 rule applications. Total rules 540 place count 1054 transition count 1924
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 1 with 150 rules applied. Total rules applied 690 place count 1054 transition count 1924
Deduced a syphon composed of 60 places in 0 ms
Applied a total of 690 rules in 732 ms. Remains 1054 /1264 variables (removed 210) and now considering 1924/2134 (removed 210) transitions.
[2022-05-15 20:20:50] [INFO ] Redundant transitions in 187 ms returned []
// Phase 1: matrix 1924 rows 1054 cols
[2022-05-15 20:20:50] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-15 20:20:50] [INFO ] Dead Transitions using invariants and state equation in 799 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1054/1264 places, 1924/2134 transitions.
Finished structural reductions, in 1 iterations. Remains : 1054/1264 places, 1924/2134 transitions.
Product exploration explored 100000 steps with 484 reset in 684 ms.
Product exploration explored 100000 steps with 485 reset in 647 ms.
Built C files in :
/tmp/ltsmin2740073664364503955
[2022-05-15 20:20:52] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2740073664364503955
Running compilation step : cd /tmp/ltsmin2740073664364503955;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2740073664364503955;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2740073664364503955;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 1264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1264/1264 places, 2134/2134 transitions.
Applied a total of 0 rules in 80 ms. Remains 1264 /1264 variables (removed 0) and now considering 2134/2134 (removed 0) transitions.
// Phase 1: matrix 2134 rows 1264 cols
[2022-05-15 20:20:55] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 20:20:56] [INFO ] Implicit Places using invariants in 1537 ms returned []
// Phase 1: matrix 2134 rows 1264 cols
[2022-05-15 20:20:56] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 20:20:57] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:21:04] [INFO ] Implicit Places using invariants and state equation in 7267 ms returned []
Implicit Place search using SMT with State Equation took 8820 ms to find 0 implicit places.
// Phase 1: matrix 2134 rows 1264 cols
[2022-05-15 20:21:04] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-15 20:21:05] [INFO ] Dead Transitions using invariants and state equation in 861 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1264/1264 places, 2134/2134 transitions.
Built C files in :
/tmp/ltsmin12906907171509276502
[2022-05-15 20:21:05] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12906907171509276502
Running compilation step : cd /tmp/ltsmin12906907171509276502;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12906907171509276502;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12906907171509276502;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 20:21:08] [INFO ] Flatten gal took : 172 ms
[2022-05-15 20:21:08] [INFO ] Flatten gal took : 139 ms
[2022-05-15 20:21:08] [INFO ] Time to serialize gal into /tmp/LTL7716514610553827345.gal : 55 ms
[2022-05-15 20:21:08] [INFO ] Time to serialize properties into /tmp/LTL13794305106441018.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7716514610553827345.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13794305106441018.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7716514...264
Read 1 LTL properties
Checking formula 0 : !((X(F(("(Node25GiveAnswer7<1)")U((G("(Node25GiveAnswer7<1)"))||(("(Node25GiveAnswer7<1)")&&(G("(Node13GiveAnswer21<1)"))))))))
Formula 0 simplified : !XF("(Node25GiveAnswer7<1)" U (G"(Node25GiveAnswer7<1)" | ("(Node25GiveAnswer7<1)" & G"(Node13GiveAnswer21<1)")))
Detected timeout of ITS tools.
[2022-05-15 20:21:24] [INFO ] Flatten gal took : 143 ms
[2022-05-15 20:21:24] [INFO ] Applying decomposition
[2022-05-15 20:21:24] [INFO ] Flatten gal took : 119 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9023587930343142106.txt' '-o' '/tmp/graph9023587930343142106.bin' '-w' '/tmp/graph9023587930343142106.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9023587930343142106.bin' '-l' '-1' '-v' '-w' '/tmp/graph9023587930343142106.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:21:24] [INFO ] Decomposing Gal with order
[2022-05-15 20:21:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:21:25] [INFO ] Removed a total of 1823 redundant transitions.
[2022-05-15 20:21:26] [INFO ] Flatten gal took : 1103 ms
[2022-05-15 20:21:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 3520 labels/synchronizations in 193 ms.
[2022-05-15 20:21:26] [INFO ] Time to serialize gal into /tmp/LTL1486361553757015679.gal : 38 ms
[2022-05-15 20:21:26] [INFO ] Time to serialize properties into /tmp/LTL14436542694029795439.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1486361553757015679.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14436542694029795439.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1486361...246
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i8.u32.Node25GiveAnswer7<1)")U((G("(i8.u32.Node25GiveAnswer7<1)"))||(("(i8.u32.Node25GiveAnswer7<1)")&&(G("(i22.u98.Node13Gi...177
Formula 0 simplified : !XF("(i8.u32.Node25GiveAnswer7<1)" U (G"(i8.u32.Node25GiveAnswer7<1)" | ("(i8.u32.Node25GiveAnswer7<1)" & G"(i22.u98.Node13GiveAnswe...165
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12356839947303211059
[2022-05-15 20:21:41] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12356839947303211059
Running compilation step : cd /tmp/ltsmin12356839947303211059;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12356839947303211059;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12356839947303211059;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANConstruction-PT-030-LTLFireability-07 finished in 89552 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(X((X(F(X(p0)))&&X(p0)))))))'
Support contains 2 out of 1275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1275/1275 places, 2155/2155 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1262 transition count 2130
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1262 transition count 2130
Applied a total of 26 rules in 67 ms. Remains 1262 /1275 variables (removed 13) and now considering 2130/2155 (removed 25) transitions.
// Phase 1: matrix 2130 rows 1262 cols
[2022-05-15 20:21:44] [INFO ] Computed 31 place invariants in 25 ms
[2022-05-15 20:21:45] [INFO ] Implicit Places using invariants in 733 ms returned []
// Phase 1: matrix 2130 rows 1262 cols
[2022-05-15 20:21:45] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-15 20:21:46] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:21:52] [INFO ] Implicit Places using invariants and state equation in 7574 ms returned []
Implicit Place search using SMT with State Equation took 8323 ms to find 0 implicit places.
// Phase 1: matrix 2130 rows 1262 cols
[2022-05-15 20:21:52] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-15 20:21:53] [INFO ] Dead Transitions using invariants and state equation in 850 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1262/1275 places, 2130/2155 transitions.
Finished structural reductions, in 1 iterations. Remains : 1262/1275 places, 2130/2155 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (GEQ s119 1) (GEQ s354 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-030-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-09 finished in 9433 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U F(!(X(F(p0)) U X(G(p1))))))'
Support contains 3 out of 1275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1275/1275 places, 2155/2155 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1263 transition count 2132
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1263 transition count 2132
Applied a total of 24 rules in 74 ms. Remains 1263 /1275 variables (removed 12) and now considering 2132/2155 (removed 23) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2022-05-15 20:21:54] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-15 20:21:54] [INFO ] Implicit Places using invariants in 591 ms returned []
// Phase 1: matrix 2132 rows 1263 cols
[2022-05-15 20:21:54] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-15 20:21:55] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:22:02] [INFO ] Implicit Places using invariants and state equation in 7568 ms returned []
Implicit Place search using SMT with State Equation took 8177 ms to find 0 implicit places.
// Phase 1: matrix 2132 rows 1263 cols
[2022-05-15 20:22:02] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 20:22:03] [INFO ] Dead Transitions using invariants and state equation in 840 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1263/1275 places, 2132/2155 transitions.
Finished structural reductions, in 1 iterations. Remains : 1263/1275 places, 2132/2155 transitions.
Stuttering acceptance computed with spot in 120 ms :[p1, p1, p1, (AND p0 p1)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s559 1), p1:(AND (GEQ s270 1) (GEQ s287 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 187 reset in 402 ms.
Product exploration explored 100000 steps with 187 reset in 381 ms.
Computed a total of 91 stabilizing places and 120 stable transitions
Computed a total of 91 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 314 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 122 ms :[p1, p1, p1, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 17 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2132 rows 1263 cols
[2022-05-15 20:22:04] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-15 20:22:04] [INFO ] [Real]Absence check using 31 positive place invariants in 20 ms returned sat
[2022-05-15 20:22:05] [INFO ] After 540ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2022-05-15 20:22:05] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:22:05] [INFO ] After 182ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-15 20:22:05] [INFO ] After 934ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-15 20:22:05] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2022-05-15 20:22:06] [INFO ] After 507ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-15 20:22:06] [INFO ] After 154ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2022-05-15 20:22:06] [INFO ] After 255ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2022-05-15 20:22:06] [INFO ] After 1025ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 7 factoid took 306 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 132 ms :[p1, p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 119 ms :[p1, p1, p1, (AND p0 p1)]
Support contains 3 out of 1263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1263/1263 places, 2132/2132 transitions.
Applied a total of 0 rules in 44 ms. Remains 1263 /1263 variables (removed 0) and now considering 2132/2132 (removed 0) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2022-05-15 20:22:07] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-15 20:22:07] [INFO ] Implicit Places using invariants in 580 ms returned []
// Phase 1: matrix 2132 rows 1263 cols
[2022-05-15 20:22:07] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-15 20:22:08] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:22:15] [INFO ] Implicit Places using invariants and state equation in 7454 ms returned []
Implicit Place search using SMT with State Equation took 8036 ms to find 0 implicit places.
// Phase 1: matrix 2132 rows 1263 cols
[2022-05-15 20:22:15] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-15 20:22:16] [INFO ] Dead Transitions using invariants and state equation in 860 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1263/1263 places, 2132/2132 transitions.
Computed a total of 91 stabilizing places and 120 stable transitions
Computed a total of 91 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 160 ms :[p1, p1, p1, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2132 rows 1263 cols
[2022-05-15 20:22:16] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-15 20:22:16] [INFO ] [Real]Absence check using 31 positive place invariants in 21 ms returned sat
[2022-05-15 20:22:17] [INFO ] After 600ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 20:22:17] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:22:17] [INFO ] After 188ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:22:17] [INFO ] After 1007ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:22:17] [INFO ] [Nat]Absence check using 31 positive place invariants in 23 ms returned sat
[2022-05-15 20:22:18] [INFO ] After 583ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:22:18] [INFO ] After 180ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:22:18] [INFO ] After 294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2022-05-15 20:22:18] [INFO ] After 1145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 5 factoid took 246 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 152 ms :[p1, p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 165 ms :[p1, p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 152 ms :[p1, p1, p1, (AND p0 p1)]
Product exploration explored 100000 steps with 189 reset in 436 ms.
Product exploration explored 100000 steps with 196 reset in 467 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 172 ms :[p1, p1, p1, (AND p0 p1)]
Support contains 3 out of 1263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1263/1263 places, 2132/2132 transitions.
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 1263 transition count 2132
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 31 Pre rules applied. Total rules applied 119 place count 1263 transition count 2132
Deduced a syphon composed of 150 places in 1 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 150 place count 1263 transition count 2132
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 210 place count 1203 transition count 2072
Deduced a syphon composed of 90 places in 1 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 270 place count 1203 transition count 2072
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 208 places in 1 ms
Iterating global reduction 1 with 118 rules applied. Total rules applied 388 place count 1203 transition count 2072
Discarding 147 places :
Symmetric choice reduction at 1 with 147 rule applications. Total rules 535 place count 1056 transition count 1925
Deduced a syphon composed of 61 places in 1 ms
Iterating global reduction 1 with 147 rules applied. Total rules applied 682 place count 1056 transition count 1925
Deduced a syphon composed of 61 places in 1 ms
Applied a total of 682 rules in 212 ms. Remains 1056 /1263 variables (removed 207) and now considering 1925/2132 (removed 207) transitions.
[2022-05-15 20:22:20] [INFO ] Redundant transitions in 44 ms returned []
// Phase 1: matrix 1925 rows 1056 cols
[2022-05-15 20:22:20] [INFO ] Computed 31 place invariants in 17 ms
[2022-05-15 20:22:21] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1056/1263 places, 1925/2132 transitions.
Finished structural reductions, in 1 iterations. Remains : 1056/1263 places, 1925/2132 transitions.
Product exploration explored 100000 steps with 481 reset in 634 ms.
Product exploration explored 100000 steps with 479 reset in 639 ms.
Built C files in :
/tmp/ltsmin7812728160256771001
[2022-05-15 20:22:22] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7812728160256771001
Running compilation step : cd /tmp/ltsmin7812728160256771001;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7812728160256771001;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7812728160256771001;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 1263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1263/1263 places, 2132/2132 transitions.
Applied a total of 0 rules in 32 ms. Remains 1263 /1263 variables (removed 0) and now considering 2132/2132 (removed 0) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2022-05-15 20:22:25] [INFO ] Computed 31 place invariants in 17 ms
[2022-05-15 20:22:26] [INFO ] Implicit Places using invariants in 565 ms returned []
// Phase 1: matrix 2132 rows 1263 cols
[2022-05-15 20:22:26] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 20:22:27] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:22:34] [INFO ] Implicit Places using invariants and state equation in 8166 ms returned []
Implicit Place search using SMT with State Equation took 8733 ms to find 0 implicit places.
// Phase 1: matrix 2132 rows 1263 cols
[2022-05-15 20:22:34] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-15 20:22:35] [INFO ] Dead Transitions using invariants and state equation in 916 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1263/1263 places, 2132/2132 transitions.
Built C files in :
/tmp/ltsmin16358273385885907719
[2022-05-15 20:22:35] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16358273385885907719
Running compilation step : cd /tmp/ltsmin16358273385885907719;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16358273385885907719;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16358273385885907719;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 20:22:38] [INFO ] Flatten gal took : 64 ms
[2022-05-15 20:22:38] [INFO ] Flatten gal took : 63 ms
[2022-05-15 20:22:38] [INFO ] Time to serialize gal into /tmp/LTL8209871198224838244.gal : 22 ms
[2022-05-15 20:22:38] [INFO ] Time to serialize properties into /tmp/LTL10494845269666796830.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8209871198224838244.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10494845269666796830.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8209871...267
Read 1 LTL properties
Checking formula 0 : !((("(Node5GiveAnswer22>=1)")U(F(!((X(F("(Node5GiveAnswer22>=1)")))U(X(G("((Node22IsInserted>=1)&&(Node23Request>=1))"))))))))
Formula 0 simplified : !("(Node5GiveAnswer22>=1)" U F!(XF"(Node5GiveAnswer22>=1)" U XG"((Node22IsInserted>=1)&&(Node23Request>=1))"))
Detected timeout of ITS tools.
[2022-05-15 20:22:53] [INFO ] Flatten gal took : 58 ms
[2022-05-15 20:22:53] [INFO ] Applying decomposition
[2022-05-15 20:22:53] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3937683122545277668.txt' '-o' '/tmp/graph3937683122545277668.bin' '-w' '/tmp/graph3937683122545277668.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3937683122545277668.bin' '-l' '-1' '-v' '-w' '/tmp/graph3937683122545277668.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:22:54] [INFO ] Decomposing Gal with order
[2022-05-15 20:22:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:22:54] [INFO ] Removed a total of 1824 redundant transitions.
[2022-05-15 20:22:54] [INFO ] Flatten gal took : 242 ms
[2022-05-15 20:22:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 3474 labels/synchronizations in 73 ms.
[2022-05-15 20:22:54] [INFO ] Time to serialize gal into /tmp/LTL11282480590615369093.gal : 16 ms
[2022-05-15 20:22:54] [INFO ] Time to serialize properties into /tmp/LTL2879112716221940363.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11282480590615369093.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2879112716221940363.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1128248...246
Read 1 LTL properties
Checking formula 0 : !((("(i22.u106.Node5GiveAnswer22>=1)")U(F(!((X(F("(i22.u106.Node5GiveAnswer22>=1)")))U(X(G("((i5.u103.Node22IsInserted>=1)&&(i23.u109....182
Formula 0 simplified : !("(i22.u106.Node5GiveAnswer22>=1)" U F!(XF"(i22.u106.Node5GiveAnswer22>=1)" U XG"((i5.u103.Node22IsInserted>=1)&&(i23.u109.Node23Re...168
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15760057902893955248
[2022-05-15 20:23:09] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15760057902893955248
Running compilation step : cd /tmp/ltsmin15760057902893955248;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15760057902893955248;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15760057902893955248;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANConstruction-PT-030-LTLFireability-11 finished in 78756 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(p1))||p0))))'
Support contains 2 out of 1275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1275/1275 places, 2155/2155 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1264 transition count 2134
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1264 transition count 2134
Applied a total of 22 rules in 103 ms. Remains 1264 /1275 variables (removed 11) and now considering 2134/2155 (removed 21) transitions.
// Phase 1: matrix 2134 rows 1264 cols
[2022-05-15 20:23:12] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-15 20:23:13] [INFO ] Implicit Places using invariants in 821 ms returned []
// Phase 1: matrix 2134 rows 1264 cols
[2022-05-15 20:23:13] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-15 20:23:14] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:23:20] [INFO ] Implicit Places using invariants and state equation in 7388 ms returned []
Implicit Place search using SMT with State Equation took 8224 ms to find 0 implicit places.
// Phase 1: matrix 2134 rows 1264 cols
[2022-05-15 20:23:21] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-15 20:23:21] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1264/1275 places, 2134/2155 transitions.
Finished structural reductions, in 1 iterations. Remains : 1264/1275 places, 2134/2155 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s639 1) (GEQ s1066 1)), p1:(GEQ s1066 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 4 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-030-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-12 finished in 9411 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((F(p0) U X(p1))))))'
Support contains 2 out of 1275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1275/1275 places, 2155/2155 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1275 transition count 1954
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1074 transition count 1954
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 402 place count 1074 transition count 1924
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 462 place count 1044 transition count 1924
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 472 place count 1034 transition count 1904
Iterating global reduction 2 with 10 rules applied. Total rules applied 482 place count 1034 transition count 1904
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 9 rules applied. Total rules applied 491 place count 1034 transition count 1895
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 500 place count 1025 transition count 1895
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 562 place count 994 transition count 1864
Applied a total of 562 rules in 221 ms. Remains 994 /1275 variables (removed 281) and now considering 1864/2155 (removed 291) transitions.
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:23:22] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-15 20:23:22] [INFO ] Implicit Places using invariants in 502 ms returned []
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:23:22] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 20:23:23] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:23:29] [INFO ] Implicit Places using invariants and state equation in 6366 ms returned []
Implicit Place search using SMT with State Equation took 6888 ms to find 0 implicit places.
[2022-05-15 20:23:29] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:23:29] [INFO ] Computed 31 place invariants in 37 ms
[2022-05-15 20:23:30] [INFO ] Dead Transitions using invariants and state equation in 855 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 994/1275 places, 1864/2155 transitions.
Finished structural reductions, in 1 iterations. Remains : 994/1275 places, 1864/2155 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s639 1), p1:(GEQ s705 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 18231 reset in 759 ms.
Product exploration explored 100000 steps with 18115 reset in 738 ms.
Computed a total of 31 stabilizing places and 60 stable transitions
Computed a total of 31 stabilizing places and 60 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 258 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Finished random walk after 6636 steps, including 32 resets, run visited all 4 properties in 94 ms. (steps per millisecond=70 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 259 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:23:32] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-15 20:23:34] [INFO ] [Real]Absence check using 31 positive place invariants in 43 ms returned sat
[2022-05-15 20:23:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:36] [INFO ] [Real]Absence check using state equation in 2478 ms returned sat
[2022-05-15 20:23:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:23:38] [INFO ] [Nat]Absence check using 31 positive place invariants in 242 ms returned sat
[2022-05-15 20:23:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:40] [INFO ] [Nat]Absence check using state equation in 1532 ms returned sat
[2022-05-15 20:23:40] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:23:40] [INFO ] [Nat]Added 1770 Read/Feed constraints in 571 ms returned sat
[2022-05-15 20:23:41] [INFO ] Computed and/alt/rep : 1744/6268/1744 causal constraints (skipped 90 transitions) in 139 ms.
[2022-05-15 20:23:42] [INFO ] Added : 63 causal constraints over 13 iterations in 1696 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 994 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 994/994 places, 1864/1864 transitions.
Applied a total of 0 rules in 63 ms. Remains 994 /994 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:23:42] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-15 20:23:43] [INFO ] Implicit Places using invariants in 535 ms returned []
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:23:43] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-15 20:23:43] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:23:49] [INFO ] Implicit Places using invariants and state equation in 6382 ms returned []
Implicit Place search using SMT with State Equation took 6943 ms to find 0 implicit places.
[2022-05-15 20:23:49] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:23:49] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-15 20:23:50] [INFO ] Dead Transitions using invariants and state equation in 802 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 994/994 places, 1864/1864 transitions.
Computed a total of 31 stabilizing places and 60 stable transitions
Computed a total of 31 stabilizing places and 60 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 243 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Finished random walk after 3819 steps, including 18 resets, run visited all 4 properties in 27 ms. (steps per millisecond=141 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 276 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:23:51] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-15 20:23:53] [INFO ] [Real]Absence check using 31 positive place invariants in 38 ms returned sat
[2022-05-15 20:23:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:55] [INFO ] [Real]Absence check using state equation in 2379 ms returned sat
[2022-05-15 20:23:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:23:57] [INFO ] [Nat]Absence check using 31 positive place invariants in 246 ms returned sat
[2022-05-15 20:23:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:23:58] [INFO ] [Nat]Absence check using state equation in 1548 ms returned sat
[2022-05-15 20:23:58] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:23:59] [INFO ] [Nat]Added 1770 Read/Feed constraints in 547 ms returned sat
[2022-05-15 20:23:59] [INFO ] Computed and/alt/rep : 1744/6268/1744 causal constraints (skipped 90 transitions) in 119 ms.
[2022-05-15 20:24:00] [INFO ] Added : 63 causal constraints over 13 iterations in 1501 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Product exploration explored 100000 steps with 18239 reset in 670 ms.
Product exploration explored 100000 steps with 18172 reset in 677 ms.
Built C files in :
/tmp/ltsmin13444992390065936387
[2022-05-15 20:24:02] [INFO ] Too many transitions (1864) to apply POR reductions. Disabling POR matrices.
[2022-05-15 20:24:02] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13444992390065936387
Running compilation step : cd /tmp/ltsmin13444992390065936387;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13444992390065936387;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13444992390065936387;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 994 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 994/994 places, 1864/1864 transitions.
Applied a total of 0 rules in 59 ms. Remains 994 /994 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:24:05] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 20:24:06] [INFO ] Implicit Places using invariants in 597 ms returned []
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:24:06] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-15 20:24:06] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:24:12] [INFO ] Implicit Places using invariants and state equation in 6355 ms returned []
Implicit Place search using SMT with State Equation took 6972 ms to find 0 implicit places.
[2022-05-15 20:24:12] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:24:12] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-15 20:24:13] [INFO ] Dead Transitions using invariants and state equation in 687 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 994/994 places, 1864/1864 transitions.
Built C files in :
/tmp/ltsmin13851260673642631929
[2022-05-15 20:24:13] [INFO ] Too many transitions (1864) to apply POR reductions. Disabling POR matrices.
[2022-05-15 20:24:13] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13851260673642631929
Running compilation step : cd /tmp/ltsmin13851260673642631929;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13851260673642631929;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13851260673642631929;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 20:24:16] [INFO ] Flatten gal took : 113 ms
[2022-05-15 20:24:16] [INFO ] Flatten gal took : 105 ms
[2022-05-15 20:24:16] [INFO ] Time to serialize gal into /tmp/LTL6500548157019460773.gal : 6 ms
[2022-05-15 20:24:16] [INFO ] Time to serialize properties into /tmp/LTL10366972452382158353.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6500548157019460773.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10366972452382158353.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6500548...267
Read 1 LTL properties
Checking formula 0 : !((G(F(G((F("(Node17GiveAnswer24>=1)"))U(X("(Node20GiveAnswer1>=1)")))))))
Formula 0 simplified : !GFG(F"(Node17GiveAnswer24>=1)" U X"(Node20GiveAnswer1>=1)")
Detected timeout of ITS tools.
[2022-05-15 20:24:31] [INFO ] Flatten gal took : 42 ms
[2022-05-15 20:24:31] [INFO ] Applying decomposition
[2022-05-15 20:24:31] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph524420342895517563.txt' '-o' '/tmp/graph524420342895517563.bin' '-w' '/tmp/graph524420342895517563.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph524420342895517563.bin' '-l' '-1' '-v' '-w' '/tmp/graph524420342895517563.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:24:32] [INFO ] Decomposing Gal with order
[2022-05-15 20:24:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:24:32] [INFO ] Removed a total of 1771 redundant transitions.
[2022-05-15 20:24:32] [INFO ] Flatten gal took : 219 ms
[2022-05-15 20:24:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 1688 labels/synchronizations in 73 ms.
[2022-05-15 20:24:32] [INFO ] Time to serialize gal into /tmp/LTL10851871986894003056.gal : 10 ms
[2022-05-15 20:24:32] [INFO ] Time to serialize properties into /tmp/LTL15005197320609138052.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10851871986894003056.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15005197320609138052.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1085187...247
Read 1 LTL properties
Checking formula 0 : !((G(F(G((F("(u24.Node17GiveAnswer24>=1)"))U(X("(u2.Node20GiveAnswer1>=1)")))))))
Formula 0 simplified : !GFG(F"(u24.Node17GiveAnswer24>=1)" U X"(u2.Node20GiveAnswer1>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6997300694399192639
[2022-05-15 20:24:47] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6997300694399192639
Running compilation step : cd /tmp/ltsmin6997300694399192639;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6997300694399192639;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6997300694399192639;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANConstruction-PT-030-LTLFireability-13 finished in 88531 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(X((F(F(p0))&&p1))))))'
Support contains 2 out of 1275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1275/1275 places, 2155/2155 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1264 transition count 2134
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1264 transition count 2134
Applied a total of 22 rules in 109 ms. Remains 1264 /1275 variables (removed 11) and now considering 2134/2155 (removed 21) transitions.
// Phase 1: matrix 2134 rows 1264 cols
[2022-05-15 20:24:50] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-15 20:24:51] [INFO ] Implicit Places using invariants in 609 ms returned []
// Phase 1: matrix 2134 rows 1264 cols
[2022-05-15 20:24:51] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-15 20:24:51] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:24:58] [INFO ] Implicit Places using invariants and state equation in 7616 ms returned []
Implicit Place search using SMT with State Equation took 8228 ms to find 0 implicit places.
// Phase 1: matrix 2134 rows 1264 cols
[2022-05-15 20:24:58] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-15 20:24:59] [INFO ] Dead Transitions using invariants and state equation in 866 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1264/1275 places, 2134/2155 transitions.
Finished structural reductions, in 1 iterations. Remains : 1264/1275 places, 2134/2155 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LT s735 1), p0:(GEQ s681 1)], 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][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 580 steps with 0 reset in 5 ms.
FORMULA CANConstruction-PT-030-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-14 finished in 9483 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G(p0)))))'
Support contains 2 out of 1275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1275/1275 places, 2155/2155 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1275 transition count 1955
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1075 transition count 1955
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 400 place count 1075 transition count 1925
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 460 place count 1045 transition count 1925
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 472 place count 1033 transition count 1901
Iterating global reduction 2 with 12 rules applied. Total rules applied 484 place count 1033 transition count 1901
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 495 place count 1033 transition count 1890
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 506 place count 1022 transition count 1890
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 562 place count 994 transition count 1862
Applied a total of 562 rules in 137 ms. Remains 994 /1275 variables (removed 281) and now considering 1862/2155 (removed 293) transitions.
// Phase 1: matrix 1862 rows 994 cols
[2022-05-15 20:25:00] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-15 20:25:00] [INFO ] Implicit Places using invariants in 524 ms returned []
// Phase 1: matrix 1862 rows 994 cols
[2022-05-15 20:25:00] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-15 20:25:01] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:25:07] [INFO ] Implicit Places using invariants and state equation in 6726 ms returned []
Implicit Place search using SMT with State Equation took 7252 ms to find 0 implicit places.
[2022-05-15 20:25:07] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 1862 rows 994 cols
[2022-05-15 20:25:07] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-15 20:25:08] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 994/1275 places, 1862/2155 transitions.
Finished structural reductions, in 1 iterations. Remains : 994/1275 places, 1862/2155 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s86 1))], 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 213 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-030-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-LTLFireability-15 finished in 8198 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0 U (G(p0)||(p0&&G(p1)))))))'
Found a CL insensitive property : CANConstruction-PT-030-LTLFireability-07
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1275 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1275/1275 places, 2155/2155 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1275 transition count 1954
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1074 transition count 1954
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 402 place count 1074 transition count 1924
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 462 place count 1044 transition count 1924
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 472 place count 1034 transition count 1904
Iterating global reduction 2 with 10 rules applied. Total rules applied 482 place count 1034 transition count 1904
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 9 rules applied. Total rules applied 491 place count 1034 transition count 1895
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 500 place count 1025 transition count 1895
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 562 place count 994 transition count 1864
Applied a total of 562 rules in 139 ms. Remains 994 /1275 variables (removed 281) and now considering 1864/2155 (removed 291) transitions.
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:25:08] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-15 20:25:09] [INFO ] Implicit Places using invariants in 604 ms returned []
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:25:09] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-15 20:25:09] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:25:15] [INFO ] Implicit Places using invariants and state equation in 6548 ms returned []
Implicit Place search using SMT with State Equation took 7155 ms to find 0 implicit places.
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:25:15] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-15 20:25:16] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 994/1275 places, 1864/2155 transitions.
Finished structural reductions, in 1 iterations. Remains : 994/1275 places, 1864/2155 transitions.
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(LT s520 1), p0:(LT s856 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 486 reset in 541 ms.
Product exploration explored 100000 steps with 485 reset in 625 ms.
Computed a total of 31 stabilizing places and 60 stable transitions
Computed a total of 31 stabilizing places and 60 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 282 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:25:18] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-15 20:25:18] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2022-05-15 20:25:18] [INFO ] After 447ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 20:25:18] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:25:19] [INFO ] After 190ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:25:19] [INFO ] After 813ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:25:19] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2022-05-15 20:25:19] [INFO ] After 480ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:25:19] [INFO ] After 229ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:25:20] [INFO ] After 336ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2022-05-15 20:25:20] [INFO ] After 1038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 994 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 994/994 places, 1864/1864 transitions.
Applied a total of 0 rules in 40 ms. Remains 994 /994 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 994/994 places, 1864/1864 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 273070 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 273070 steps, saw 52956 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:25:23] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-15 20:25:23] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2022-05-15 20:25:23] [INFO ] After 433ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 20:25:23] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:25:23] [INFO ] After 163ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:25:23] [INFO ] After 765ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:25:24] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2022-05-15 20:25:24] [INFO ] After 485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:25:24] [INFO ] After 230ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:25:24] [INFO ] After 331ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2022-05-15 20:25:25] [INFO ] After 1050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 994 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 994/994 places, 1864/1864 transitions.
Applied a total of 0 rules in 39 ms. Remains 994 /994 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 994/994 places, 1864/1864 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 994/994 places, 1864/1864 transitions.
Applied a total of 0 rules in 37 ms. Remains 994 /994 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:25:25] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-15 20:25:25] [INFO ] Implicit Places using invariants in 536 ms returned []
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:25:25] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-15 20:25:26] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:25:32] [INFO ] Implicit Places using invariants and state equation in 6985 ms returned []
Implicit Place search using SMT with State Equation took 7521 ms to find 0 implicit places.
[2022-05-15 20:25:32] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:25:32] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-15 20:25:33] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 994/994 places, 1864/1864 transitions.
Graph (trivial) has 1798 edges and 994 vertex of which 928 / 994 are part of one of the 30 SCC in 3 ms
Free SCC test removed 898 places
Drop transitions removed 1766 transitions
Reduce isomorphic transitions removed 1766 transitions.
Graph (complete) has 191 edges and 96 vertex of which 8 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.0 ms
Discarding 88 places :
Also discarding 84 output transitions
Drop transitions removed 84 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 8 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 6 place count 8 transition count 8
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 6 transition count 8
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 6 transition count 8
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 4 transition count 6
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 4 transition count 6
Applied a total of 16 rules in 14 ms. Remains 4 /994 variables (removed 990) and now considering 6/1864 (removed 1858) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 6 rows 4 cols
[2022-05-15 20:25:33] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 20:25:33] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 20:25:33] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-15 20:25:33] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2022-05-15 20:25:33] [INFO ] Flatten gal took : 1 ms
[2022-05-15 20:25:33] [INFO ] Flatten gal took : 0 ms
[2022-05-15 20:25:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11760157687627285486.gal : 0 ms
[2022-05-15 20:25:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5343595985883188621.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms15738723882581650776;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11760157687627285486.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5343595985883188621.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality5343595985883188621.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,9,0.012275,3748,2,7,6,30,7,0,24,20,0
Total reachable state count : 9

Verifying 1 reachability properties.
Reachability property apf3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf3,1,0.012448,3748,2,5,6,30,7,0,27,20,0
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 382 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 994 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 994/994 places, 1864/1864 transitions.
Applied a total of 0 rules in 28 ms. Remains 994 /994 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:25:34] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-15 20:25:34] [INFO ] Implicit Places using invariants in 545 ms returned []
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:25:34] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-15 20:25:35] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:25:41] [INFO ] Implicit Places using invariants and state equation in 6541 ms returned []
Implicit Place search using SMT with State Equation took 7114 ms to find 0 implicit places.
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:25:41] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-15 20:25:41] [INFO ] Dead Transitions using invariants and state equation in 674 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 994/994 places, 1864/1864 transitions.
Computed a total of 31 stabilizing places and 60 stable transitions
Computed a total of 31 stabilizing places and 60 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 298 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:25:42] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-15 20:25:42] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-15 20:25:43] [INFO ] After 413ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 20:25:43] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:25:43] [INFO ] After 168ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:25:43] [INFO ] After 831ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:25:43] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-15 20:25:43] [INFO ] After 427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:25:44] [INFO ] After 195ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:25:44] [INFO ] After 281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2022-05-15 20:25:44] [INFO ] After 915ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 994 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 994/994 places, 1864/1864 transitions.
Applied a total of 0 rules in 49 ms. Remains 994 /994 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 994/994 places, 1864/1864 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 275736 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 275736 steps, saw 52992 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:25:47] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-15 20:25:47] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2022-05-15 20:25:47] [INFO ] After 412ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 20:25:47] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:25:48] [INFO ] After 166ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:25:48] [INFO ] After 747ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 20:25:48] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-15 20:25:48] [INFO ] After 405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 20:25:48] [INFO ] After 196ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 20:25:48] [INFO ] After 284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2022-05-15 20:25:49] [INFO ] After 923ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 994 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 994/994 places, 1864/1864 transitions.
Applied a total of 0 rules in 47 ms. Remains 994 /994 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 994/994 places, 1864/1864 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 994/994 places, 1864/1864 transitions.
Applied a total of 0 rules in 37 ms. Remains 994 /994 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:25:49] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-15 20:25:49] [INFO ] Implicit Places using invariants in 523 ms returned []
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:25:49] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-15 20:25:50] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:25:56] [INFO ] Implicit Places using invariants and state equation in 6585 ms returned []
Implicit Place search using SMT with State Equation took 7115 ms to find 0 implicit places.
[2022-05-15 20:25:56] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:25:56] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-15 20:25:56] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 994/994 places, 1864/1864 transitions.
Graph (trivial) has 1798 edges and 994 vertex of which 928 / 994 are part of one of the 30 SCC in 2 ms
Free SCC test removed 898 places
Drop transitions removed 1766 transitions
Reduce isomorphic transitions removed 1766 transitions.
Graph (complete) has 191 edges and 96 vertex of which 8 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.0 ms
Discarding 88 places :
Also discarding 84 output transitions
Drop transitions removed 84 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 8 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 6 place count 8 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 6 transition count 8
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 6 transition count 8
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 4 transition count 6
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 4 transition count 6
Applied a total of 16 rules in 12 ms. Remains 4 /994 variables (removed 990) and now considering 6/1864 (removed 1858) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 6 rows 4 cols
[2022-05-15 20:25:56] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 20:25:56] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 20:25:56] [INFO ] After 9ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-15 20:25:56] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2022-05-15 20:25:56] [INFO ] Flatten gal took : 0 ms
[2022-05-15 20:25:56] [INFO ] Flatten gal took : 0 ms
[2022-05-15 20:25:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14138131717173078416.gal : 1 ms
[2022-05-15 20:25:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9686750937028419611.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4248410696146615011;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14138131717173078416.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9686750937028419611.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality9686750937028419611.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,9,0.003641,3920,2,7,6,30,7,0,24,20,0
Total reachable state count : 9

Verifying 1 reachability properties.
Reachability property apf3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf3,1,0.003827,3920,2,5,6,30,7,0,27,20,0
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 1288 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 488 reset in 618 ms.
Product exploration explored 100000 steps with 485 reset in 552 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 994 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 994/994 places, 1864/1864 transitions.
Applied a total of 0 rules in 50 ms. Remains 994 /994 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
[2022-05-15 20:26:00] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:26:00] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-15 20:26:00] [INFO ] Dead Transitions using invariants and state equation in 789 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 994/994 places, 1864/1864 transitions.
Product exploration explored 100000 steps with 489 reset in 637 ms.
Product exploration explored 100000 steps with 489 reset in 649 ms.
Built C files in :
/tmp/ltsmin4776722638604393692
[2022-05-15 20:26:02] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4776722638604393692
Running compilation step : cd /tmp/ltsmin4776722638604393692;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4776722638604393692;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4776722638604393692;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 994 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 994/994 places, 1864/1864 transitions.
Applied a total of 0 rules in 21 ms. Remains 994 /994 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:26:05] [INFO ] Computed 31 place invariants in 19 ms
[2022-05-15 20:26:06] [INFO ] Implicit Places using invariants in 1035 ms returned []
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:26:06] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-15 20:26:06] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:26:13] [INFO ] Implicit Places using invariants and state equation in 6779 ms returned []
Implicit Place search using SMT with State Equation took 7817 ms to find 0 implicit places.
// Phase 1: matrix 1864 rows 994 cols
[2022-05-15 20:26:13] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-15 20:26:13] [INFO ] Dead Transitions using invariants and state equation in 675 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 994/994 places, 1864/1864 transitions.
Built C files in :
/tmp/ltsmin13782384351874708244
[2022-05-15 20:26:13] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13782384351874708244
Running compilation step : cd /tmp/ltsmin13782384351874708244;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13782384351874708244;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13782384351874708244;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 20:26:16] [INFO ] Flatten gal took : 44 ms
[2022-05-15 20:26:16] [INFO ] Flatten gal took : 44 ms
[2022-05-15 20:26:16] [INFO ] Time to serialize gal into /tmp/LTL10560173847842082916.gal : 8 ms
[2022-05-15 20:26:16] [INFO ] Time to serialize properties into /tmp/LTL13738980748365151909.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10560173847842082916.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13738980748365151909.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1056017...268
Read 1 LTL properties
Checking formula 0 : !((X(F(("(Node25GiveAnswer7<1)")U((G("(Node25GiveAnswer7<1)"))||(("(Node25GiveAnswer7<1)")&&(G("(Node13GiveAnswer21<1)"))))))))
Formula 0 simplified : !XF("(Node25GiveAnswer7<1)" U (G"(Node25GiveAnswer7<1)" | ("(Node25GiveAnswer7<1)" & G"(Node13GiveAnswer21<1)")))
Detected timeout of ITS tools.
[2022-05-15 20:26:32] [INFO ] Flatten gal took : 47 ms
[2022-05-15 20:26:32] [INFO ] Applying decomposition
[2022-05-15 20:26:32] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15949795221113318303.txt' '-o' '/tmp/graph15949795221113318303.bin' '-w' '/tmp/graph15949795221113318303.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15949795221113318303.bin' '-l' '-1' '-v' '-w' '/tmp/graph15949795221113318303.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:26:32] [INFO ] Decomposing Gal with order
[2022-05-15 20:26:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:26:32] [INFO ] Removed a total of 1771 redundant transitions.
[2022-05-15 20:26:32] [INFO ] Flatten gal took : 147 ms
[2022-05-15 20:26:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 1688 labels/synchronizations in 39 ms.
[2022-05-15 20:26:32] [INFO ] Time to serialize gal into /tmp/LTL12042416424801538492.gal : 9 ms
[2022-05-15 20:26:32] [INFO ] Time to serialize properties into /tmp/LTL3635148324415501897.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12042416424801538492.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3635148324415501897.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1204241...246
Read 1 LTL properties
Checking formula 0 : !((X(F(("(u8.Node25GiveAnswer7<1)")U((G("(u8.Node25GiveAnswer7<1)"))||(("(u8.Node25GiveAnswer7<1)")&&(G("(u19.Node13GiveAnswer21<1)"))...161
Formula 0 simplified : !XF("(u8.Node25GiveAnswer7<1)" U (G"(u8.Node25GiveAnswer7<1)" | ("(u8.Node25GiveAnswer7<1)" & G"(u19.Node13GiveAnswer21<1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14042862676334914348
[2022-05-15 20:26:47] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14042862676334914348
Running compilation step : cd /tmp/ltsmin14042862676334914348;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14042862676334914348;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14042862676334914348;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANConstruction-PT-030-LTLFireability-07 finished in 102393 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U F(!(X(F(p0)) U X(G(p1))))))'
Found a CL insensitive property : CANConstruction-PT-030-LTLFireability-11
Stuttering acceptance computed with spot in 264 ms :[p1, p1, p1, (AND p0 p1)]
Support contains 3 out of 1275 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1275/1275 places, 2155/2155 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1275 transition count 1955
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1075 transition count 1955
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 400 place count 1075 transition count 1925
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 460 place count 1045 transition count 1925
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 471 place count 1034 transition count 1903
Iterating global reduction 2 with 11 rules applied. Total rules applied 482 place count 1034 transition count 1903
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 10 rules applied. Total rules applied 492 place count 1034 transition count 1893
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 502 place count 1024 transition count 1893
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 560 place count 995 transition count 1864
Applied a total of 560 rules in 139 ms. Remains 995 /1275 variables (removed 280) and now considering 1864/2155 (removed 291) transitions.
// Phase 1: matrix 1864 rows 995 cols
[2022-05-15 20:26:51] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-15 20:26:51] [INFO ] Implicit Places using invariants in 551 ms returned []
// Phase 1: matrix 1864 rows 995 cols
[2022-05-15 20:26:51] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-15 20:26:52] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:26:57] [INFO ] Implicit Places using invariants and state equation in 6239 ms returned []
Implicit Place search using SMT with State Equation took 6795 ms to find 0 implicit places.
// Phase 1: matrix 1864 rows 995 cols
[2022-05-15 20:26:57] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-15 20:26:58] [INFO ] Dead Transitions using invariants and state equation in 643 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 995/1275 places, 1864/2155 transitions.
Finished structural reductions, in 1 iterations. Remains : 995/1275 places, 1864/2155 transitions.
Running random walk in product with property : CANConstruction-PT-030-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s291 1), p1:(AND (GEQ s70 1) (GEQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 481 reset in 544 ms.
Product exploration explored 100000 steps with 482 reset in 541 ms.
Computed a total of 31 stabilizing places and 60 stable transitions
Computed a total of 31 stabilizing places and 60 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 219 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 163 ms :[p1, p1, p1, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 47 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1864 rows 995 cols
[2022-05-15 20:27:00] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-15 20:27:00] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2022-05-15 20:27:00] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 7 factoid took 286 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 145 ms :[p1, p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 142 ms :[p1, p1, p1, (AND p0 p1)]
Support contains 3 out of 995 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 995/995 places, 1864/1864 transitions.
Applied a total of 0 rules in 28 ms. Remains 995 /995 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
// Phase 1: matrix 1864 rows 995 cols
[2022-05-15 20:27:00] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-15 20:27:01] [INFO ] Implicit Places using invariants in 550 ms returned []
// Phase 1: matrix 1864 rows 995 cols
[2022-05-15 20:27:01] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-15 20:27:02] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:27:07] [INFO ] Implicit Places using invariants and state equation in 6433 ms returned []
Implicit Place search using SMT with State Equation took 6984 ms to find 0 implicit places.
// Phase 1: matrix 1864 rows 995 cols
[2022-05-15 20:27:07] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-15 20:27:08] [INFO ] Dead Transitions using invariants and state equation in 707 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 995/995 places, 1864/1864 transitions.
Computed a total of 31 stabilizing places and 60 stable transitions
Computed a total of 31 stabilizing places and 60 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 257 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 133 ms :[p1, p1, p1, (AND p0 p1)]
Finished random walk after 2706 steps, including 12 resets, run visited all 2 properties in 20 ms. (steps per millisecond=135 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 124 ms :[p1, p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 136 ms :[p1, p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 140 ms :[p1, p1, p1, (AND p0 p1)]
Product exploration explored 100000 steps with 483 reset in 551 ms.
Product exploration explored 100000 steps with 481 reset in 579 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 153 ms :[p1, p1, p1, (AND p0 p1)]
Support contains 3 out of 995 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 995/995 places, 1864/1864 transitions.
Applied a total of 0 rules in 41 ms. Remains 995 /995 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
[2022-05-15 20:27:11] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 1864 rows 995 cols
[2022-05-15 20:27:11] [INFO ] Computed 31 place invariants in 18 ms
[2022-05-15 20:27:11] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 995/995 places, 1864/1864 transitions.
Product exploration explored 100000 steps with 480 reset in 591 ms.
Product exploration explored 100000 steps with 480 reset in 612 ms.
Built C files in :
/tmp/ltsmin7335017443626611479
[2022-05-15 20:27:13] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7335017443626611479
Running compilation step : cd /tmp/ltsmin7335017443626611479;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7335017443626611479;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7335017443626611479;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 995 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 995/995 places, 1864/1864 transitions.
Applied a total of 0 rules in 21 ms. Remains 995 /995 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
// Phase 1: matrix 1864 rows 995 cols
[2022-05-15 20:27:16] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-15 20:27:16] [INFO ] Implicit Places using invariants in 526 ms returned []
// Phase 1: matrix 1864 rows 995 cols
[2022-05-15 20:27:16] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-15 20:27:17] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-05-15 20:27:22] [INFO ] Implicit Places using invariants and state equation in 6274 ms returned []
Implicit Place search using SMT with State Equation took 6802 ms to find 0 implicit places.
// Phase 1: matrix 1864 rows 995 cols
[2022-05-15 20:27:22] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-15 20:27:23] [INFO ] Dead Transitions using invariants and state equation in 720 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 995/995 places, 1864/1864 transitions.
Built C files in :
/tmp/ltsmin18381286471193853305
[2022-05-15 20:27:23] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18381286471193853305
Running compilation step : cd /tmp/ltsmin18381286471193853305;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18381286471193853305;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18381286471193853305;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 20:27:26] [INFO ] Flatten gal took : 46 ms
[2022-05-15 20:27:26] [INFO ] Flatten gal took : 48 ms
[2022-05-15 20:27:26] [INFO ] Time to serialize gal into /tmp/LTL16887333719454361443.gal : 8 ms
[2022-05-15 20:27:26] [INFO ] Time to serialize properties into /tmp/LTL5693209393204983093.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16887333719454361443.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5693209393204983093.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1688733...267
Read 1 LTL properties
Checking formula 0 : !((("(Node5GiveAnswer22>=1)")U(F(!((X(F("(Node5GiveAnswer22>=1)")))U(X(G("((Node22IsInserted>=1)&&(Node23Request>=1))"))))))))
Formula 0 simplified : !("(Node5GiveAnswer22>=1)" U F!(XF"(Node5GiveAnswer22>=1)" U XG"((Node22IsInserted>=1)&&(Node23Request>=1))"))
Detected timeout of ITS tools.
[2022-05-15 20:27:41] [INFO ] Flatten gal took : 43 ms
[2022-05-15 20:27:41] [INFO ] Applying decomposition
[2022-05-15 20:27:42] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17686863212445668814.txt' '-o' '/tmp/graph17686863212445668814.bin' '-w' '/tmp/graph17686863212445668814.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17686863212445668814.bin' '-l' '-1' '-v' '-w' '/tmp/graph17686863212445668814.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:27:42] [INFO ] Decomposing Gal with order
[2022-05-15 20:27:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:27:42] [INFO ] Removed a total of 1766 redundant transitions.
[2022-05-15 20:27:42] [INFO ] Flatten gal took : 158 ms
[2022-05-15 20:27:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 1734 labels/synchronizations in 40 ms.
[2022-05-15 20:27:42] [INFO ] Time to serialize gal into /tmp/LTL6762627949789588613.gal : 8 ms
[2022-05-15 20:27:42] [INFO ] Time to serialize properties into /tmp/LTL14251570233397693115.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6762627949789588613.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14251570233397693115.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6762627...246
Read 1 LTL properties
Checking formula 0 : !((("(i19.u31.Node5GiveAnswer22>=1)")U(F(!((X(F("(i19.u31.Node5GiveAnswer22>=1)")))U(X(G("((u10.Node22IsInserted>=1)&&(u21.Node23Reque...171
Formula 0 simplified : !("(i19.u31.Node5GiveAnswer22>=1)" U F!(XF"(i19.u31.Node5GiveAnswer22>=1)" U XG"((u10.Node22IsInserted>=1)&&(u21.Node23Request>=1))"...157
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3776493021765446385
[2022-05-15 20:27:57] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3776493021765446385
Running compilation step : cd /tmp/ltsmin3776493021765446385;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3776493021765446385;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3776493021765446385;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANConstruction-PT-030-LTLFireability-11 finished in 69779 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((F(p0) U X(p1))))))'
[2022-05-15 20:28:00] [INFO ] Flatten gal took : 49 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15034411862730312025
[2022-05-15 20:28:00] [INFO ] Too many transitions (2155) to apply POR reductions. Disabling POR matrices.
[2022-05-15 20:28:00] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15034411862730312025
Running compilation step : cd /tmp/ltsmin15034411862730312025;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 20:28:00] [INFO ] Applying decomposition
[2022-05-15 20:28:00] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph990969334984919.txt' '-o' '/tmp/graph990969334984919.bin' '-w' '/tmp/graph990969334984919.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph990969334984919.bin' '-l' '-1' '-v' '-w' '/tmp/graph990969334984919.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:28:01] [INFO ] Decomposing Gal with order
[2022-05-15 20:28:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:28:01] [INFO ] Removed a total of 1822 redundant transitions.
[2022-05-15 20:28:01] [INFO ] Flatten gal took : 146 ms
[2022-05-15 20:28:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 3486 labels/synchronizations in 62 ms.
[2022-05-15 20:28:01] [INFO ] Time to serialize gal into /tmp/LTLFireability1965226654972386722.gal : 11 ms
[2022-05-15 20:28:01] [INFO ] Time to serialize properties into /tmp/LTLFireability8207700872158572071.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1965226654972386722.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8207700872158572071.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 3 LTL properties
Checking formula 0 : !((X(F(("(i7.u28.Node25GiveAnswer7<1)")U((G("(i7.u28.Node25GiveAnswer7<1)"))||(("(i7.u28.Node25GiveAnswer7<1)")&&(G("(i21.u86.Node13Gi...177
Formula 0 simplified : !XF("(i7.u28.Node25GiveAnswer7<1)" U (G"(i7.u28.Node25GiveAnswer7<1)" | ("(i7.u28.Node25GiveAnswer7<1)" & G"(i21.u86.Node13GiveAnswe...165
Compilation finished in 4154 ms.
Running link step : cd /tmp/ltsmin15034411862730312025;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin15034411862730312025;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true) U ([]((LTLAPp0==true))||((LTLAPp0==true)&&[]((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin15034411862730312025;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true) U ([]((LTLAPp0==true))||((LTLAPp0==true)&&[]((LTLAPp1==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15034411862730312025;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp2==true) U <>(!(X(<>((LTLAPp2==true))) U X([]((LTLAPp3==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 20:50:57] [INFO ] Flatten gal took : 174 ms
[2022-05-15 20:50:57] [INFO ] Time to serialize gal into /tmp/LTLFireability3807742768216903732.gal : 25 ms
[2022-05-15 20:50:57] [INFO ] Time to serialize properties into /tmp/LTLFireability3463871674892065999.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3807742768216903732.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3463871674892065999.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...288
Read 3 LTL properties
Checking formula 0 : !((X(F(("(Node25GiveAnswer7<1)")U((G("(Node25GiveAnswer7<1)"))||(("(Node25GiveAnswer7<1)")&&(G("(Node13GiveAnswer21<1)"))))))))
Formula 0 simplified : !XF("(Node25GiveAnswer7<1)" U (G"(Node25GiveAnswer7<1)" | ("(Node25GiveAnswer7<1)" & G"(Node13GiveAnswer21<1)")))
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin15034411862730312025;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp2==true) U <>(!(X(<>((LTLAPp2==true))) U X([]((LTLAPp3==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15034411862730312025;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([]((<>((LTLAPp4==true)) U X((LTLAPp5==true))))))' '--buchi-type=spotba'
LTSmin run took 529 ms.
FORMULA CANConstruction-PT-030-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin15034411862730312025;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true) U ([]((LTLAPp0==true))||((LTLAPp0==true)&&[]((LTLAPp1==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 21:13:54] [INFO ] Flatten gal took : 176 ms
[2022-05-15 21:13:54] [INFO ] Input system was already deterministic with 2155 transitions.
[2022-05-15 21:13:54] [INFO ] Transformed 1275 places.
[2022-05-15 21:13:54] [INFO ] Transformed 2155 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 21:13:55] [INFO ] Time to serialize gal into /tmp/LTLFireability6591188662843442203.gal : 5 ms
[2022-05-15 21:13:55] [INFO ] Time to serialize properties into /tmp/LTLFireability13520683717857355742.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6591188662843442203.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13520683717857355742.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(("(Node25GiveAnswer7<1)")U((G("(Node25GiveAnswer7<1)"))||(("(Node25GiveAnswer7<1)")&&(G("(Node13GiveAnswer21<1)"))))))))
Formula 0 simplified : !XF("(Node25GiveAnswer7<1)" U (G"(Node25GiveAnswer7<1)" | ("(Node25GiveAnswer7<1)" & G"(Node13GiveAnswer21<1)")))

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-030"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CANConstruction-PT-030, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918600508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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