Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r508-tall-171654352000619.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is NoC3x3-PT-5A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654352000619
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 736K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 07:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Apr 12 07:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 07:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 07:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 248K 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 NoC3x3-PT-5A-LTLCardinality-00
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-01
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-02
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-03
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-04
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-05
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-06
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-07
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-08
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-09
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-10
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-11
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-12
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-13
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-14
FORMULA_NAME NoC3x3-PT-5A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717242228073

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-5A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:43:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:43:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:43:49] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-06-01 11:43:49] [INFO ] Transformed 417 places.
[2024-06-01 11:43:49] [INFO ] Transformed 933 transitions.
[2024-06-01 11:43:49] [INFO ] Found NUPN structural information;
[2024-06-01 11:43:49] [INFO ] Parsed PT model containing 417 places and 933 transitions and 3585 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA NoC3x3-PT-5A-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5A-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5A-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5A-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5A-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5A-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5A-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5A-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 417 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 417/417 places, 933/933 transitions.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 66 place count 351 transition count 785
Iterating global reduction 0 with 66 rules applied. Total rules applied 132 place count 351 transition count 785
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 135 place count 348 transition count 773
Iterating global reduction 0 with 3 rules applied. Total rules applied 138 place count 348 transition count 773
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 144 place count 348 transition count 767
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 168 place count 348 transition count 743
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 170 place count 346 transition count 743
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 172 place count 344 transition count 737
Iterating global reduction 2 with 2 rules applied. Total rules applied 174 place count 344 transition count 737
Applied a total of 174 rules in 99 ms. Remains 344 /417 variables (removed 73) and now considering 737/933 (removed 196) transitions.
[2024-06-01 11:43:49] [INFO ] Flow matrix only has 723 transitions (discarded 14 similar events)
// Phase 1: matrix 723 rows 344 cols
[2024-06-01 11:43:49] [INFO ] Computed 64 invariants in 26 ms
[2024-06-01 11:43:50] [INFO ] Implicit Places using invariants in 370 ms returned [39, 74, 108, 156, 221, 259, 294]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 402 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 337/417 places, 737/933 transitions.
Applied a total of 0 rules in 5 ms. Remains 337 /337 variables (removed 0) and now considering 737/737 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 523 ms. Remains : 337/417 places, 737/933 transitions.
Support contains 28 out of 337 places after structural reductions.
[2024-06-01 11:43:50] [INFO ] Flatten gal took : 88 ms
[2024-06-01 11:43:50] [INFO ] Flatten gal took : 59 ms
[2024-06-01 11:43:50] [INFO ] Input system was already deterministic with 737 transitions.
Support contains 22 out of 337 places (down from 28) after GAL structural reductions.
RANDOM walk for 38089 steps (8 resets) in 1440 ms. (26 steps per ms) remains 0/13 properties
Computed a total of 1 stabilizing places and 1 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' '!(X(X(X(X(G(p0))))))'
Support contains 2 out of 337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 337/337 places, 737/737 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 324 transition count 702
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 324 transition count 702
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 323 transition count 698
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 323 transition count 698
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 323 transition count 696
Applied a total of 30 rules in 20 ms. Remains 323 /337 variables (removed 14) and now considering 696/737 (removed 41) transitions.
// Phase 1: matrix 696 rows 323 cols
[2024-06-01 11:43:51] [INFO ] Computed 57 invariants in 9 ms
[2024-06-01 11:43:51] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-06-01 11:43:51] [INFO ] Invariant cache hit.
[2024-06-01 11:43:51] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 11:43:51] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2024-06-01 11:43:51] [INFO ] Invariant cache hit.
[2024-06-01 11:43:51] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (OVERLAPS) 1/323 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 3 (OVERLAPS) 696/1019 variables, 323/380 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1019 variables, 18/398 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 11:44:14] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1019 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 695 unsolved
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 1019/1019 variables, and 399 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 323/323 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (OVERLAPS) 1/323 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 4 (OVERLAPS) 696/1019 variables, 323/381 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1019 variables, 18/399 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1019 variables, 695/1094 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 11:44:38] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 2 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 Int declared 1019/1019 variables, and 1095 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 323/323 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 2/2 constraints]
After SMT, in 60404ms problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 60425ms
Starting structural reductions in LTL mode, iteration 1 : 323/337 places, 696/737 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61141 ms. Remains : 323/337 places, 696/737 transitions.
Stuttering acceptance computed with spot in 278 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5A-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-5A-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5A-LTLCardinality-00 finished in 61486 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(p0))'
Support contains 2 out of 337 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 337/337 places, 737/737 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 323 transition count 701
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 323 transition count 701
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 322 transition count 697
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 322 transition count 697
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 322 transition count 695
Applied a total of 30 rules in 46 ms. Remains 322 /337 variables (removed 15) and now considering 695/737 (removed 42) transitions.
// Phase 1: matrix 695 rows 322 cols
[2024-06-01 11:44:52] [INFO ] Computed 57 invariants in 2 ms
[2024-06-01 11:44:52] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-01 11:44:52] [INFO ] Invariant cache hit.
[2024-06-01 11:44:53] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 11:44:53] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
[2024-06-01 11:44:53] [INFO ] Redundant transitions in 35 ms returned []
Running 664 sub problems to find dead transitions.
[2024-06-01 11:44:53] [INFO ] Invariant cache hit.
[2024-06-01 11:44:53] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 2 (OVERLAPS) 695/1017 variables, 322/379 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1017 variables, 18/397 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1017 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 5 (OVERLAPS) 0/1017 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 664 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1017/1017 variables, and 397 constraints, problems are : Problem set: 0 solved, 664 unsolved in 25985 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 322/322 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 664/664 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 664 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 2 (OVERLAPS) 695/1017 variables, 322/379 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1017 variables, 18/397 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1017 variables, 664/1061 constraints. Problems are: Problem set: 0 solved, 664 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1017/1017 variables, and 1061 constraints, problems are : Problem set: 0 solved, 664 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 322/322 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 664/664 constraints, Known Traps: 0/0 constraints]
After SMT, in 56229ms problems are : Problem set: 0 solved, 664 unsolved
Search for dead transitions found 0 dead transitions in 56240ms
Starting structural reductions in SI_LTL mode, iteration 1 : 322/337 places, 695/737 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56839 ms. Remains : 322/337 places, 695/737 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-5A-LTLCardinality-02
Product exploration explored 100000 steps with 108 reset in 496 ms.
Stack based approach found an accepted trace after 5318 steps with 8 reset with depth 72 and stack size 72 in 26 ms.
FORMULA NoC3x3-PT-5A-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-5A-LTLCardinality-02 finished in 57420 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((p0||X((p0 U G(p1))))))'
Support contains 2 out of 337 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 337/337 places, 737/737 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 324 transition count 704
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 324 transition count 704
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 323 transition count 700
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 323 transition count 700
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 323 transition count 698
Applied a total of 28 rules in 29 ms. Remains 323 /337 variables (removed 14) and now considering 698/737 (removed 39) transitions.
// Phase 1: matrix 698 rows 323 cols
[2024-06-01 11:45:50] [INFO ] Computed 57 invariants in 6 ms
[2024-06-01 11:45:50] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-06-01 11:45:50] [INFO ] Invariant cache hit.
[2024-06-01 11:45:50] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 11:45:50] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2024-06-01 11:45:50] [INFO ] Redundant transitions in 77 ms returned []
Running 667 sub problems to find dead transitions.
[2024-06-01 11:45:50] [INFO ] Invariant cache hit.
[2024-06-01 11:45:50] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 2 (OVERLAPS) 698/1021 variables, 323/380 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 18/398 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 5 (OVERLAPS) 0/1021 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 667 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1021/1021 variables, and 398 constraints, problems are : Problem set: 0 solved, 667 unsolved in 25016 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 323/323 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 667/667 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 667 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 2 (OVERLAPS) 698/1021 variables, 323/380 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 18/398 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 667/1065 constraints. Problems are: Problem set: 0 solved, 667 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1021/1021 variables, and 1065 constraints, problems are : Problem set: 0 solved, 667 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 323/323 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 667/667 constraints, Known Traps: 0/0 constraints]
After SMT, in 55230ms problems are : Problem set: 0 solved, 667 unsolved
Search for dead transitions found 0 dead transitions in 55236ms
Starting structural reductions in SI_LTL mode, iteration 1 : 323/337 places, 698/737 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55935 ms. Remains : 323/337 places, 698/737 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-5A-LTLCardinality-03
Product exploration explored 100000 steps with 14 reset in 366 ms.
Stack based approach found an accepted trace after 4254 steps with 2 reset with depth 3453 and stack size 3453 in 24 ms.
FORMULA NoC3x3-PT-5A-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-5A-LTLCardinality-03 finished in 56395 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((p0&&G(p1))))'
Support contains 4 out of 337 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 337/337 places, 737/737 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 326 transition count 710
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 326 transition count 710
Applied a total of 20 rules in 25 ms. Remains 326 /337 variables (removed 11) and now considering 710/737 (removed 27) transitions.
[2024-06-01 11:46:46] [INFO ] Flow matrix only has 708 transitions (discarded 2 similar events)
// Phase 1: matrix 708 rows 326 cols
[2024-06-01 11:46:46] [INFO ] Computed 57 invariants in 3 ms
[2024-06-01 11:46:46] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-06-01 11:46:46] [INFO ] Flow matrix only has 708 transitions (discarded 2 similar events)
[2024-06-01 11:46:46] [INFO ] Invariant cache hit.
[2024-06-01 11:46:46] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 11:46:47] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
[2024-06-01 11:46:47] [INFO ] Redundant transitions in 7 ms returned []
Running 679 sub problems to find dead transitions.
[2024-06-01 11:46:47] [INFO ] Flow matrix only has 708 transitions (discarded 2 similar events)
[2024-06-01 11:46:47] [INFO ] Invariant cache hit.
[2024-06-01 11:46:47] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/326 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (OVERLAPS) 708/1034 variables, 326/383 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1034 variables, 18/401 constraints. Problems are: Problem set: 0 solved, 679 unsolved
[2024-06-01 11:47:05] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1034 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1034 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 679 unsolved
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 1034/1034 variables, and 402 constraints, problems are : Problem set: 0 solved, 679 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 326/326 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 679/679 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 679 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/326 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (OVERLAPS) 708/1034 variables, 326/384 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1034 variables, 18/402 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1034 variables, 679/1081 constraints. Problems are: Problem set: 0 solved, 679 unsolved
[2024-06-01 11:47:32] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1034/1034 variables, and 1082 constraints, problems are : Problem set: 0 solved, 679 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 326/326 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 679/679 constraints, Known Traps: 2/2 constraints]
After SMT, in 60234ms problems are : Problem set: 0 solved, 679 unsolved
Search for dead transitions found 0 dead transitions in 60241ms
Starting structural reductions in SI_LTL mode, iteration 1 : 326/337 places, 710/737 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60822 ms. Remains : 326/337 places, 710/737 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-5A-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 330 ms.
Product exploration explored 100000 steps with 0 reset in 397 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 p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 305 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 14504 steps (2 resets) in 75 ms. (190 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 3 factoid took 445 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 326 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 326/326 places, 710/710 transitions.
Applied a total of 0 rules in 17 ms. Remains 326 /326 variables (removed 0) and now considering 710/710 (removed 0) transitions.
[2024-06-01 11:47:49] [INFO ] Flow matrix only has 708 transitions (discarded 2 similar events)
[2024-06-01 11:47:49] [INFO ] Invariant cache hit.
[2024-06-01 11:47:49] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 11:47:49] [INFO ] Flow matrix only has 708 transitions (discarded 2 similar events)
[2024-06-01 11:47:49] [INFO ] Invariant cache hit.
[2024-06-01 11:47:49] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 11:47:49] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2024-06-01 11:47:49] [INFO ] Redundant transitions in 8 ms returned []
Running 679 sub problems to find dead transitions.
[2024-06-01 11:47:49] [INFO ] Flow matrix only has 708 transitions (discarded 2 similar events)
[2024-06-01 11:47:49] [INFO ] Invariant cache hit.
[2024-06-01 11:47:49] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/326 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (OVERLAPS) 708/1034 variables, 326/383 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1034 variables, 18/401 constraints. Problems are: Problem set: 0 solved, 679 unsolved
[2024-06-01 11:48:08] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1034 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1034 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 679 unsolved
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 1034/1034 variables, and 402 constraints, problems are : Problem set: 0 solved, 679 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 326/326 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 679/679 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 679 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/326 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (OVERLAPS) 708/1034 variables, 326/384 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1034 variables, 18/402 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1034 variables, 679/1081 constraints. Problems are: Problem set: 0 solved, 679 unsolved
[2024-06-01 11:48:34] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1034/1034 variables, and 1082 constraints, problems are : Problem set: 0 solved, 679 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 326/326 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 679/679 constraints, Known Traps: 2/2 constraints]
After SMT, in 60221ms problems are : Problem set: 0 solved, 679 unsolved
Search for dead transitions found 0 dead transitions in 60232ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60722 ms. Remains : 326/326 places, 710/710 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 p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 341 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 20121 steps (4 resets) in 95 ms. (209 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 3 factoid took 454 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 54 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 260 ms.
Product exploration explored 100000 steps with 0 reset in 334 ms.
Support contains 4 out of 326 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 326/326 places, 710/710 transitions.
Applied a total of 0 rules in 11 ms. Remains 326 /326 variables (removed 0) and now considering 710/710 (removed 0) transitions.
[2024-06-01 11:48:51] [INFO ] Flow matrix only has 708 transitions (discarded 2 similar events)
[2024-06-01 11:48:51] [INFO ] Invariant cache hit.
[2024-06-01 11:48:51] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-01 11:48:51] [INFO ] Flow matrix only has 708 transitions (discarded 2 similar events)
[2024-06-01 11:48:51] [INFO ] Invariant cache hit.
[2024-06-01 11:48:52] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 11:48:52] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2024-06-01 11:48:52] [INFO ] Redundant transitions in 7 ms returned []
Running 679 sub problems to find dead transitions.
[2024-06-01 11:48:52] [INFO ] Flow matrix only has 708 transitions (discarded 2 similar events)
[2024-06-01 11:48:52] [INFO ] Invariant cache hit.
[2024-06-01 11:48:52] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/326 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (OVERLAPS) 708/1034 variables, 326/383 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1034 variables, 18/401 constraints. Problems are: Problem set: 0 solved, 679 unsolved
[2024-06-01 11:49:11] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1034 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1034 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 679 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1034/1034 variables, and 402 constraints, problems are : Problem set: 0 solved, 679 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 326/326 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 679/679 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 679 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/326 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (OVERLAPS) 708/1034 variables, 326/384 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1034 variables, 18/402 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1034 variables, 679/1081 constraints. Problems are: Problem set: 0 solved, 679 unsolved
[2024-06-01 11:49:37] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1034/1034 variables, and 1082 constraints, problems are : Problem set: 0 solved, 679 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 326/326 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 679/679 constraints, Known Traps: 2/2 constraints]
After SMT, in 60222ms problems are : Problem set: 0 solved, 679 unsolved
Search for dead transitions found 0 dead transitions in 60228ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60723 ms. Remains : 326/326 places, 710/710 transitions.
Treatment of property NoC3x3-PT-5A-LTLCardinality-04 finished in 186139 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((G(p0)||X(X(F(p1))))))'
Support contains 4 out of 337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 337/337 places, 737/737 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 326 transition count 706
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 326 transition count 706
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 325 transition count 702
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 325 transition count 702
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 325 transition count 700
Applied a total of 26 rules in 9 ms. Remains 325 /337 variables (removed 12) and now considering 700/737 (removed 37) transitions.
// Phase 1: matrix 700 rows 325 cols
[2024-06-01 11:49:52] [INFO ] Computed 57 invariants in 2 ms
[2024-06-01 11:49:52] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-06-01 11:49:52] [INFO ] Invariant cache hit.
[2024-06-01 11:49:53] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 11:49:53] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
Running 699 sub problems to find dead transitions.
[2024-06-01 11:49:53] [INFO ] Invariant cache hit.
[2024-06-01 11:49:53] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 1 (OVERLAPS) 1/325 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 3 (OVERLAPS) 700/1025 variables, 325/382 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 18/400 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1025 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 699 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1025/1025 variables, and 400 constraints, problems are : Problem set: 0 solved, 699 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 325/325 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 699/699 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 699 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 1 (OVERLAPS) 1/325 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 3 (OVERLAPS) 700/1025 variables, 325/382 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 18/400 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1025 variables, 699/1099 constraints. Problems are: Problem set: 0 solved, 699 unsolved
[2024-06-01 11:50:40] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:50:49] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1025/1025 variables, and 1101 constraints, problems are : Problem set: 0 solved, 699 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 325/325 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 699/699 constraints, Known Traps: 2/2 constraints]
After SMT, in 60249ms problems are : Problem set: 0 solved, 699 unsolved
Search for dead transitions found 0 dead transitions in 60257ms
Starting structural reductions in LTL mode, iteration 1 : 325/337 places, 700/737 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60945 ms. Remains : 325/337 places, 700/737 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-5A-LTLCardinality-06
Product exploration explored 100000 steps with 5 reset in 311 ms.
Stack based approach found an accepted trace after 7364 steps with 3 reset with depth 1317 and stack size 1317 in 29 ms.
FORMULA NoC3x3-PT-5A-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-5A-LTLCardinality-06 finished in 61526 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)))'
Support contains 1 out of 337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 337/337 places, 737/737 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 325 transition count 705
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 325 transition count 705
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 324 transition count 701
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 324 transition count 701
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 324 transition count 699
Applied a total of 28 rules in 23 ms. Remains 324 /337 variables (removed 13) and now considering 699/737 (removed 38) transitions.
[2024-06-01 11:50:54] [INFO ] Flow matrix only has 697 transitions (discarded 2 similar events)
// Phase 1: matrix 697 rows 324 cols
[2024-06-01 11:50:54] [INFO ] Computed 57 invariants in 4 ms
[2024-06-01 11:50:54] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-06-01 11:50:54] [INFO ] Flow matrix only has 697 transitions (discarded 2 similar events)
[2024-06-01 11:50:54] [INFO ] Invariant cache hit.
[2024-06-01 11:50:54] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 11:50:54] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
Running 698 sub problems to find dead transitions.
[2024-06-01 11:50:54] [INFO ] Flow matrix only has 697 transitions (discarded 2 similar events)
[2024-06-01 11:50:54] [INFO ] Invariant cache hit.
[2024-06-01 11:50:54] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (OVERLAPS) 1/324 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 3 (OVERLAPS) 697/1021 variables, 324/381 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 18/399 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1021 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 698 unsolved
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 1021/1021 variables, and 399 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 324/324 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 698 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (OVERLAPS) 1/324 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 3 (OVERLAPS) 697/1021 variables, 324/381 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 18/399 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1021 variables, 698/1097 constraints. Problems are: Problem set: 0 solved, 698 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1021/1021 variables, and 1097 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 324/324 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 0/0 constraints]
After SMT, in 60267ms problems are : Problem set: 0 solved, 698 unsolved
Search for dead transitions found 0 dead transitions in 60274ms
Starting structural reductions in LTL mode, iteration 1 : 324/337 places, 699/737 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60774 ms. Remains : 324/337 places, 699/737 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5A-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 862 ms.
Product exploration explored 100000 steps with 50000 reset in 876 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-5A-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-5A-LTLCardinality-11 finished in 62681 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(p0)))'
Support contains 2 out of 337 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 337/337 places, 737/737 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 324 transition count 702
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 324 transition count 702
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 323 transition count 698
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 323 transition count 698
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 323 transition count 696
Applied a total of 30 rules in 22 ms. Remains 323 /337 variables (removed 14) and now considering 696/737 (removed 41) transitions.
// Phase 1: matrix 696 rows 323 cols
[2024-06-01 11:51:56] [INFO ] Computed 57 invariants in 2 ms
[2024-06-01 11:51:57] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-01 11:51:57] [INFO ] Invariant cache hit.
[2024-06-01 11:51:57] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 11:51:57] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2024-06-01 11:51:57] [INFO ] Redundant transitions in 6 ms returned []
Running 695 sub problems to find dead transitions.
[2024-06-01 11:51:57] [INFO ] Invariant cache hit.
[2024-06-01 11:51:57] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (OVERLAPS) 1/323 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 3 (OVERLAPS) 696/1019 variables, 323/380 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1019 variables, 18/398 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 11:52:19] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1019 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 695 unsolved
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 1019/1019 variables, and 399 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 323/323 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (OVERLAPS) 1/323 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 4 (OVERLAPS) 696/1019 variables, 323/381 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1019 variables, 18/399 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1019 variables, 695/1094 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 11:52:43] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1019/1019 variables, and 1095 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 323/323 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 2/2 constraints]
After SMT, in 60244ms problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 60250ms
Starting structural reductions in SI_LTL mode, iteration 1 : 323/337 places, 696/737 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60758 ms. Remains : 323/337 places, 696/737 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-5A-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 291 ms.
Stack based approach found an accepted trace after 8458 steps with 0 reset with depth 8459 and stack size 8459 in 34 ms.
FORMULA NoC3x3-PT-5A-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-5A-LTLCardinality-14 finished in 61136 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(p2)&&p1))))'
Support contains 6 out of 337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 337/337 places, 737/737 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 328 transition count 714
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 328 transition count 714
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 327 transition count 710
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 327 transition count 710
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 327 transition count 708
Applied a total of 22 rules in 8 ms. Remains 327 /337 variables (removed 10) and now considering 708/737 (removed 29) transitions.
[2024-06-01 11:52:58] [INFO ] Flow matrix only has 700 transitions (discarded 8 similar events)
// Phase 1: matrix 700 rows 327 cols
[2024-06-01 11:52:58] [INFO ] Computed 57 invariants in 2 ms
[2024-06-01 11:52:58] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-01 11:52:58] [INFO ] Flow matrix only has 700 transitions (discarded 8 similar events)
[2024-06-01 11:52:58] [INFO ] Invariant cache hit.
[2024-06-01 11:52:58] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 11:52:58] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Running 707 sub problems to find dead transitions.
[2024-06-01 11:52:58] [INFO ] Flow matrix only has 700 transitions (discarded 8 similar events)
[2024-06-01 11:52:58] [INFO ] Invariant cache hit.
[2024-06-01 11:52:58] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 707 unsolved
At refinement iteration 1 (OVERLAPS) 1/327 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 707 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/327 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 707 unsolved
At refinement iteration 3 (OVERLAPS) 700/1027 variables, 327/384 constraints. Problems are: Problem set: 0 solved, 707 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1027 variables, 18/402 constraints. Problems are: Problem set: 0 solved, 707 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1027 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 707 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1027/1027 variables, and 402 constraints, problems are : Problem set: 0 solved, 707 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 327/327 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 707/707 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 707 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 707 unsolved
At refinement iteration 1 (OVERLAPS) 1/327 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 707 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/327 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 707 unsolved
At refinement iteration 3 (OVERLAPS) 700/1027 variables, 327/384 constraints. Problems are: Problem set: 0 solved, 707 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1027 variables, 18/402 constraints. Problems are: Problem set: 0 solved, 707 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1027 variables, 707/1109 constraints. Problems are: Problem set: 0 solved, 707 unsolved
[2024-06-01 11:53:44] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1027/1027 variables, and 1110 constraints, problems are : Problem set: 0 solved, 707 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 327/327 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 707/707 constraints, Known Traps: 1/1 constraints]
After SMT, in 60239ms problems are : Problem set: 0 solved, 707 unsolved
Search for dead transitions found 0 dead transitions in 60246ms
Starting structural reductions in LTL mode, iteration 1 : 327/337 places, 708/737 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60754 ms. Remains : 327/337 places, 708/737 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-5A-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 889 ms.
Product exploration explored 100000 steps with 50000 reset in 898 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 p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) p1 p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 20 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-5A-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-5A-LTLCardinality-15 finished in 62718 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((p0&&G(p1))))'
[2024-06-01 11:54:00] [INFO ] Flatten gal took : 38 ms
[2024-06-01 11:54:00] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 11:54:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 337 places, 737 transitions and 2806 arcs took 8 ms.
Total runtime 611822 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA NoC3x3-PT-5A-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717242884113

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name NoC3x3-PT-5A-LTLCardinality-04
ltl formula formula --ltl=/tmp/1030/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 337 places, 737 transitions and 2806 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1030/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1030/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1030/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1030/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 338 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 338, there are 755 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2500 levels ~10000 states ~175480 transitions
pnml2lts-mc( 1/ 4): ~5000 levels ~20000 states ~354280 transitions
pnml2lts-mc( 1/ 4): ~10000 levels ~40000 states ~732100 transitions
pnml2lts-mc( 1/ 4): ~20000 levels ~80000 states ~1457776 transitions
pnml2lts-mc( 1/ 4): ~40000 levels ~160000 states ~2929700 transitions
pnml2lts-mc( 3/ 4): ~80000 levels ~320000 states ~4088056 transitions
pnml2lts-mc( 3/ 4): ~160000 levels ~640000 states ~7264980 transitions
pnml2lts-mc( 3/ 4): ~320000 levels ~1280000 states ~13751800 transitions
pnml2lts-mc( 3/ 4): ~640000 levels ~2560000 states ~27335896 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2631749
pnml2lts-mc( 0/ 4): unique transitions count: 41826769
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 5194779
pnml2lts-mc( 0/ 4): - claim success count: 2631755
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2631755
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2631755 states 41826865 transitions, fanout: 15.893
pnml2lts-mc( 0/ 4): Total exploration time 42.290 sec (42.120 sec minimum, 42.180 sec on average)
pnml2lts-mc( 0/ 4): States per second: 62231, Transitions per second: 989049
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 274.8MB, 8.6 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/29.0%
pnml2lts-mc( 0/ 4): Stored 749 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 274.8MB (~256.0MB paged-in)

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="NoC3x3-PT-5A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is NoC3x3-PT-5A, 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 r508-tall-171654352000619"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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