About the Execution of ITS-Tools for ShieldPPPs-PT-050A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1617.323 | 251304.00 | 316869.00 | 2859.20 | FFTFFFFFFTTTFFFF | normal |
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.r222-tall-165286025300499.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 ShieldPPPs-PT-050A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025300499
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 6.3K Apr 30 03:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 30 03:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 30 03:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 30 03:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 447K May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-050A-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1653005698822
Running Version 202205111006
[2022-05-20 00:15:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 00:15:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 00:15:00] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2022-05-20 00:15:00] [INFO ] Transformed 1553 places.
[2022-05-20 00:15:00] [INFO ] Transformed 1303 transitions.
[2022-05-20 00:15:00] [INFO ] Found NUPN structural information;
[2022-05-20 00:15:00] [INFO ] Parsed PT model containing 1553 places and 1303 transitions in 284 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPs-PT-050A-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 321 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:15:00] [INFO ] Computed 551 place invariants in 33 ms
[2022-05-20 00:15:01] [INFO ] Implicit Places using invariants in 1137 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:15:01] [INFO ] Computed 551 place invariants in 9 ms
[2022-05-20 00:15:03] [INFO ] Implicit Places using invariants and state equation in 1817 ms returned []
Implicit Place search using SMT with State Equation took 2981 ms to find 0 implicit places.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:15:03] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:15:04] [INFO ] Dead Transitions using invariants and state equation in 827 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 transitions.
Support contains 25 out of 1553 places after structural reductions.
[2022-05-20 00:15:05] [INFO ] Flatten gal took : 533 ms
[2022-05-20 00:15:05] [INFO ] Flatten gal took : 116 ms
[2022-05-20 00:15:05] [INFO ] Input system was already deterministic with 1303 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:15:06] [INFO ] Computed 551 place invariants in 9 ms
[2022-05-20 00:15:06] [INFO ] [Real]Absence check using 551 positive place invariants in 84 ms returned sat
[2022-05-20 00:15:07] [INFO ] After 596ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2022-05-20 00:15:07] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 6 ms to minimize.
[2022-05-20 00:15:07] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 2 ms to minimize.
[2022-05-20 00:15:07] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 1 ms to minimize.
[2022-05-20 00:15:07] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2022-05-20 00:15:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 707 ms
[2022-05-20 00:15:08] [INFO ] After 1348ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-20 00:15:08] [INFO ] After 1722ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-20 00:15:08] [INFO ] [Nat]Absence check using 551 positive place invariants in 96 ms returned sat
[2022-05-20 00:15:09] [INFO ] After 543ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-20 00:15:09] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2022-05-20 00:15:09] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2022-05-20 00:15:09] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 1 ms to minimize.
[2022-05-20 00:15:09] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2022-05-20 00:15:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 599 ms
[2022-05-20 00:15:09] [INFO ] After 1192ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2022-05-20 00:15:09] [INFO ] After 1681ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 2 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Partial Free-agglomeration rule applied 446 times.
Drop transitions removed 446 transitions
Iterating global reduction 0 with 446 rules applied. Total rules applied 450 place count 1551 transition count 1301
Applied a total of 450 rules in 219 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1551/1553 places, 1301/1303 transitions.
Finished random walk after 827 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=48 )
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
FORMULA ShieldPPPs-PT-050A-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 38 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:15:10] [INFO ] Computed 551 place invariants in 10 ms
[2022-05-20 00:15:11] [INFO ] Implicit Places using invariants in 873 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:15:11] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 00:15:12] [INFO ] Implicit Places using invariants and state equation in 1699 ms returned []
Implicit Place search using SMT with State Equation took 2572 ms to find 0 implicit places.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:15:12] [INFO ] Computed 551 place invariants in 10 ms
[2022-05-20 00:15:13] [INFO ] Dead Transitions using invariants and state equation in 831 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s251 0) (EQ s1094 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ShieldPPPs-PT-050A-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLCardinality-00 finished in 3718 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 130 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:15:14] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 00:15:14] [INFO ] Implicit Places using invariants in 828 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:15:14] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:15:16] [INFO ] Implicit Places using invariants and state equation in 1734 ms returned []
Implicit Place search using SMT with State Equation took 2572 ms to find 0 implicit places.
[2022-05-20 00:15:16] [INFO ] Redundant transitions in 104 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:15:16] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:15:17] [INFO ] Dead Transitions using invariants and state equation in 767 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/1553 places, 1301/1303 transitions.
Finished structural reductions, in 1 iterations. Remains : 1551/1553 places, 1301/1303 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLCardinality-01 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 (NEQ s27 0) (NEQ s1281 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 3225 steps with 0 reset in 47 ms.
FORMULA ShieldPPPs-PT-050A-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLCardinality-01 finished in 3720 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G(X(F(X(p0))))&&G(p1)&&p1))))'
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1551 transition count 1301
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1550 transition count 1300
Applied a total of 4 rules in 145 ms. Remains 1550 /1553 variables (removed 3) and now considering 1300/1303 (removed 3) transitions.
// Phase 1: matrix 1300 rows 1550 cols
[2022-05-20 00:15:17] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:15:18] [INFO ] Implicit Places using invariants in 817 ms returned []
// Phase 1: matrix 1300 rows 1550 cols
[2022-05-20 00:15:18] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:15:20] [INFO ] Implicit Places using invariants and state equation in 1701 ms returned []
Implicit Place search using SMT with State Equation took 2522 ms to find 0 implicit places.
[2022-05-20 00:15:20] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 1300 rows 1550 cols
[2022-05-20 00:15:20] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:15:21] [INFO ] Dead Transitions using invariants and state equation in 781 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1550/1553 places, 1300/1303 transitions.
Finished structural reductions, in 1 iterations. Remains : 1550/1553 places, 1300/1303 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s248 1), p0:(AND (EQ s930 0) (EQ s173 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 37 reset in 1018 ms.
Product exploration explored 100000 steps with 37 reset in 1187 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 253 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 2600 steps, including 0 resets, run visited all 3 properties in 75 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 320 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
// Phase 1: matrix 1300 rows 1550 cols
[2022-05-20 00:15:24] [INFO ] Computed 551 place invariants in 9 ms
[2022-05-20 00:15:25] [INFO ] [Real]Absence check using 551 positive place invariants in 481 ms returned sat
[2022-05-20 00:15:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:15:31] [INFO ] [Real]Absence check using state equation in 5617 ms returned sat
[2022-05-20 00:15:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 00:15:33] [INFO ] [Nat]Absence check using 551 positive place invariants in 336 ms returned sat
[2022-05-20 00:15:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 00:15:37] [INFO ] [Nat]Absence check using state equation in 4113 ms returned sat
[2022-05-20 00:15:37] [INFO ] Computed and/alt/rep : 1298/2493/1298 causal constraints (skipped 0 transitions) in 76 ms.
[2022-05-20 00:15:46] [INFO ] Added : 315 causal constraints over 63 iterations in 9419 ms. Result :unknown
Could not prove EG (NOT p1)
// Phase 1: matrix 1300 rows 1550 cols
[2022-05-20 00:15:46] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:15:48] [INFO ] [Real]Absence check using 551 positive place invariants in 476 ms returned sat
[2022-05-20 00:15:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:15:53] [INFO ] [Real]Absence check using state equation in 5626 ms returned sat
[2022-05-20 00:15:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 00:15:55] [INFO ] [Nat]Absence check using 551 positive place invariants in 356 ms returned sat
[2022-05-20 00:15:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 00:15:59] [INFO ] [Nat]Absence check using state equation in 3642 ms returned sat
[2022-05-20 00:15:59] [INFO ] Computed and/alt/rep : 1298/2493/1298 causal constraints (skipped 0 transitions) in 61 ms.
[2022-05-20 00:16:09] [INFO ] Deduced a trap composed of 2 places in 728 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 00:16:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 3 out of 1550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1550/1550 places, 1300/1300 transitions.
Applied a total of 0 rules in 65 ms. Remains 1550 /1550 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
// Phase 1: matrix 1300 rows 1550 cols
[2022-05-20 00:16:09] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:16:10] [INFO ] Implicit Places using invariants in 773 ms returned []
// Phase 1: matrix 1300 rows 1550 cols
[2022-05-20 00:16:10] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:16:12] [INFO ] Implicit Places using invariants and state equation in 1674 ms returned []
Implicit Place search using SMT with State Equation took 2447 ms to find 0 implicit places.
[2022-05-20 00:16:12] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 1300 rows 1550 cols
[2022-05-20 00:16:12] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 00:16:13] [INFO ] Dead Transitions using invariants and state equation in 760 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1550/1550 places, 1300/1300 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 223 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 2631 steps, including 0 resets, run visited all 3 properties in 49 ms. (steps per millisecond=53 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 921 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
// Phase 1: matrix 1300 rows 1550 cols
[2022-05-20 00:16:14] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:16:16] [INFO ] [Real]Absence check using 551 positive place invariants in 455 ms returned sat
[2022-05-20 00:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:16:21] [INFO ] [Real]Absence check using state equation in 5491 ms returned sat
[2022-05-20 00:16:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 00:16:23] [INFO ] [Nat]Absence check using 551 positive place invariants in 329 ms returned sat
[2022-05-20 00:16:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 00:16:27] [INFO ] [Nat]Absence check using state equation in 3956 ms returned sat
[2022-05-20 00:16:27] [INFO ] Computed and/alt/rep : 1298/2493/1298 causal constraints (skipped 0 transitions) in 71 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2022-05-20 00:16:37] [INFO ] Deduced a trap composed of 2 places in 802 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 00:16:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
// Phase 1: matrix 1300 rows 1550 cols
[2022-05-20 00:16:37] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:16:39] [INFO ] [Real]Absence check using 551 positive place invariants in 481 ms returned sat
[2022-05-20 00:16:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:16:45] [INFO ] [Real]Absence check using state equation in 5895 ms returned sat
[2022-05-20 00:16:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 00:16:46] [INFO ] [Nat]Absence check using 551 positive place invariants in 358 ms returned sat
[2022-05-20 00:16:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 00:16:50] [INFO ] [Nat]Absence check using state equation in 3787 ms returned sat
[2022-05-20 00:16:50] [INFO ] Computed and/alt/rep : 1298/2493/1298 causal constraints (skipped 0 transitions) in 59 ms.
[2022-05-20 00:17:00] [INFO ] Deduced a trap composed of 2 places in 795 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 00:17:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 37 reset in 928 ms.
Product exploration explored 100000 steps with 37 reset in 1151 ms.
Built C files in :
/tmp/ltsmin15466908896044319861
[2022-05-20 00:17:03] [INFO ] Computing symmetric may disable matrix : 1300 transitions.
[2022-05-20 00:17:03] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:17:03] [INFO ] Computing symmetric may enable matrix : 1300 transitions.
[2022-05-20 00:17:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:17:03] [INFO ] Computing Do-Not-Accords matrix : 1300 transitions.
[2022-05-20 00:17:03] [INFO ] Computation of Completed DNA matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:17:03] [INFO ] Built C files in 331ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15466908896044319861
Running compilation step : cd /tmp/ltsmin15466908896044319861;'/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/ltsmin15466908896044319861;'/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/ltsmin15466908896044319861;'/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 1550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1550/1550 places, 1300/1300 transitions.
Applied a total of 0 rules in 51 ms. Remains 1550 /1550 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
// Phase 1: matrix 1300 rows 1550 cols
[2022-05-20 00:17:06] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:17:07] [INFO ] Implicit Places using invariants in 776 ms returned []
// Phase 1: matrix 1300 rows 1550 cols
[2022-05-20 00:17:07] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:17:09] [INFO ] Implicit Places using invariants and state equation in 1809 ms returned []
Implicit Place search using SMT with State Equation took 2588 ms to find 0 implicit places.
[2022-05-20 00:17:09] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 1300 rows 1550 cols
[2022-05-20 00:17:09] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:17:09] [INFO ] Dead Transitions using invariants and state equation in 747 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1550/1550 places, 1300/1300 transitions.
Built C files in :
/tmp/ltsmin493084837684544688
[2022-05-20 00:17:10] [INFO ] Computing symmetric may disable matrix : 1300 transitions.
[2022-05-20 00:17:10] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:17:10] [INFO ] Computing symmetric may enable matrix : 1300 transitions.
[2022-05-20 00:17:10] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:17:10] [INFO ] Computing Do-Not-Accords matrix : 1300 transitions.
[2022-05-20 00:17:10] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 00:17:10] [INFO ] Built C files in 214ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin493084837684544688
Running compilation step : cd /tmp/ltsmin493084837684544688;'/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/ltsmin493084837684544688;'/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/ltsmin493084837684544688;'/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-20 00:17:13] [INFO ] Flatten gal took : 59 ms
[2022-05-20 00:17:13] [INFO ] Flatten gal took : 54 ms
[2022-05-20 00:17:13] [INFO ] Time to serialize gal into /tmp/LTL2042724185743339432.gal : 9 ms
[2022-05-20 00:17:13] [INFO ] Time to serialize properties into /tmp/LTL6550505434646678252.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/LTL2042724185743339432.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6550505434646678252.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/LTL2042724...266
Read 1 LTL properties
Checking formula 0 : !((F(X(((G(X(F(X("((p931==0)&&(p174==1))")))))&&(G("(p249==1)")))&&("(p249==1)")))))
Formula 0 simplified : !FX("(p249==1)" & GXFX"((p931==0)&&(p174==1))" & G"(p249==1)")
Detected timeout of ITS tools.
[2022-05-20 00:17:28] [INFO ] Flatten gal took : 51 ms
[2022-05-20 00:17:28] [INFO ] Applying decomposition
[2022-05-20 00:17:28] [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/graph17960046890552582592.txt' '-o' '/tmp/graph17960046890552582592.bin' '-w' '/tmp/graph17960046890552582592.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17960046890552582592.bin' '-l' '-1' '-v' '-w' '/tmp/graph17960046890552582592.weights' '-q' '0' '-e' '0.001'
[2022-05-20 00:17:28] [INFO ] Decomposing Gal with order
[2022-05-20 00:17:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 00:17:29] [INFO ] Removed a total of 300 redundant transitions.
[2022-05-20 00:17:29] [INFO ] Flatten gal took : 139 ms
[2022-05-20 00:17:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 21 ms.
[2022-05-20 00:17:29] [INFO ] Time to serialize gal into /tmp/LTL9733600044769230776.gal : 18 ms
[2022-05-20 00:17:29] [INFO ] Time to serialize properties into /tmp/LTL17102500439971233980.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/LTL9733600044769230776.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17102500439971233980.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/LTL9733600...246
Read 1 LTL properties
Checking formula 0 : !((F(X(((G(X(F(X("((i29.i3.u330.p931==0)&&(i5.i3.u62.p174==1))")))))&&(G("(i7.i3.u88.p249==1)")))&&("(i7.i3.u88.p249==1)")))))
Formula 0 simplified : !FX("(i7.i3.u88.p249==1)" & GXFX"((i29.i3.u330.p931==0)&&(i5.i3.u62.p174==1))" & G"(i7.i3.u88.p249==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9541344805561394586
[2022-05-20 00:17:44] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9541344805561394586
Running compilation step : cd /tmp/ltsmin9541344805561394586;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2493 ms.
Running link step : cd /tmp/ltsmin9541344805561394586;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin9541344805561394586;'/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(([](X(<>(X((LTLAPp0==true)))))&&[]((LTLAPp1==true))&&(LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 3234 ms.
FORMULA ShieldPPPs-PT-050A-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-050A-LTLCardinality-03 finished in 152472 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 43 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:17:50] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:17:50] [INFO ] Implicit Places using invariants in 826 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:17:50] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:17:52] [INFO ] Implicit Places using invariants and state equation in 1729 ms returned []
Implicit Place search using SMT with State Equation took 2562 ms to find 0 implicit places.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:17:52] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:17:53] [INFO ] Dead Transitions using invariants and state equation in 821 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s1446 0) (EQ s1014 1) (AND (EQ s707 0) (EQ s1382 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 96 steps with 0 reset in 2 ms.
FORMULA ShieldPPPs-PT-050A-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLCardinality-04 finished in 3538 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U F((!X(p2)&&p1)))))'
Support contains 4 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 40 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:17:53] [INFO ] Computed 551 place invariants in 10 ms
[2022-05-20 00:17:54] [INFO ] Implicit Places using invariants in 827 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:17:54] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:17:56] [INFO ] Implicit Places using invariants and state equation in 1749 ms returned []
Implicit Place search using SMT with State Equation took 2579 ms to find 0 implicit places.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:17:56] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:17:57] [INFO ] Dead Transitions using invariants and state equation in 763 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 291 ms :[true, (NOT p2), (AND (NOT p2) p1), (AND p1 (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(OR (EQ s901 0) (EQ s1542 1)), p1:(AND (EQ s1544 1) (NEQ s1013 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-050A-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLCardinality-06 finished in 3707 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G(F(!(F(p0) U p1))))))'
Support contains 4 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 95 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:17:57] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:17:58] [INFO ] Implicit Places using invariants in 795 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:17:58] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:17:59] [INFO ] Implicit Places using invariants and state equation in 1738 ms returned []
Implicit Place search using SMT with State Equation took 2534 ms to find 0 implicit places.
[2022-05-20 00:18:00] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 1301 rows 1551 cols
[2022-05-20 00:18:00] [INFO ] Computed 551 place invariants in 4 ms
[2022-05-20 00:18:00] [INFO ] Dead Transitions using invariants and state equation in 755 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/1553 places, 1301/1303 transitions.
Finished structural reductions, in 1 iterations. Remains : 1551/1553 places, 1301/1303 transitions.
Stuttering acceptance computed with spot in 100 ms :[p1, p1, (AND p0 p1)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s383 0) (EQ s986 1)), p1:(OR (EQ s1413 0) (EQ s1136 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3354 steps with 0 reset in 36 ms.
FORMULA ShieldPPPs-PT-050A-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLCardinality-08 finished in 3573 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1 U (X(!p0)||!X(G(!X(!p2)))))))'
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 38 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:18:00] [INFO ] Computed 551 place invariants in 11 ms
[2022-05-20 00:18:01] [INFO ] Implicit Places using invariants in 791 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:18:01] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:18:03] [INFO ] Implicit Places using invariants and state equation in 1756 ms returned []
Implicit Place search using SMT with State Equation took 2549 ms to find 0 implicit places.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:18:03] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:18:04] [INFO ] Dead Transitions using invariants and state equation in 764 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 272 ms :[(AND p0 p2), p2, (AND p2 p0), (AND p2 p0), (AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 p2)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=3 dest: 1}], [{ cond=p0, acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(AND p1 p0), acceptance={} source=5 dest: 7}], [{ cond=(AND p0 p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0} source=7 dest: 3}, { cond=(AND p1 p0 p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s659 1), p0:(OR (EQ s466 0) (EQ s82 1)), p2:(OR (EQ s1106 0) (EQ s1017 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 58 reset in 945 ms.
Product exploration explored 100000 steps with 60 reset in 1087 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X p0), (X (X p2)), (X (X (AND (NOT p1) p0 p2))), (X (X (AND p0 p2))), (X (X (NOT (AND p1 p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 391 ms. Reduced automaton from 8 states, 12 edges and 3 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 94 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Finished random walk after 2204 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=95 )
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X p0), (X (X p2)), (X (X (AND (NOT p1) p0 p2))), (X (X (AND p0 p2))), (X (X (NOT (AND p1 p0 p2))))]
False Knowledge obtained : [(F (NOT (AND p0 p2)))]
Knowledge based reduction with 8 factoid took 307 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 112 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 124 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:18:07] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:18:09] [INFO ] [Real]Absence check using 551 positive place invariants in 522 ms returned sat
[2022-05-20 00:18:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:18:14] [INFO ] [Real]Absence check using state equation in 5093 ms returned sat
[2022-05-20 00:18:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 00:18:16] [INFO ] [Nat]Absence check using 551 positive place invariants in 361 ms returned sat
[2022-05-20 00:18:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 00:18:20] [INFO ] [Nat]Absence check using state equation in 4521 ms returned sat
[2022-05-20 00:18:20] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2022-05-20 00:18:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2022-05-20 00:18:20] [INFO ] Computed and/alt/rep : 1302/3603/1302 causal constraints (skipped 0 transitions) in 60 ms.
[2022-05-20 00:18:29] [INFO ] Added : 360 causal constraints over 72 iterations in 8791 ms. Result :unknown
Could not prove EG (AND p0 p2)
Support contains 4 out of 1553 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 37 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:18:29] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:18:30] [INFO ] Implicit Places using invariants in 771 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:18:30] [INFO ] Computed 551 place invariants in 2 ms
[2022-05-20 00:18:32] [INFO ] Implicit Places using invariants and state equation in 1681 ms returned []
Implicit Place search using SMT with State Equation took 2454 ms to find 0 implicit places.
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:18:32] [INFO ] Computed 551 place invariants in 3 ms
[2022-05-20 00:18:32] [INFO ] Dead Transitions using invariants and state equation in 754 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p2), (X (X (AND p0 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Finished random walk after 2252 steps, including 0 resets, run visited all 1 properties in 29 ms. (steps per millisecond=77 )
Knowledge obtained : [(AND p0 p2), (X (X (AND p0 p2)))]
False Knowledge obtained : [(F (NOT (AND p0 p2)))]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 103 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:18:33] [INFO ] Computed 551 place invariants in 6 ms
[2022-05-20 00:18:35] [INFO ] [Real]Absence check using 551 positive place invariants in 537 ms returned sat
[2022-05-20 00:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 00:18:40] [INFO ] [Real]Absence check using state equation in 5131 ms returned sat
[2022-05-20 00:18:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 00:18:41] [INFO ] [Nat]Absence check using 551 positive place invariants in 374 ms returned sat
[2022-05-20 00:18:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 00:18:46] [INFO ] [Nat]Absence check using state equation in 4651 ms returned sat
[2022-05-20 00:18:46] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2022-05-20 00:18:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-05-20 00:18:46] [INFO ] Computed and/alt/rep : 1302/3603/1302 causal constraints (skipped 0 transitions) in 63 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 00:18:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND p0 p2)
Could not prove EG (AND p0 p2)
Stuttering acceptance computed with spot in 112 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Product exploration explored 100000 steps with 66 reset in 881 ms.
Product exploration explored 100000 steps with 60 reset in 1079 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 123 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2)]
Support contains 4 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1553 transition count 1303
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 2 rules in 271 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2022-05-20 00:18:57] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2022-05-20 00:18:57] [INFO ] Computed 551 place invariants in 5 ms
[2022-05-20 00:18:58] [INFO ] Dead Transitions using invariants and state equation in 815 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1553/1553 places, 1303/1303 transitions.
Finished structural reductions, in 1 iterations. Remains : 1553/1553 places, 1303/1303 transitions.
Product exploration explored 100000 steps with 60 reset in 1011 ms.
Product exploration explored 100000 steps with 69 reset in 1175 ms.
Built C files in :
/tmp/ltsmin10738066775497803595
[2022-05-20 00:19:01] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10738066775497803595
Running compilation step : cd /tmp/ltsmin10738066775497803595;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2509 ms.
Running link step : cd /tmp/ltsmin10738066775497803595;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin10738066775497803595;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8627469984329933036.hoa' '--buchi-type=spotba'
LTSmin run took 6491 ms.
FORMULA ShieldPPPs-PT-050A-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-050A-LTLCardinality-13 finished in 69126 ms.
All properties solved by simple procedures.
Total runtime 250035 ms.
BK_STOP 1653005950126
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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 LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-050A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-050A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025300499"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-050A.tgz
mv ShieldPPPs-PT-050A execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;