Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446800284.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-PT-S04J04T10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446800284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.7M
-rw-r--r-- 1 mcc users 27K Apr 11 17:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 11 17:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 111K Apr 11 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 530K Apr 11 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 17:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 11 17:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 263K Apr 11 17:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 17:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.7K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S04J04T10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716918140411

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J04T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 17:42:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 17:42:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:42:22] [INFO ] Load time of PNML (sax parser for PT used): 290 ms
[2024-05-28 17:42:22] [INFO ] Transformed 870 places.
[2024-05-28 17:42:22] [INFO ] Transformed 5034 transitions.
[2024-05-28 17:42:22] [INFO ] Parsed PT model containing 870 places and 5034 transitions and 34774 arcs in 457 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 275 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Applied a total of 4 rules in 116 ms. Remains 866 /870 variables (removed 4) and now considering 2324/2324 (removed 0) transitions.
Running 2320 sub problems to find dead transitions.
[2024-05-28 17:42:22] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
// Phase 1: matrix 2284 rows 866 cols
[2024-05-28 17:42:22] [INFO ] Computed 54 invariants in 208 ms
[2024-05-28 17:42:22] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
SMT process timed out in 32699ms, After SMT, problems are : Problem set: 0 solved, 2320 unsolved
Search for dead transitions found 0 dead transitions in 32756ms
[2024-05-28 17:42:55] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-05-28 17:42:55] [INFO ] Invariant cache hit.
[2024-05-28 17:42:55] [INFO ] Implicit Places using invariants in 649 ms returned [166, 282, 366, 367, 402, 516, 539, 633]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 660 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 858/870 places, 2324/2324 transitions.
Applied a total of 0 rules in 28 ms. Remains 858 /858 variables (removed 0) and now considering 2324/2324 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33615 ms. Remains : 858/870 places, 2324/2324 transitions.
Support contains 275 out of 858 places after structural reductions.
[2024-05-28 17:42:56] [INFO ] Flatten gal took : 207 ms
[2024-05-28 17:42:56] [INFO ] Flatten gal took : 146 ms
[2024-05-28 17:42:56] [INFO ] Input system was already deterministic with 2324 transitions.
Support contains 264 out of 858 places (down from 275) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 26 to 25
RANDOM walk for 40000 steps (8 resets) in 1176 ms. (33 steps per ms) remains 1/25 properties
BEST_FIRST walk for 40004 steps (8 resets) in 311 ms. (128 steps per ms) remains 1/1 properties
[2024-05-28 17:42:57] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
// Phase 1: matrix 2284 rows 858 cols
[2024-05-28 17:42:57] [INFO ] Computed 46 invariants in 60 ms
[2024-05-28 17:42:57] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 174/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/188 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp23 is UNSAT
After SMT solving in domain Real declared 823/3142 variables, and 27 constraints, problems are : Problem set: 1 solved, 0 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 8/14 constraints, Generalized P Invariants (flows): 19/32 constraints, State Equation: 0/858 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 308ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 42 out of 858 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 858/858 places, 2324/2324 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 858 transition count 2234
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 768 transition count 2234
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 180 place count 768 transition count 2174
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 300 place count 708 transition count 2174
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 305 place count 703 transition count 2169
Iterating global reduction 2 with 5 rules applied. Total rules applied 310 place count 703 transition count 2169
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 510 place count 603 transition count 2069
Applied a total of 510 rules in 234 ms. Remains 603 /858 variables (removed 255) and now considering 2069/2324 (removed 255) transitions.
Running 2065 sub problems to find dead transitions.
[2024-05-28 17:42:58] [INFO ] Flow matrix only has 2029 transitions (discarded 40 similar events)
// Phase 1: matrix 2029 rows 603 cols
[2024-05-28 17:42:58] [INFO ] Computed 46 invariants in 81 ms
[2024-05-28 17:42:58] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2065 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 2065 unsolved
[2024-05-28 17:43:29] [INFO ] Deduced a trap composed of 246 places in 374 ms of which 31 ms to minimize.
[2024-05-28 17:43:30] [INFO ] Deduced a trap composed of 23 places in 300 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 599/2632 variables, and 43 constraints, problems are : Problem set: 0 solved, 2065 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 27/31 constraints, State Equation: 0/603 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2065/2065 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2065 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 2065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/599 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2065 unsolved
[2024-05-28 17:43:37] [INFO ] Deduced a trap composed of 50 places in 169 ms of which 2 ms to minimize.
[2024-05-28 17:43:37] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 2 ms to minimize.
[2024-05-28 17:43:38] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 1 ms to minimize.
[2024-05-28 17:43:38] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 1 ms to minimize.
[2024-05-28 17:43:38] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
[2024-05-28 17:43:38] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 2 ms to minimize.
[2024-05-28 17:43:38] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-05-28 17:43:39] [INFO ] Deduced a trap composed of 43 places in 403 ms of which 4 ms to minimize.
[2024-05-28 17:43:39] [INFO ] Deduced a trap composed of 89 places in 443 ms of which 4 ms to minimize.
[2024-05-28 17:43:40] [INFO ] Deduced a trap composed of 91 places in 415 ms of which 5 ms to minimize.
[2024-05-28 17:43:40] [INFO ] Deduced a trap composed of 93 places in 388 ms of which 4 ms to minimize.
[2024-05-28 17:43:40] [INFO ] Deduced a trap composed of 89 places in 353 ms of which 4 ms to minimize.
[2024-05-28 17:43:41] [INFO ] Deduced a trap composed of 89 places in 376 ms of which 4 ms to minimize.
[2024-05-28 17:43:41] [INFO ] Deduced a trap composed of 87 places in 420 ms of which 4 ms to minimize.
[2024-05-28 17:43:43] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:43:43] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 2 ms to minimize.
[2024-05-28 17:43:47] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 599/2632 variables, and 60 constraints, problems are : Problem set: 0 solved, 2065 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 27/31 constraints, State Equation: 0/603 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2065 constraints, Known Traps: 19/19 constraints]
After SMT, in 53433ms problems are : Problem set: 0 solved, 2065 unsolved
Search for dead transitions found 0 dead transitions in 53463ms
[2024-05-28 17:43:51] [INFO ] Flow matrix only has 2029 transitions (discarded 40 similar events)
[2024-05-28 17:43:51] [INFO ] Invariant cache hit.
[2024-05-28 17:43:52] [INFO ] Implicit Places using invariants in 948 ms returned [498, 595]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 965 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 601/858 places, 2069/2324 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 600 transition count 2068
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 600 transition count 2068
Applied a total of 2 rules in 126 ms. Remains 600 /601 variables (removed 1) and now considering 2068/2069 (removed 1) transitions.
[2024-05-28 17:43:52] [INFO ] Flow matrix only has 2028 transitions (discarded 40 similar events)
// Phase 1: matrix 2028 rows 600 cols
[2024-05-28 17:43:52] [INFO ] Computed 44 invariants in 47 ms
[2024-05-28 17:43:53] [INFO ] Implicit Places using invariants in 861 ms returned []
[2024-05-28 17:43:53] [INFO ] Flow matrix only has 2028 transitions (discarded 40 similar events)
[2024-05-28 17:43:53] [INFO ] Invariant cache hit.
[2024-05-28 17:43:55] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-28 17:44:18] [INFO ] Implicit Places using invariants and state equation in 25246 ms returned []
Implicit Place search using SMT with State Equation took 26113 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 600/858 places, 2068/2324 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 80911 ms. Remains : 600/858 places, 2068/2324 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T10-LTLFireability-00
Product exploration explored 100000 steps with 2 reset in 1328 ms.
Stack based approach found an accepted trace after 4452 steps with 0 reset with depth 4453 and stack size 4453 in 54 ms.
FORMULA PolyORBLF-PT-S04J04T10-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S04J04T10-LTLFireability-00 finished in 82600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(((!p0&&X(F(p1)))||G(F(p1)))))||(G(!p2)&&F(((!p0&&X(F(p1)))||G(F(p1))))))))'
Support contains 68 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 2324/2324 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 848 transition count 2314
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 848 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 838 transition count 2304
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 838 transition count 2304
Applied a total of 40 rules in 88 ms. Remains 838 /858 variables (removed 20) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-05-28 17:44:20] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 838 cols
[2024-05-28 17:44:20] [INFO ] Computed 46 invariants in 82 ms
[2024-05-28 17:44:20] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/834 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 33750ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 33787ms
[2024-05-28 17:44:54] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-28 17:44:54] [INFO ] Invariant cache hit.
[2024-05-28 17:44:55] [INFO ] Implicit Places using invariants in 917 ms returned [704, 828]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 924 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 836/858 places, 2304/2324 transitions.
Applied a total of 0 rules in 15 ms. Remains 836 /836 variables (removed 0) and now considering 2304/2304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34822 ms. Remains : 836/858 places, 2304/2324 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S04J04T10-LTLFireability-01
Product exploration explored 100000 steps with 1122 reset in 1221 ms.
Product exploration explored 100000 steps with 1050 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 p2) p1 (NOT p0)), (X (NOT p2)), (X (OR (NOT p1) (NOT p0))), (X (OR (NOT p1) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (OR (NOT p1) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 169 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1)]
RANDOM walk for 40000 steps (9 resets) in 1409 ms. (28 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 994 ms. (40 steps per ms) remains 1/1 properties
[2024-05-28 17:44:59] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 836 cols
[2024-05-28 17:44:59] [INFO ] Computed 44 invariants in 45 ms
[2024-05-28 17:44:59] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 190/248 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 112/360 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 456/816 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:44:59] [INFO ] Deduced a trap composed of 74 places in 265 ms of which 4 ms to minimize.
[2024-05-28 17:45:00] [INFO ] Deduced a trap composed of 74 places in 194 ms of which 3 ms to minimize.
[2024-05-28 17:45:00] [INFO ] Deduced a trap composed of 74 places in 178 ms of which 3 ms to minimize.
[2024-05-28 17:45:00] [INFO ] Deduced a trap composed of 75 places in 131 ms of which 2 ms to minimize.
[2024-05-28 17:45:00] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 1 ms to minimize.
[2024-05-28 17:45:00] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 1 ms to minimize.
[2024-05-28 17:45:00] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/816 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/816 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/819 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/819 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 834/3100 variables, and 50 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1704 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/836 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1945ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (OR (NOT p1) (NOT p0))), (X (OR (NOT p1) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (OR (NOT p1) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F (NOT p1)), (F p0), (F p2), (F (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 16 factoid took 295 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1)]
Support contains 68 out of 836 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 836/836 places, 2304/2304 transitions.
Applied a total of 0 rules in 18 ms. Remains 836 /836 variables (removed 0) and now considering 2304/2304 (removed 0) transitions.
Running 2300 sub problems to find dead transitions.
[2024-05-28 17:45:01] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-28 17:45:01] [INFO ] Invariant cache hit.
[2024-05-28 17:45:01] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 2.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 0.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 1.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 0.0)
(s232 1.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 1.0)
(s255 0.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 0.0)
(s260 1.0)
(s261 4.0)
(s262 1.0)
(s263 1.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 0.0)
(s281 1.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 0.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 0.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 1.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 timeout
0.0)
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 33073ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 33096ms
[2024-05-28 17:45:34] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-28 17:45:34] [INFO ] Invariant cache hit.
[2024-05-28 17:45:35] [INFO ] Implicit Places using invariants in 752 ms returned []
[2024-05-28 17:45:35] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-28 17:45:35] [INFO ] Invariant cache hit.
[2024-05-28 17:45:36] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-28 17:46:04] [INFO ] Implicit Places using invariants and state equation in 29260 ms returned []
Implicit Place search using SMT with State Equation took 30019 ms to find 0 implicit places.
Running 2300 sub problems to find dead transitions.
[2024-05-28 17:46:04] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-28 17:46:04] [INFO ] Invariant cache hit.
[2024-05-28 17:46:04] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 26/39 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
[2024-05-28 17:46:42] [INFO ] Deduced a trap composed of 59 places in 374 ms of which 2 ms to minimize.
[2024-05-28 17:46:43] [INFO ] Deduced a trap composed of 162 places in 555 ms of which 4 ms to minimize.
[2024-05-28 17:46:44] [INFO ] Deduced a trap composed of 217 places in 335 ms of which 4 ms to minimize.
[2024-05-28 17:46:48] [INFO ] Deduced a trap composed of 427 places in 430 ms of which 4 ms to minimize.
[2024-05-28 17:46:48] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 2 ms to minimize.
SMT process timed out in 43684ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 43711ms
Finished structural reductions in LTL mode , in 1 iterations and 106855 ms. Remains : 836/836 places, 2304/2304 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 p2) (NOT p0) p1), (X (NOT p2)), (X (OR (NOT p0) (NOT p1))), (X (OR (AND (NOT p0) (NOT p2)) (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 185 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1)]
RANDOM walk for 788 steps (0 resets) in 42 ms. (18 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (OR (NOT p0) (NOT p1))), (X (OR (AND (NOT p0) (NOT p2)) (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p2))), (F (NOT p1)), (F p2), (F (NOT (OR (AND (NOT p0) (NOT p2)) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 451 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1)]
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1)]
Product exploration explored 100000 steps with 1147 reset in 1130 ms.
Product exploration explored 100000 steps with 1178 reset in 1162 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1)]
Support contains 68 out of 836 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 836/836 places, 2304/2304 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 836 transition count 2304
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 60 place count 836 transition count 2304
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 836 transition count 2304
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 100 place count 816 transition count 2284
Deduced a syphon composed of 60 places in 2 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 120 place count 816 transition count 2284
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 210 places in 1 ms
Iterating global reduction 1 with 150 rules applied. Total rules applied 270 place count 816 transition count 2284
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 306 place count 780 transition count 2248
Deduced a syphon composed of 180 places in 2 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 342 place count 780 transition count 2248
Deduced a syphon composed of 180 places in 2 ms
Applied a total of 342 rules in 348 ms. Remains 780 /836 variables (removed 56) and now considering 2248/2304 (removed 56) transitions.
Running 2244 sub problems to find dead transitions.
[2024-05-28 17:46:53] [INFO ] Flow matrix only has 2208 transitions (discarded 40 similar events)
// Phase 1: matrix 2208 rows 780 cols
[2024-05-28 17:46:53] [INFO ] Computed 44 invariants in 86 ms
[2024-05-28 17:46:53] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/776 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/776 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 776/2988 variables, and 40 constraints, problems are : Problem set: 0 solved, 2244 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/780 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2244/2244 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/776 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/776 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2244 unsolved
[2024-05-28 17:47:35] [INFO ] Deduced a trap composed of 50 places in 347 ms of which 3 ms to minimize.
[2024-05-28 17:47:36] [INFO ] Deduced a trap composed of 23 places in 372 ms of which 5 ms to minimize.
[2024-05-28 17:47:36] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2024-05-28 17:47:36] [INFO ] Deduced a trap composed of 50 places in 559 ms of which 9 ms to minimize.
[2024-05-28 17:47:37] [INFO ] Deduced a trap composed of 386 places in 442 ms of which 4 ms to minimize.
[2024-05-28 17:47:37] [INFO ] Deduced a trap composed of 50 places in 412 ms of which 5 ms to minimize.
[2024-05-28 17:47:38] [INFO ] Deduced a trap composed of 197 places in 437 ms of which 4 ms to minimize.
[2024-05-28 17:47:38] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 0 ms to minimize.
[2024-05-28 17:47:38] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 2 ms to minimize.
[2024-05-28 17:47:38] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 0 ms to minimize.
[2024-05-28 17:47:39] [INFO ] Deduced a trap composed of 54 places in 385 ms of which 4 ms to minimize.
[2024-05-28 17:47:39] [INFO ] Deduced a trap composed of 34 places in 503 ms of which 6 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-28 17:47:39] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:47:39] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-05-28 17:47:40] [INFO ] Deduced a trap composed of 50 places in 558 ms of which 4 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-28 17:47:41] [INFO ] Deduced a trap composed of 87 places in 413 ms of which 4 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD37 is UNSAT
[2024-05-28 17:47:42] [INFO ] Deduced a trap composed of 236 places in 433 ms of which 4 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-28 17:47:44] [INFO ] Deduced a trap composed of 288 places in 658 ms of which 5 ms to minimize.
[2024-05-28 17:47:45] [INFO ] Deduced a trap composed of 272 places in 549 ms of which 4 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD108 is UNSAT
[2024-05-28 17:47:47] [INFO ] Deduced a trap composed of 248 places in 606 ms of which 6 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD195 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/776 variables, 20/60 constraints. Problems are: Problem set: 20 solved, 2224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 776/2988 variables, and 60 constraints, problems are : Problem set: 20 solved, 2224 unsolved in 20096 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/780 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2244 constraints, Known Traps: 20/20 constraints]
After SMT, in 55683ms problems are : Problem set: 20 solved, 2224 unsolved
Search for dead transitions found 20 dead transitions in 55708ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 20 transitions.
[2024-05-28 17:47:49] [INFO ] Redundant transitions in 177 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 780/836 places, 2228/2304 transitions.
Graph (complete) has 4450 edges and 780 vertex of which 760 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.8 ms
Discarding 20 places :
Also discarding 0 output transitions
Deduced a syphon composed of 160 places in 1 ms
Applied a total of 1 rules in 112 ms. Remains 760 /780 variables (removed 20) and now considering 2228/2228 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 760/836 places, 2228/2304 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56369 ms. Remains : 760/836 places, 2228/2304 transitions.
Built C files in :
/tmp/ltsmin12121065435199510194
[2024-05-28 17:47:49] [INFO ] Built C files in 136ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12121065435199510194
Running compilation step : cd /tmp/ltsmin12121065435199510194;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin12121065435199510194;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin12121065435199510194;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 68 out of 836 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 836/836 places, 2304/2304 transitions.
Applied a total of 0 rules in 25 ms. Remains 836 /836 variables (removed 0) and now considering 2304/2304 (removed 0) transitions.
Running 2300 sub problems to find dead transitions.
[2024-05-28 17:47:52] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 836 cols
[2024-05-28 17:47:52] [INFO ] Computed 44 invariants in 45 ms
[2024-05-28 17:47:52] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 34129ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 34161ms
[2024-05-28 17:48:26] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-28 17:48:26] [INFO ] Invariant cache hit.
[2024-05-28 17:48:27] [INFO ] Implicit Places using invariants in 608 ms returned []
[2024-05-28 17:48:27] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-28 17:48:27] [INFO ] Invariant cache hit.
[2024-05-28 17:48:28] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-28 17:48:55] [INFO ] Implicit Places using invariants and state equation in 27782 ms returned []
Implicit Place search using SMT with State Equation took 28408 ms to find 0 implicit places.
Running 2300 sub problems to find dead transitions.
[2024-05-28 17:48:55] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-28 17:48:55] [INFO ] Invariant cache hit.
[2024-05-28 17:48:55] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 26/39 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
[2024-05-28 17:49:30] [INFO ] Deduced a trap composed of 59 places in 308 ms of which 3 ms to minimize.
[2024-05-28 17:49:31] [INFO ] Deduced a trap composed of 162 places in 328 ms of which 4 ms to minimize.
[2024-05-28 17:49:31] [INFO ] Deduced a trap composed of 217 places in 458 ms of which 6 ms to minimize.
[2024-05-28 17:49:34] [INFO ] Deduced a trap composed of 427 places in 476 ms of which 5 ms to minimize.
[2024-05-28 17:49:35] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 11 ms to minimize.
[2024-05-28 17:49:35] [INFO ] Deduced a trap composed of 426 places in 448 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 832/3100 variables, and 45 constraints, problems are : Problem set: 0 solved, 2300 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 26/30 constraints, State Equation: 0/836 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2300/2300 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 26/39 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/832 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 832/3100 variables, and 45 constraints, problems are : Problem set: 0 solved, 2300 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 26/30 constraints, State Equation: 0/836 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2300 constraints, Known Traps: 6/6 constraints]
After SMT, in 73793ms problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 73834ms
Finished structural reductions in LTL mode , in 1 iterations and 136444 ms. Remains : 836/836 places, 2304/2304 transitions.
Built C files in :
/tmp/ltsmin14830404621942344308
[2024-05-28 17:50:08] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14830404621942344308
Running compilation step : cd /tmp/ltsmin14830404621942344308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin14830404621942344308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin14830404621942344308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 17:50:12] [INFO ] Flatten gal took : 154 ms
[2024-05-28 17:50:12] [INFO ] Flatten gal took : 168 ms
[2024-05-28 17:50:12] [INFO ] Time to serialize gal into /tmp/LTL13890958584299714821.gal : 65 ms
[2024-05-28 17:50:12] [INFO ] Time to serialize properties into /tmp/LTL7400975203212553879.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13890958584299714821.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18415704038748569373.hoa' '-atoms' '/tmp/LTL7400975203212553879.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7400975203212553879.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18415704038748569373.hoa
Detected timeout of ITS tools.
[2024-05-28 17:50:27] [INFO ] Flatten gal took : 118 ms
[2024-05-28 17:50:28] [INFO ] Flatten gal took : 132 ms
[2024-05-28 17:50:28] [INFO ] Time to serialize gal into /tmp/LTL17850504806801908023.gal : 49 ms
[2024-05-28 17:50:28] [INFO ] Time to serialize properties into /tmp/LTL16690001257182995468.ltl : 18 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17850504806801908023.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16690001257182995468.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G(F((G(F("(((((((((DisablePollingB_2_4<1)||(PollingAbort<1))||(BlockedTasks<1))&&(((DisablePollingB_3_2<1)||(PollingAbort<1))||(...13608
Formula 0 simplified : G(FG!"(((((((((DisablePollingB_2_4<1)||(PollingAbort<1))||(BlockedTasks<1))&&(((DisablePollingB_3_2<1)||(PollingAbort<1))||(BlockedT...10717
Detected timeout of ITS tools.
[2024-05-28 17:50:43] [INFO ] Flatten gal took : 78 ms
[2024-05-28 17:50:43] [INFO ] Applying decomposition
[2024-05-28 17:50:43] [INFO ] Flatten gal took : 142 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10833576346970791589.txt' '-o' '/tmp/graph10833576346970791589.bin' '-w' '/tmp/graph10833576346970791589.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10833576346970791589.bin' '-l' '-1' '-v' '-w' '/tmp/graph10833576346970791589.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:50:44] [INFO ] Decomposing Gal with order
[2024-05-28 17:50:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:50:44] [INFO ] Removed a total of 1643 redundant transitions.
[2024-05-28 17:50:45] [INFO ] Flatten gal took : 1013 ms
[2024-05-28 17:50:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 277 labels/synchronizations in 104 ms.
[2024-05-28 17:50:45] [INFO ] Time to serialize gal into /tmp/LTL4121497541799329276.gal : 85 ms
[2024-05-28 17:50:45] [INFO ] Time to serialize properties into /tmp/LTL7711263481032585757.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4121497541799329276.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7711263481032585757.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((G(F((G(F("(((((((((i2.u98.DisablePollingB_2_4<1)||(i11.i4.u106.PollingAbort<1))||(i11.i4.u106.BlockedTasks<1))&&(((i11.i4.u11.Di...20144
Formula 0 simplified : G(FG!"(((((((((i2.u98.DisablePollingB_2_4<1)||(i11.i4.u106.PollingAbort<1))||(i11.i4.u106.BlockedTasks<1))&&(((i11.i4.u11.DisablePol...15832
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S04J04T10-LTLFireability-01 finished in 400098 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 61 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 2324/2324 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 848 transition count 2314
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 848 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 838 transition count 2304
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 838 transition count 2304
Applied a total of 40 rules in 47 ms. Remains 838 /858 variables (removed 20) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-05-28 17:51:00] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 838 cols
[2024-05-28 17:51:00] [INFO ] Computed 46 invariants in 34 ms
[2024-05-28 17:51:00] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/834 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 34988ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 35008ms
[2024-05-28 17:51:35] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-05-28 17:51:35] [INFO ] Invariant cache hit.
[2024-05-28 17:51:36] [INFO ] Implicit Places using invariants in 742 ms returned [704, 828]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 770 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 836/858 places, 2304/2324 transitions.
Applied a total of 0 rules in 21 ms. Remains 836 /836 variables (removed 0) and now considering 2304/2304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35852 ms. Remains : 836/858 places, 2304/2324 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S04J04T10-LTLFireability-02
Product exploration explored 100000 steps with 1221 reset in 522 ms.
Product exploration explored 100000 steps with 1223 reset in 543 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 p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 154 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 317 steps (0 resets) in 7 ms. (39 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
[2024-05-28 17:51:38] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 836 cols
[2024-05-28 17:51:38] [INFO ] Computed 44 invariants in 49 ms
[2024-05-28 17:51:39] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-28 17:51:39] [INFO ] [Real]Absence check using 14 positive and 30 generalized place invariants in 55 ms returned sat
[2024-05-28 17:51:42] [INFO ] [Real]Absence check using state equation in 2530 ms returned sat
[2024-05-28 17:51:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:51:43] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-28 17:51:43] [INFO ] [Nat]Absence check using 14 positive and 30 generalized place invariants in 44 ms returned sat
[2024-05-28 17:51:48] [INFO ] [Nat]Absence check using state equation in 5549 ms returned sat
[2024-05-28 17:51:48] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-28 17:51:50] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 17:51:51] [INFO ] [Nat]Added 200 Read/Feed constraints in 3056 ms returned unknown
Could not prove EG (NOT p0)
Support contains 10 out of 836 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 836/836 places, 2304/2304 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 836 transition count 2254
Reduce places removed 50 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 60 rules applied. Total rules applied 110 place count 786 transition count 2244
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 120 place count 776 transition count 2244
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 120 place count 776 transition count 2144
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 320 place count 676 transition count 2144
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 500 place count 586 transition count 2054
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 506 place count 580 transition count 2048
Iterating global reduction 3 with 6 rules applied. Total rules applied 512 place count 580 transition count 2048
Applied a total of 512 rules in 292 ms. Remains 580 /836 variables (removed 256) and now considering 2048/2304 (removed 256) transitions.
Running 2044 sub problems to find dead transitions.
[2024-05-28 17:51:52] [INFO ] Flow matrix only has 2008 transitions (discarded 40 similar events)
// Phase 1: matrix 2008 rows 580 cols
[2024-05-28 17:51:52] [INFO ] Computed 44 invariants in 42 ms
[2024-05-28 17:51:52] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
[2024-05-28 17:52:20] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 2 ms to minimize.
[2024-05-28 17:52:20] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 7 ms to minimize.
[2024-05-28 17:52:20] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 1 ms to minimize.
[2024-05-28 17:52:20] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 0 ms to minimize.
[2024-05-28 17:52:20] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:52:20] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 0 ms to minimize.
[2024-05-28 17:52:20] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 0 ms to minimize.
[2024-05-28 17:52:20] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 0 ms to minimize.
[2024-05-28 17:52:20] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:52:20] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:52:22] [INFO ] Deduced a trap composed of 232 places in 319 ms of which 2 ms to minimize.
[2024-05-28 17:52:22] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 2 ms to minimize.
[2024-05-28 17:52:22] [INFO ] Deduced a trap composed of 216 places in 301 ms of which 3 ms to minimize.
[2024-05-28 17:52:23] [INFO ] Deduced a trap composed of 23 places in 310 ms of which 2 ms to minimize.
[2024-05-28 17:52:24] [INFO ] Deduced a trap composed of 39 places in 241 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/2588 variables, and 55 constraints, problems are : Problem set: 0 solved, 2044 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/580 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2044/2044 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2044 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/576 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
[2024-05-28 17:52:46] [INFO ] Deduced a trap composed of 253 places in 368 ms of which 3 ms to minimize.
[2024-05-28 17:52:46] [INFO ] Deduced a trap composed of 279 places in 353 ms of which 2 ms to minimize.
SMT process timed out in 54607ms, After SMT, problems are : Problem set: 0 solved, 2044 unsolved
Search for dead transitions found 0 dead transitions in 54659ms
[2024-05-28 17:52:46] [INFO ] Flow matrix only has 2008 transitions (discarded 40 similar events)
[2024-05-28 17:52:46] [INFO ] Invariant cache hit.
[2024-05-28 17:52:47] [INFO ] Implicit Places using invariants in 544 ms returned []
[2024-05-28 17:52:47] [INFO ] Flow matrix only has 2008 transitions (discarded 40 similar events)
[2024-05-28 17:52:47] [INFO ] Invariant cache hit.
[2024-05-28 17:52:49] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-28 17:53:08] [INFO ] Implicit Places using invariants and state equation in 21587 ms returned []
Implicit Place search using SMT with State Equation took 22156 ms to find 0 implicit places.
[2024-05-28 17:53:09] [INFO ] Redundant transitions in 169 ms returned []
Running 2044 sub problems to find dead transitions.
[2024-05-28 17:53:09] [INFO ] Flow matrix only has 2008 transitions (discarded 40 similar events)
[2024-05-28 17:53:09] [INFO ] Invariant cache hit.
[2024-05-28 17:53:09] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
[2024-05-28 17:53:37] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
[2024-05-28 17:53:37] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 0 ms to minimize.
[2024-05-28 17:53:37] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 0 ms to minimize.
[2024-05-28 17:53:37] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-05-28 17:53:37] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 0 ms to minimize.
[2024-05-28 17:53:37] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:53:37] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 1 ms to minimize.
[2024-05-28 17:53:38] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 1 ms to minimize.
[2024-05-28 17:53:38] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 2 ms to minimize.
[2024-05-28 17:53:38] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 1 ms to minimize.
[2024-05-28 17:53:39] [INFO ] Deduced a trap composed of 232 places in 386 ms of which 3 ms to minimize.
[2024-05-28 17:53:40] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 2 ms to minimize.
[2024-05-28 17:53:40] [INFO ] Deduced a trap composed of 216 places in 315 ms of which 3 ms to minimize.
[2024-05-28 17:53:41] [INFO ] Deduced a trap composed of 38 places in 232 ms of which 2 ms to minimize.
[2024-05-28 17:53:43] [INFO ] Deduced a trap composed of 262 places in 343 ms of which 3 ms to minimize.
[2024-05-28 17:53:48] [INFO ] Deduced a trap composed of 113 places in 336 ms of which 3 ms to minimize.
[2024-05-28 17:53:49] [INFO ] Deduced a trap composed of 310 places in 324 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/2588 variables, and 57 constraints, problems are : Problem set: 0 solved, 2044 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/580 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2044/2044 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2044 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/576 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
[2024-05-28 17:54:14] [INFO ] Deduced a trap composed of 252 places in 451 ms of which 3 ms to minimize.
[2024-05-28 17:54:15] [INFO ] Deduced a trap composed of 23 places in 357 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/2588 variables, and 59 constraints, problems are : Problem set: 0 solved, 2044 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/580 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2044 constraints, Known Traps: 19/19 constraints]
After SMT, in 74627ms problems are : Problem set: 0 solved, 2044 unsolved
Search for dead transitions found 0 dead transitions in 74650ms
Starting structural reductions in SI_LTL mode, iteration 1 : 580/836 places, 2048/2304 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 151943 ms. Remains : 580/836 places, 2048/2304 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 251 steps (0 resets) in 6 ms. (35 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
[2024-05-28 17:54:24] [INFO ] Flow matrix only has 2008 transitions (discarded 40 similar events)
[2024-05-28 17:54:24] [INFO ] Invariant cache hit.
[2024-05-28 17:54:24] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-28 17:54:25] [INFO ] [Real]Absence check using 11 positive and 33 generalized place invariants in 182 ms returned sat
[2024-05-28 17:54:27] [INFO ] [Real]Absence check using state equation in 2769 ms returned sat
[2024-05-28 17:54:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:54:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 17:54:29] [INFO ] [Nat]Absence check using 11 positive and 33 generalized place invariants in 236 ms returned sat
[2024-05-28 17:54:32] [INFO ] [Nat]Absence check using state equation in 3641 ms returned sat
[2024-05-28 17:54:32] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-28 17:54:34] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 17:54:35] [INFO ] [Nat]Added 200 Read/Feed constraints in 2590 ms returned sat
[2024-05-28 17:54:36] [INFO ] Deduced a trap composed of 43 places in 626 ms of which 7 ms to minimize.
[2024-05-28 17:54:36] [INFO ] Deduced a trap composed of 49 places in 415 ms of which 3 ms to minimize.
[2024-05-28 17:54:37] [INFO ] Deduced a trap composed of 49 places in 356 ms of which 3 ms to minimize.
[2024-05-28 17:54:38] [INFO ] Deduced a trap composed of 197 places in 443 ms of which 3 ms to minimize.
[2024-05-28 17:54:39] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:54:40] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2024-05-28 17:54:40] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 1 ms to minimize.
[2024-05-28 17:54:41] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 1 ms to minimize.
[2024-05-28 17:54:41] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-05-28 17:54:42] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:54:42] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 0 ms to minimize.
[2024-05-28 17:54:43] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 7495 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:954)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 17:54:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1691 reset in 699 ms.
Product exploration explored 100000 steps with 1696 reset in 637 ms.
Built C files in :
/tmp/ltsmin592862811336257823
[2024-05-28 17:54:44] [INFO ] Too many transitions (2048) to apply POR reductions. Disabling POR matrices.
[2024-05-28 17:54:44] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin592862811336257823
Running compilation step : cd /tmp/ltsmin592862811336257823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin592862811336257823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin592862811336257823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 10 out of 580 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 580/580 places, 2048/2048 transitions.
Applied a total of 0 rules in 34 ms. Remains 580 /580 variables (removed 0) and now considering 2048/2048 (removed 0) transitions.
Running 2044 sub problems to find dead transitions.
[2024-05-28 17:54:47] [INFO ] Flow matrix only has 2008 transitions (discarded 40 similar events)
[2024-05-28 17:54:47] [INFO ] Invariant cache hit.
[2024-05-28 17:54:47] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
[2024-05-28 17:55:14] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-05-28 17:55:14] [INFO ] Deduced a trap composed of 48 places in 170 ms of which 0 ms to minimize.
[2024-05-28 17:55:14] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 0 ms to minimize.
[2024-05-28 17:55:14] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:55:15] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:55:15] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 0 ms to minimize.
[2024-05-28 17:55:15] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:55:15] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:55:15] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 0 ms to minimize.
[2024-05-28 17:55:15] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:55:16] [INFO ] Deduced a trap composed of 232 places in 303 ms of which 3 ms to minimize.
[2024-05-28 17:55:16] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 2 ms to minimize.
[2024-05-28 17:55:17] [INFO ] Deduced a trap composed of 216 places in 361 ms of which 3 ms to minimize.
[2024-05-28 17:55:18] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 2 ms to minimize.
[2024-05-28 17:55:19] [INFO ] Deduced a trap composed of 262 places in 334 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/2588 variables, and 55 constraints, problems are : Problem set: 0 solved, 2044 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/580 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2044/2044 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2044 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/576 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 2044 unsolved
[2024-05-28 17:55:34] [INFO ] Deduced a trap composed of 310 places in 317 ms of which 3 ms to minimize.
[2024-05-28 17:55:34] [INFO ] Deduced a trap composed of 290 places in 317 ms of which 4 ms to minimize.
[2024-05-28 17:55:36] [INFO ] Deduced a trap composed of 111 places in 337 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/2588 variables, and 58 constraints, problems are : Problem set: 0 solved, 2044 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/580 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2044 constraints, Known Traps: 18/18 constraints]
After SMT, in 54195ms problems are : Problem set: 0 solved, 2044 unsolved
Search for dead transitions found 0 dead transitions in 54215ms
[2024-05-28 17:55:41] [INFO ] Flow matrix only has 2008 transitions (discarded 40 similar events)
[2024-05-28 17:55:41] [INFO ] Invariant cache hit.
[2024-05-28 17:55:42] [INFO ] Implicit Places using invariants in 716 ms returned []
[2024-05-28 17:55:42] [INFO ] Flow matrix only has 2008 transitions (discarded 40 similar events)
[2024-05-28 17:55:42] [INFO ] Invariant cache hit.
[2024-05-28 17:55:44] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-28 17:56:06] [INFO ] Implicit Places using invariants and state equation in 24418 ms returned []
Implicit Place search using SMT with State Equation took 25142 ms to find 0 implicit places.
[2024-05-28 17:56:07] [INFO ] Redundant transitions in 108 ms returned []
Running 2044 sub problems to find dead transitions.
[2024-05-28 17:56:07] [INFO ] Flow matrix only has 2008 transitions (discarded 40 similar events)
[2024-05-28 17:56:07] [INFO ] Invariant cache hit.
[2024-05-28 17:56:07] [INFO ] State equation strengthened by 200 read => feed constraints.

BK_STOP 1716918975645

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S04J04T10"
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-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-PT-S04J04T10, 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 r290-tajo-171654446800284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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