About the Execution of ITS-Tools for PolyORBNT-COL-S05J80
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15741.640 | 3600000.00 | 10362984.00 | 4800.70 | ?TTTFTF?FFFTTTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r126-tajo-158961390600590.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBNT-COL-S05J80, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961390600590
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 3.9K Apr 12 06:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 06:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 11 05:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 11 05:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 10 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 9 18:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 18:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 94K Mar 24 05:37 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-S05J80-ReachabilityCardinality-00
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-01
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-02
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-03
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-04
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-05
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-06
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-07
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-08
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-09
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-10
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-11
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-12
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-13
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-14
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1589836952496
[2020-05-18 21:22:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-18 21:22:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 21:22:34] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-18 21:22:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 544 ms
[2020-05-18 21:22:34] [INFO ] sort/places :
D4->place_482,
Threads->FetchJobB,QueueJobE,NotifyEventJobQueuedE,NotifyEventEndOfCheckSourcesE,NotifyEventEndOfCheckSourcesB,place_523,place_522,place_521,place_520,place_518,place_500,Check_Sources_E,Check_Sources_B,place_782,place_787,Perform_Work_E,Schedule_Task_B,Try_Check_Sources_E,Try_Check_Sources_B,
D5->Schedule_Task_E,
D6->CreatedJobs,
Jobs->f3,f2,f1,AvailableJobId,
Dot->block,mo3,mo2,mo1,mi3,mi2,mi1,cSources,place_462,place_460,place_458,place_456,CanInjectEvent,JobCnt,cJobCnt,
Sources->ModifiedSrc,DataOnSrc,TheSour,
D1->FetchJobE,QueueJobB,NotifyEventJobQueuedB,Perform_Work_B,
[2020-05-18 21:22:34] [INFO ] ms1 symmetric to ms3 in transition trans_489
[2020-05-18 21:22:34] [INFO ] ms3 symmetric to ms4 in transition trans_489
[2020-05-18 21:22:34] [INFO ] ms4 symmetric to ms2 in transition trans_489
[2020-05-18 21:22:34] [INFO ] ms1 symmetric to ms3 in transition trans_488
[2020-05-18 21:22:34] [INFO ] ms3 symmetric to ms2 in transition trans_488
[2020-05-18 21:22:34] [INFO ] ms1 symmetric to ms2 in transition trans_487
[2020-05-18 21:22:34] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1269 PT places and 2592.0 transition bindings in 27 ms.
[2020-05-18 21:22:34] [INFO ] Computed order based on color domains.
[2020-05-18 21:22:34] [INFO ] Unfolded HLPN to a Petri net with 1269 places and 1775 transitions in 25 ms.
[2020-05-18 21:22:34] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 80 places in 9 ms
Reduce places removed 80 places and 80 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 62 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 687 resets, run finished after 159 ms. (steps per millisecond=62 ) properties seen :[0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0]
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 46 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 64 ms. (steps per millisecond=156 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 165 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 246 resets, run finished after 64 ms. (steps per millisecond=156 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 274 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 46 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 252 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 62 ms. (steps per millisecond=161 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-05-18 21:22:35] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2020-05-18 21:22:35] [INFO ] Computed 182 place invariants in 216 ms
[2020-05-18 21:22:35] [INFO ] [Real]Absence check using 175 positive place invariants in 189 ms returned sat
[2020-05-18 21:22:36] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 44 ms returned sat
[2020-05-18 21:22:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:22:39] [INFO ] [Real]Absence check using state equation in 3919 ms returned sat
[2020-05-18 21:22:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:22:40] [INFO ] [Nat]Absence check using 175 positive place invariants in 206 ms returned sat
[2020-05-18 21:22:40] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 61 ms returned sat
[2020-05-18 21:22:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:22:44] [INFO ] [Nat]Absence check using state equation in 4178 ms returned sat
[2020-05-18 21:22:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-18 21:22:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 16 ms returned sat
[2020-05-18 21:22:44] [INFO ] Computed and/alt/rep : 1689/52482/1685 causal constraints in 235 ms.
[2020-05-18 21:22:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t75 0) (and (and (> t561 0) (< o561 o75)) (or (and (> t324 0) (< o324 o75)) (and (> t325 0) (< o325 o75)) (and (> t326 0) (< o326 o75)) (and (> t327 0) (< o327 o75)) (and (> t328 0) (< o328 o75)) (and (> t329 0) (< o329 o75)) (and (> t330 0) (< o330 o75)) (and (> t331 0) (< o331 o75)) (and (> t332 0) (< o332 o75)) (and (> t333 0) (< o333 o75)) (and (> t334 0) (< o334 o75)) (and (> t335 0) (< o335 o75)) (and (> t336 0) (< o336 o75)) (and (> t337 0) (< o337 o75)) (and (> t338 0) (< o338 o75)) (and (> t339 0) (< o339 o75)) (and (> t340 0) (< o340 o75)) (and (> t341 0) (< o341 o75)) (and (> t342 0) (< o342 o75)) (and (> t343 0) (< o343 o75)) (and (> t344 0) (< o344 o75)) (and (> t345 0) (< o345 o75)) (and (> t346 0) (< o346 o75)) (and (> t347 0) (< o347 o75)) (and (> t348 0) (< o348 o75)) (and (> t349 0) (< o349 o75)) (and (> t350 0) (< o350 o75)) (and (> t351 0) (< o351 o75)) (and (> t352 0) (< o352 o75)) (and (> t353 0) (< o353 o75)) (and (> t354 0) (< o354 o75)) (and (> t355 0) (< o355 o75)) (and (> t356 0) (< o356 o75)) (and (> t357 0) (< o357 o75)) (and (> t358 0) (< o358 o75)) (and (> t359 0) (< o359 o75)) (and (> t360 0) (< o360 o75)) (and (> t361 0) (< o361 o75)) (and (> t362 0) (< o362 o75)) (and (> t363 0) (< o363 o75)) (and (> t364 0) (< o364 o75)) (and (> t365 0) (< o365 o75)) (and (> t366 0) (< o366 o75)) (and (> t367 0) (< o367 o75)) (and (> t368 0) (< o368 o75)) (and (> t369 0) (< o369 o75)) (and (> t370 0) (< o370 o75)) (and (> t371 0) (< o371 o75)) (and (> t372 0) (< o372 o75)) (and (> t373 0) (< o373 o75)) (and (> t374 0) (< o374 o75)) (and (> t375 0) (< o375 o75)) (and (> t376 0) (< o376 o75)) (and (> t377 0) (< o377 o75)) (and (> t378 0) (< o378 o75)) (and (> t379 0) (< o379 o75)) (and (> t380 0) (< o380 o75)) (and (> t381 0) (< o381 o75)) (and (> t382 0) (< o382 o75)) (and (> t383 0) (< o383 o75)) (and (> t384 0) (< o384 o75)) (and (> t385 0) (< o385 o75)) (and (> t386 0) (< o386 o75)) (and (> t387 0) (< o387 o75)) (and (> t388 0) (< o388 o75)) (and (> t389 0) (< o389 o75)) (and (> t390 0) (< o390 o75)) (and (> t391 0) (< o391 o75)) (and (> t392 0) (< o392 o75)) (and (> t393 0) (< o393 o75)) (and (> t394 0) (< o394 o75)) (and (> t395 0) (< o395 o75)) (and (> t396 0) (< o396 o75)) (and (> t397 0) (< o397 o75)) (and (> t398 0) (< o398 o75)) (and (> t399 0) (< o399 o75)) (and (> t400 0) (< o400 o75)) (and (> t401 0) (< o401 o75)) (and (> t402 0) (< o402 o75)) (and (> t403 0) (< o403 o75)) (and (> t404 0) (< o404 o75)))))") while checking expression at index 0
[2020-05-18 21:22:45] [INFO ] [Real]Absence check using 175 positive place invariants in 12 ms returned unsat
[2020-05-18 21:22:45] [INFO ] [Real]Absence check using 175 positive place invariants in 166 ms returned sat
[2020-05-18 21:22:45] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 25 ms returned unsat
[2020-05-18 21:22:45] [INFO ] [Real]Absence check using 175 positive place invariants in 101 ms returned unsat
[2020-05-18 21:22:46] [INFO ] [Real]Absence check using 175 positive place invariants in 183 ms returned sat
[2020-05-18 21:22:46] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 40 ms returned sat
[2020-05-18 21:22:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:22:50] [INFO ] [Real]Absence check using state equation in 4220 ms returned sat
[2020-05-18 21:22:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:22:50] [INFO ] [Nat]Absence check using 175 positive place invariants in 189 ms returned sat
[2020-05-18 21:22:50] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 49 ms returned sat
[2020-05-18 21:22:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:22:54] [INFO ] [Nat]Absence check using state equation in 4243 ms returned sat
[2020-05-18 21:22:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 98 ms returned sat
[2020-05-18 21:22:55] [INFO ] Deduced a trap composed of 14 places in 305 ms
[2020-05-18 21:22:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s498 s499 s500 s501 s504 s505 s506 s507 s508 s509 s920 s921 s922 s923) 0)") while checking expression at index 4
[2020-05-18 21:22:55] [INFO ] [Real]Absence check using 175 positive place invariants in 78 ms returned unsat
[2020-05-18 21:22:55] [INFO ] [Real]Absence check using 175 positive place invariants in 128 ms returned unsat
[2020-05-18 21:22:56] [INFO ] [Real]Absence check using 175 positive place invariants in 179 ms returned sat
[2020-05-18 21:22:56] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 13 ms returned unsat
[2020-05-18 21:22:56] [INFO ] [Real]Absence check using 175 positive place invariants in 204 ms returned sat
[2020-05-18 21:22:56] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 21 ms returned unsat
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 4 out of 1189 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Ensure Unique test removed 5 places
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 1184 transition count 1610
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 175 place count 1099 transition count 1610
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 175 place count 1099 transition count 1526
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 343 place count 1015 transition count 1526
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 347 place count 1013 transition count 1524
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 348 place count 1013 transition count 1523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 349 place count 1012 transition count 1523
Applied a total of 349 rules in 656 ms. Remains 1012 /1189 variables (removed 177) and now considering 1523/1695 (removed 172) transitions.
[2020-05-18 21:22:57] [INFO ] Flow matrix only has 1519 transitions (discarded 4 similar events)
// Phase 1: matrix 1519 rows 1012 cols
[2020-05-18 21:22:57] [INFO ] Computed 177 place invariants in 165 ms
[2020-05-18 21:23:03] [INFO ] Dead Transitions using invariants and state equation in 6329 ms returned [984, 985, 986, 987, 988, 989, 990, 991, 992, 993, 994, 995, 996, 997, 998, 999, 1000, 1001, 1002, 1003, 1005, 1006, 1007, 1008, 1009, 1010, 1011, 1012, 1013, 1014, 1015, 1016, 1017, 1018, 1019, 1020, 1021, 1022, 1023, 1025, 1026, 1027, 1028, 1029, 1031, 1034, 1035, 1036, 1037, 1038, 1039, 1040, 1041, 1042, 1043, 1044, 1045, 1046, 1047, 1048, 1049, 1050, 1051, 1052, 1053, 1054, 1055, 1056, 1057, 1058, 1060, 1061, 1062, 1063, 1064, 1066, 1069, 1070, 1071, 1072, 1073, 1074, 1076, 1079, 1083, 1084, 1085, 1086, 1087, 1088, 1089, 1091, 1094, 1098, 1103]
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions :[1103, 1098, 1094, 1091, 1089, 1088, 1087, 1086, 1085, 1084, 1083, 1079, 1076, 1074, 1073, 1072, 1071, 1070, 1069, 1066, 1064, 1063, 1062, 1061, 1060, 1058, 1057, 1056, 1055, 1054, 1053, 1052, 1051, 1050, 1049, 1048, 1047, 1046, 1045, 1044, 1043, 1042, 1041, 1040, 1039, 1038, 1037, 1036, 1035, 1034, 1031, 1029, 1028, 1027, 1026, 1025, 1023, 1022, 1021, 1020, 1019, 1018, 1017, 1016, 1015, 1014, 1013, 1012, 1011, 1010, 1009, 1008, 1007, 1006, 1005, 1003, 1002, 1001, 1000, 999, 998, 997, 996, 995, 994, 993, 992, 991, 990, 989, 988, 987, 986, 985, 984]
Starting structural reductions, iteration 1 : 1012/1189 places, 1428/1695 transitions.
Applied a total of 0 rules in 77 ms. Remains 1012 /1012 variables (removed 0) and now considering 1428/1428 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1012/1189 places, 1428/1695 transitions.
Incomplete random walk after 1000000 steps, including 58918 resets, run finished after 5912 ms. (steps per millisecond=169 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 34482 resets, run finished after 2732 ms. (steps per millisecond=366 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 30932 resets, run finished after 2167 ms. (steps per millisecond=461 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 4692180 steps, run timeout after 30001 ms. (steps per millisecond=156 ) properties seen :[0, 0]
Probabilistic random walk after 4692180 steps, saw 1464284 distinct states, run finished after 30001 ms. (steps per millisecond=156 ) properties seen :[0, 0]
[2020-05-18 21:23:44] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2020-05-18 21:23:44] [INFO ] Computed 177 place invariants in 32 ms
[2020-05-18 21:23:44] [INFO ] [Real]Absence check using 170 positive place invariants in 123 ms returned sat
[2020-05-18 21:23:44] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 43 ms returned sat
[2020-05-18 21:23:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:23:47] [INFO ] [Real]Absence check using state equation in 3133 ms returned sat
[2020-05-18 21:23:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:23:48] [INFO ] [Nat]Absence check using 170 positive place invariants in 119 ms returned sat
[2020-05-18 21:23:48] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 38 ms returned sat
[2020-05-18 21:23:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:23:51] [INFO ] [Nat]Absence check using state equation in 3624 ms returned sat
[2020-05-18 21:23:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-18 21:23:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 61 ms returned sat
[2020-05-18 21:23:52] [INFO ] Deduced a trap composed of 402 places in 672 ms
[2020-05-18 21:23:53] [INFO ] Deduced a trap composed of 396 places in 682 ms
[2020-05-18 21:23:54] [INFO ] Deduced a trap composed of 402 places in 645 ms
[2020-05-18 21:23:54] [INFO ] Deduced a trap composed of 412 places in 572 ms
[2020-05-18 21:23:55] [INFO ] Deduced a trap composed of 404 places in 674 ms
[2020-05-18 21:23:56] [INFO ] Deduced a trap composed of 218 places in 718 ms
[2020-05-18 21:23:57] [INFO ] Deduced a trap composed of 394 places in 709 ms
[2020-05-18 21:23:58] [INFO ] Deduced a trap composed of 222 places in 712 ms
[2020-05-18 21:23:59] [INFO ] Deduced a trap composed of 422 places in 702 ms
[2020-05-18 21:24:00] [INFO ] Deduced a trap composed of 400 places in 724 ms
[2020-05-18 21:24:00] [INFO ] Deduced a trap composed of 422 places in 684 ms
[2020-05-18 21:24:02] [INFO ] Deduced a trap composed of 402 places in 637 ms
[2020-05-18 21:24:04] [INFO ] Deduced a trap composed of 402 places in 647 ms
[2020-05-18 21:24:05] [INFO ] Deduced a trap composed of 410 places in 660 ms
[2020-05-18 21:24:06] [INFO ] Deduced a trap composed of 408 places in 671 ms
[2020-05-18 21:24:06] [INFO ] Deduced a trap composed of 390 places in 660 ms
[2020-05-18 21:24:07] [INFO ] Deduced a trap composed of 404 places in 657 ms
[2020-05-18 21:24:08] [INFO ] Deduced a trap composed of 402 places in 654 ms
[2020-05-18 21:24:09] [INFO ] Deduced a trap composed of 398 places in 666 ms
[2020-05-18 21:24:10] [INFO ] Deduced a trap composed of 396 places in 654 ms
[2020-05-18 21:24:10] [INFO ] Deduced a trap composed of 420 places in 673 ms
[2020-05-18 21:24:11] [INFO ] Deduced a trap composed of 388 places in 658 ms
[2020-05-18 21:24:12] [INFO ] Deduced a trap composed of 390 places in 675 ms
[2020-05-18 21:24:13] [INFO ] Deduced a trap composed of 396 places in 687 ms
[2020-05-18 21:24:14] [INFO ] Deduced a trap composed of 408 places in 658 ms
[2020-05-18 21:24:16] [INFO ] Deduced a trap composed of 400 places in 663 ms
[2020-05-18 21:24:18] [INFO ] Deduced a trap composed of 396 places in 642 ms
[2020-05-18 21:24:19] [INFO ] Deduced a trap composed of 410 places in 638 ms
[2020-05-18 21:24:21] [INFO ] Deduced a trap composed of 396 places in 676 ms
[2020-05-18 21:24:22] [INFO ] Deduced a trap composed of 396 places in 654 ms
[2020-05-18 21:24:23] [INFO ] Deduced a trap composed of 398 places in 677 ms
[2020-05-18 21:24:25] [INFO ] Deduced a trap composed of 392 places in 646 ms
[2020-05-18 21:24:26] [INFO ] Deduced a trap composed of 398 places in 651 ms
[2020-05-18 21:24:26] [INFO ] Deduced a trap composed of 408 places in 519 ms
[2020-05-18 21:24:27] [INFO ] Deduced a trap composed of 396 places in 606 ms
[2020-05-18 21:24:28] [INFO ] Deduced a trap composed of 396 places in 652 ms
[2020-05-18 21:24:29] [INFO ] Deduced a trap composed of 396 places in 590 ms
[2020-05-18 21:24:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 21:24:34] [INFO ] Deduced a trap composed of 6 places in 961 ms
[2020-05-18 21:24:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s849 s850 s851 s852 s853 s987) 0)") while checking expression at index 0
[2020-05-18 21:24:34] [INFO ] [Real]Absence check using 170 positive place invariants in 120 ms returned sat
[2020-05-18 21:24:34] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 36 ms returned sat
[2020-05-18 21:24:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:24:37] [INFO ] [Real]Absence check using state equation in 3236 ms returned sat
[2020-05-18 21:24:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:24:37] [INFO ] [Nat]Absence check using 170 positive place invariants in 121 ms returned sat
[2020-05-18 21:24:37] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 37 ms returned sat
[2020-05-18 21:24:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:24:40] [INFO ] [Nat]Absence check using state equation in 2856 ms returned sat
[2020-05-18 21:24:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 32 ms returned sat
[2020-05-18 21:24:40] [INFO ] Computed and/alt/rep : 1422/36681/1418 causal constraints in 119 ms.
[2020-05-18 21:24:45] [INFO ] Added : 74 causal constraints over 15 iterations in 4749 ms. Result :sat
[2020-05-18 21:24:46] [INFO ] Deduced a trap composed of 13 places in 514 ms
[2020-05-18 21:24:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1101 ms
Attempting to minimize the solution found.
Minimization took 94 ms.
Incomplete Parikh walk after 10400 steps, including 873 resets, run finished after 109 ms. (steps per millisecond=95 ) properties seen :[0, 0] could not realise parikh vector
Support contains 4 out of 1012 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1012/1012 places, 1428/1428 transitions.
Applied a total of 0 rules in 41 ms. Remains 1012 /1012 variables (removed 0) and now considering 1428/1428 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1012/1012 places, 1428/1428 transitions.
Starting structural reductions, iteration 0 : 1012/1012 places, 1428/1428 transitions.
Applied a total of 0 rules in 35 ms. Remains 1012 /1012 variables (removed 0) and now considering 1428/1428 (removed 0) transitions.
[2020-05-18 21:24:47] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2020-05-18 21:24:47] [INFO ] Computed 177 place invariants in 32 ms
[2020-05-18 21:24:51] [INFO ] Implicit Places using invariants in 4131 ms returned []
[2020-05-18 21:24:51] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2020-05-18 21:24:51] [INFO ] Computed 177 place invariants in 45 ms
[2020-05-18 21:24:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-18 21:25:06] [INFO ] Implicit Places using invariants and state equation in 15663 ms returned []
Implicit Place search using SMT with State Equation took 19794 ms to find 0 implicit places.
[2020-05-18 21:25:06] [INFO ] Redundant transitions in 97 ms returned []
[2020-05-18 21:25:06] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2020-05-18 21:25:06] [INFO ] Computed 177 place invariants in 31 ms
[2020-05-18 21:25:12] [INFO ] Dead Transitions using invariants and state equation in 5675 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1012/1012 places, 1428/1428 transitions.
Incomplete random walk after 100000 steps, including 5877 resets, run finished after 851 ms. (steps per millisecond=117 ) properties seen :[0, 0]
[2020-05-18 21:25:13] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2020-05-18 21:25:13] [INFO ] Computed 177 place invariants in 80 ms
[2020-05-18 21:25:13] [INFO ] [Real]Absence check using 170 positive place invariants in 124 ms returned sat
[2020-05-18 21:25:13] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 38 ms returned sat
[2020-05-18 21:25:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:25:16] [INFO ] [Real]Absence check using state equation in 3035 ms returned sat
[2020-05-18 21:25:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:25:17] [INFO ] [Nat]Absence check using 170 positive place invariants in 121 ms returned sat
[2020-05-18 21:25:17] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 40 ms returned sat
[2020-05-18 21:25:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:25:21] [INFO ] [Nat]Absence check using state equation in 3979 ms returned sat
[2020-05-18 21:25:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-18 21:25:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 128 ms returned sat
[2020-05-18 21:25:22] [INFO ] Deduced a trap composed of 402 places in 707 ms
[2020-05-18 21:25:22] [INFO ] Deduced a trap composed of 396 places in 672 ms
[2020-05-18 21:25:23] [INFO ] Deduced a trap composed of 402 places in 686 ms
[2020-05-18 21:25:24] [INFO ] Deduced a trap composed of 412 places in 664 ms
[2020-05-18 21:25:25] [INFO ] Deduced a trap composed of 404 places in 663 ms
[2020-05-18 21:25:26] [INFO ] Deduced a trap composed of 218 places in 743 ms
[2020-05-18 21:25:26] [INFO ] Deduced a trap composed of 394 places in 684 ms
[2020-05-18 21:25:27] [INFO ] Deduced a trap composed of 222 places in 714 ms
[2020-05-18 21:25:28] [INFO ] Deduced a trap composed of 422 places in 675 ms
[2020-05-18 21:25:29] [INFO ] Deduced a trap composed of 400 places in 710 ms
[2020-05-18 21:25:30] [INFO ] Deduced a trap composed of 422 places in 669 ms
[2020-05-18 21:25:31] [INFO ] Deduced a trap composed of 402 places in 648 ms
[2020-05-18 21:25:33] [INFO ] Deduced a trap composed of 402 places in 665 ms
[2020-05-18 21:25:33] [INFO ] Deduced a trap composed of 410 places in 651 ms
[2020-05-18 21:25:34] [INFO ] Deduced a trap composed of 408 places in 656 ms
[2020-05-18 21:25:35] [INFO ] Deduced a trap composed of 390 places in 649 ms
[2020-05-18 21:25:36] [INFO ] Deduced a trap composed of 404 places in 643 ms
[2020-05-18 21:25:37] [INFO ] Deduced a trap composed of 402 places in 682 ms
[2020-05-18 21:25:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s84 s87 s89 s90 s92 s93 s95 s96 s99 s104 s107 s108 s113 s115 s116 s117 s118 s121 s124 s126 s127 s130 s134 s135 s142 s144 s146 s147 s155 s156 s157 s159 s163 s165 s168 s170 s171 s173 s174 s176 s177 s180 s185 s188 s189 s194 s196 s197 s198 s199 s202 s205 s207 s208 s211 s215 s216 s223 s225 s227 s228 s236 s237 s238 s240 s244 s249 s252 s254 s255 s257 s258 s260 s261 s264 s269 s272 s273 s278 s280 s281 s282 s283 s286 s289 s291 s292 s295 s299 s300 s307 s309 s311 s312 s320 s321 s322 s324 s328 s330 s333 s335 s336 s338 s339 s341 s342 s345 s350 s353 s354 s359 s361 s362 s363 s364 s367 s370 s372 s373 s376 s380 s381 s388 s390 s392 s393 s401 s402 s403 s405 s409 s414 s417 s419 s420 s422 s423 s425 s426 s429 s434 s437 s438 s443 s445 s446 s447 s448 s451 s454 s456 s457 s460 s464 s465 s472 s474 s476 s477 s485 s486 s487 s489 s493 s497 s509 s511 s513 s514 s516 s518 s524 s526 s528 s539 s541 s543 s554 s556 s558 s569 s571 s573 s574 s576 s578 s584 s586 s588 s589 s591 s593 s594 s596 s598 s599 s601 s603 s609 s611 s613 s614 s616 s618 s629 s631 s633 s634 s636 s638 s639 s641 s643 s644 s646 s648 s654 s656 s658 s679 s681 s683 s684 s686 s688 s694 s696 s698 s699 s701 s703 s709 s711 s713 s724 s726 s728 s729 s731 s733 s739 s741 s743 s744 s746 s748 s749 s751 s753 s764 s766 s768 s769 s771 s773 s774 s776 s778 s779 s781 s783 s784 s786 s788 s789 s791 s793 s799 s801 s803 s809 s811 s813 s824 s826 s828 s829 s831 s833 s834 s836 s838 s839 s841 s843 s844 s846 s848 s849 s851 s853 s854 s856 s858 s874 s876 s878 s884 s886 s888 s889 s891 s893 s894 s896 s898 s904 s906 s908 s909 s911 s913 s916 s917 s1004 s1006 s1007 s1008 s1009) 0)") while checking expression at index 0
[2020-05-18 21:25:37] [INFO ] [Real]Absence check using 170 positive place invariants in 108 ms returned sat
[2020-05-18 21:25:37] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 29 ms returned sat
[2020-05-18 21:25:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:25:40] [INFO ] [Real]Absence check using state equation in 3131 ms returned sat
[2020-05-18 21:25:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:25:40] [INFO ] [Nat]Absence check using 170 positive place invariants in 123 ms returned sat
[2020-05-18 21:25:40] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 39 ms returned sat
[2020-05-18 21:25:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:25:43] [INFO ] [Nat]Absence check using state equation in 2930 ms returned sat
[2020-05-18 21:25:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 24 ms returned sat
[2020-05-18 21:25:43] [INFO ] Computed and/alt/rep : 1422/36681/1418 causal constraints in 97 ms.
[2020-05-18 21:25:48] [INFO ] Added : 74 causal constraints over 15 iterations in 4238 ms. Result :sat
[2020-05-18 21:25:48] [INFO ] Deduced a trap composed of 13 places in 512 ms
[2020-05-18 21:25:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1311 ms
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1012 transition count 1424
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 1012 transition count 1423
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 1011 transition count 1423
Applied a total of 6 rules in 72 ms. Remains 1011 /1012 variables (removed 1) and now considering 1423/1428 (removed 5) transitions.
// Phase 1: matrix 1423 rows 1011 cols
[2020-05-18 21:25:49] [INFO ] Computed 177 place invariants in 44 ms
[2020-05-18 21:25:49] [INFO ] [Real]Absence check using 170 positive place invariants in 112 ms returned sat
[2020-05-18 21:25:49] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 35 ms returned sat
[2020-05-18 21:25:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:25:52] [INFO ] [Real]Absence check using state equation in 2942 ms returned sat
[2020-05-18 21:25:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:25:53] [INFO ] [Nat]Absence check using 170 positive place invariants in 123 ms returned sat
[2020-05-18 21:25:53] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 37 ms returned sat
[2020-05-18 21:25:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:26:01] [INFO ] [Nat]Absence check using state equation in 8001 ms returned sat
[2020-05-18 21:26:01] [INFO ] Deduced a trap composed of 180 places in 470 ms
[2020-05-18 21:26:02] [INFO ] Deduced a trap composed of 180 places in 496 ms
[2020-05-18 21:26:02] [INFO ] Deduced a trap composed of 180 places in 524 ms
[2020-05-18 21:26:03] [INFO ] Deduced a trap composed of 180 places in 632 ms
[2020-05-18 21:26:04] [INFO ] Deduced a trap composed of 180 places in 506 ms
[2020-05-18 21:26:05] [INFO ] Deduced a trap composed of 180 places in 490 ms
[2020-05-18 21:26:05] [INFO ] Deduced a trap composed of 180 places in 497 ms
[2020-05-18 21:26:06] [INFO ] Deduced a trap composed of 180 places in 493 ms
[2020-05-18 21:26:06] [INFO ] Deduced a trap composed of 180 places in 502 ms
[2020-05-18 21:26:07] [INFO ] Deduced a trap composed of 13 places in 500 ms
[2020-05-18 21:26:07] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 6842 ms
[2020-05-18 21:26:08] [INFO ] Computed and/alt/rep : 1417/36671/1417 causal constraints in 148 ms.
[2020-05-18 21:26:28] [INFO ] Added : 340 causal constraints over 68 iterations in 20642 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 297 ms.
[2020-05-18 21:26:29] [INFO ] [Real]Absence check using 170 positive place invariants in 117 ms returned sat
[2020-05-18 21:26:29] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 39 ms returned sat
[2020-05-18 21:26:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 21:26:32] [INFO ] [Real]Absence check using state equation in 3274 ms returned sat
[2020-05-18 21:26:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 21:26:32] [INFO ] [Nat]Absence check using 170 positive place invariants in 121 ms returned sat
[2020-05-18 21:26:32] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 47 ms returned sat
[2020-05-18 21:26:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 21:26:44] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 21:26:47] [INFO ] [Nat]Absence check using state equation in 14147 ms returned unknown
[2020-05-18 21:26:47] [INFO ] Flatten gal took : 199 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-18 21:26:47] [INFO ] Flatten gal took : 169 ms
[2020-05-18 21:26:47] [INFO ] Applying decomposition
[2020-05-18 21:26:48] [INFO ] Flatten gal took : 231 ms
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
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-S05J80"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S05J80, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r126-tajo-158961390600590"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J80.tgz
mv PolyORBNT-COL-S05J80 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;