Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654447000412.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 PolyORBNT-COL-S10J30, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447000412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.9K Apr 12 11:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 11:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 11:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 11:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 12 13:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 13:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 93K 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 PolyORBNT-COL-S10J30-LTLFireability-00
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-01
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-02
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-03
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-04
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-05
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-06
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-07
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-08
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-09
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-10
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-11
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-12
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-13
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-14
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716926971726

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J30
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-28 20:09:32] [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 20:09:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 20:09:32] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 20:09:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 20:09:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 535 ms
[2024-05-28 20:09:33] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 694 PT places and 12142.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 20:09:33] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2024-05-28 20:09:33] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 40006 steps (2276 resets) in 1810 ms. (22 steps per ms) remains 14/17 properties
BEST_FIRST walk for 40002 steps (478 resets) in 382 ms. (104 steps per ms) remains 3/14 properties
BEST_FIRST walk for 40003 steps (850 resets) in 160 ms. (248 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (600 resets) in 50 ms. (784 steps per ms) remains 1/3 properties
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 20:09:34] [INFO ] Computed 13 invariants in 8 ms
[2024-05-28 20:09:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 40/86 variables, and 8 constraints, problems are : Problem set: 1 solved, 0 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 1/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/48 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 182ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 20:09:34] [INFO ] Flatten gal took : 20 ms
[2024-05-28 20:09:34] [INFO ] Flatten gal took : 5 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 20:09:34] [INFO ] Unfolded HLPN to a Petri net with 694 places and 12080 transitions 112619 arcs in 219 ms.
[2024-05-28 20:09:34] [INFO ] Unfolded 11 HLPN properties in 0 ms.
[2024-05-28 20:09:34] [INFO ] Reduced 780 identical enabling conditions.
[2024-05-28 20:09:34] [INFO ] Reduced 45 identical enabling conditions.
[2024-05-28 20:09:34] [INFO ] Reduced 45 identical enabling conditions.
[2024-05-28 20:09:34] [INFO ] Reduced 45 identical enabling conditions.
[2024-05-28 20:09:34] [INFO ] Reduced 45 identical enabling conditions.
[2024-05-28 20:09:34] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 30 places in 21 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 449 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 663 transition count 1939
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 663 transition count 1939
Applied a total of 2 rules in 77 ms. Remains 663 /664 variables (removed 1) and now considering 1939/1940 (removed 1) transitions.
Running 1928 sub problems to find dead transitions.
[2024-05-28 20:09:35] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
// Phase 1: matrix 1930 rows 663 cols
[2024-05-28 20:09:35] [INFO ] Computed 92 invariants in 68 ms
[2024-05-28 20:09:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1928 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 642/2593 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20086 ms.
Refiners :[Positive P Invariants (semi-flows): 66/85 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/663 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
[2024-05-28 20:10:17] [INFO ] Deduced a trap composed of 19 places in 451 ms of which 26 ms to minimize.
[2024-05-28 20:10:18] [INFO ] Deduced a trap composed of 12 places in 671 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2593 variables, and 73 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 66/85 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/663 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 2/2 constraints]
After SMT, in 57677ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 57722ms
[2024-05-28 20:10:32] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 20:10:32] [INFO ] Invariant cache hit.
[2024-05-28 20:10:33] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-28 20:10:33] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 20:10:33] [INFO ] Invariant cache hit.
[2024-05-28 20:10:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:10:35] [INFO ] Implicit Places using invariants and state equation in 2449 ms returned []
Implicit Place search using SMT with State Equation took 2758 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-28 20:10:35] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 20:10:35] [INFO ] Invariant cache hit.
[2024-05-28 20:10:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD452 is UNSAT
At refinement iteration 3 (OVERLAPS) 19/661 variables, 19/90 constraints. Problems are: Problem set: 161 solved, 1767 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 661/2593 variables, and 90 constraints, problems are : Problem set: 161 solved, 1767 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/663 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 161 solved, 1767 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 161 solved, 1767 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 161 solved, 1767 unsolved
[2024-05-28 20:11:31] [INFO ] Deduced a trap composed of 19 places in 366 ms of which 3 ms to minimize.
[2024-05-28 20:11:31] [INFO ] Deduced a trap composed of 12 places in 462 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 2/73 constraints. Problems are: Problem set: 161 solved, 1767 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 Int declared 642/2593 variables, and 73 constraints, problems are : Problem set: 161 solved, 1767 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 66/85 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/663 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 839/928 constraints, Known Traps: 2/2 constraints]
After SMT, in 81514ms problems are : Problem set: 161 solved, 1767 unsolved
Search for dead transitions found 161 dead transitions in 81564ms
Found 161 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 161 transitions
Dead transitions reduction (with SMT) removed 161 transitions
Starting structural reductions in LTL mode, iteration 1 : 663/664 places, 1778/1940 transitions.
Applied a total of 0 rules in 15 ms. Remains 663 /663 variables (removed 0) and now considering 1778/1778 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 142179 ms. Remains : 663/664 places, 1778/1940 transitions.
Support contains 449 out of 663 places after structural reductions.
[2024-05-28 20:11:57] [INFO ] Flatten gal took : 201 ms
[2024-05-28 20:11:57] [INFO ] Flatten gal took : 153 ms
[2024-05-28 20:11:58] [INFO ] Input system was already deterministic with 1778 transitions.
RANDOM walk for 40000 steps (2236 resets) in 3260 ms. (12 steps per ms) remains 2/16 properties
BEST_FIRST walk for 793 steps (0 resets) in 12 ms. (61 steps per ms) remains 0/2 properties
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(p0)&&X(G(p1))))'
Support contains 13 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 1778/1778 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 653 transition count 1778
Applied a total of 10 rules in 49 ms. Remains 653 /663 variables (removed 10) and now considering 1778/1778 (removed 0) transitions.
Running 1767 sub problems to find dead transitions.
[2024-05-28 20:11:59] [INFO ] Flow matrix only has 1769 transitions (discarded 9 similar events)
// Phase 1: matrix 1769 rows 653 cols
[2024-05-28 20:11:59] [INFO ] Computed 82 invariants in 61 ms
[2024-05-28 20:11:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1767 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1767 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 642/2422 variables, and 71 constraints, problems are : Problem set: 0 solved, 1767 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 66/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1767/1767 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1767 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1767 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1767 unsolved
[2024-05-28 20:12:41] [INFO ] Deduced a trap composed of 19 places in 329 ms of which 3 ms to minimize.
[2024-05-28 20:12:41] [INFO ] Deduced a trap composed of 12 places in 323 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2422 variables, and 73 constraints, problems are : Problem set: 0 solved, 1767 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 66/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1767 constraints, Known Traps: 2/2 constraints]
After SMT, in 57835ms problems are : Problem set: 0 solved, 1767 unsolved
Search for dead transitions found 0 dead transitions in 57853ms
[2024-05-28 20:12:57] [INFO ] Flow matrix only has 1769 transitions (discarded 9 similar events)
[2024-05-28 20:12:57] [INFO ] Invariant cache hit.
[2024-05-28 20:12:57] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-28 20:12:57] [INFO ] Flow matrix only has 1769 transitions (discarded 9 similar events)
[2024-05-28 20:12:57] [INFO ] Invariant cache hit.
[2024-05-28 20:12:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:13:01] [INFO ] Implicit Places using invariants and state equation in 4077 ms returned []
Implicit Place search using SMT with State Equation took 4467 ms to find 0 implicit places.
Running 1767 sub problems to find dead transitions.
[2024-05-28 20:13:01] [INFO ] Flow matrix only has 1769 transitions (discarded 9 similar events)
[2024-05-28 20:13:01] [INFO ] Invariant cache hit.
[2024-05-28 20:13:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1767 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1767 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2422 variables, and 71 constraints, problems are : Problem set: 0 solved, 1767 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 66/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1767/1767 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1767 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1767 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1767 unsolved
[2024-05-28 20:13:55] [INFO ] Deduced a trap composed of 19 places in 448 ms of which 3 ms to minimize.
[2024-05-28 20:13:55] [INFO ] Deduced a trap composed of 12 places in 378 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1767 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2422 variables, and 73 constraints, problems are : Problem set: 0 solved, 1767 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 66/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1767 constraints, Known Traps: 2/2 constraints]
After SMT, in 79448ms problems are : Problem set: 0 solved, 1767 unsolved
Search for dead transitions found 0 dead transitions in 79486ms
Starting structural reductions in LTL mode, iteration 1 : 653/663 places, 1778/1778 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141870 ms. Remains : 653/663 places, 1778/1778 transitions.
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-00 finished in 142253 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' '!(G(F(p0)))'
Support contains 33 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 1778/1778 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 653 transition count 1743
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 618 transition count 1743
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 70 place count 618 transition count 1708
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 140 place count 583 transition count 1708
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 580 transition count 1705
Applied a total of 146 rules in 226 ms. Remains 580 /663 variables (removed 83) and now considering 1705/1778 (removed 73) transitions.
Running 1694 sub problems to find dead transitions.
[2024-05-28 20:14:21] [INFO ] Flow matrix only has 1696 transitions (discarded 9 similar events)
// Phase 1: matrix 1696 rows 580 cols
[2024-05-28 20:14:21] [INFO ] Computed 82 invariants in 33 ms
[2024-05-28 20:14:21] [INFO ] State equation strengthened by 1 read => feed constraints.

BK_STOP 1716927270470

--------------------
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="PolyORBNT-COL-S10J30"
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 PolyORBNT-COL-S10J30, 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-171654447000412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J30.tgz
mv PolyORBNT-COL-S10J30 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 ;