/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/bakery-4.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-12 00:12:15,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-12 00:12:15,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-12 00:12:15,106 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-12 00:12:15,107 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-12 00:12:15,107 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-12 00:12:15,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-12 00:12:15,110 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-12 00:12:15,111 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-12 00:12:15,111 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-12 00:12:15,112 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-12 00:12:15,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-12 00:12:15,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-12 00:12:15,114 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-12 00:12:15,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-12 00:12:15,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-12 00:12:15,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-12 00:12:15,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-12 00:12:15,117 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-12 00:12:15,118 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-12 00:12:15,119 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-12 00:12:15,124 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-12 00:12:15,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-12 00:12:15,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-12 00:12:15,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-12 00:12:15,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-12 00:12:15,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-12 00:12:15,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-12 00:12:15,128 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-12 00:12:15,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-12 00:12:15,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-12 00:12:15,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-12 00:12:15,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-12 00:12:15,130 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-12 00:12:15,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-12 00:12:15,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-12 00:12:15,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-12 00:12:15,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-12 00:12:15,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-12 00:12:15,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-12 00:12:15,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-12 00:12:15,137 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2021-03-12 00:12:15,162 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-12 00:12:15,162 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-12 00:12:15,163 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-12 00:12:15,163 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-12 00:12:15,164 INFO L138 SettingsManager]: * Use SBE=true [2021-03-12 00:12:15,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-12 00:12:15,164 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-12 00:12:15,164 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-12 00:12:15,164 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-12 00:12:15,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-12 00:12:15,164 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-12 00:12:15,165 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-12 00:12:15,165 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-12 00:12:15,165 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-12 00:12:15,165 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-12 00:12:15,165 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-12 00:12:15,165 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-12 00:12:15,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-12 00:12:15,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-12 00:12:15,166 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-12 00:12:15,166 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-12 00:12:15,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-12 00:12:15,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-12 00:12:15,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-12 00:12:15,166 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-12 00:12:15,166 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-12 00:12:15,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-12 00:12:15,167 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-12 00:12:15,167 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-12 00:12:15,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-12 00:12:15,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-12 00:12:15,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-12 00:12:15,405 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-03-12 00:12:15,406 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-03-12 00:12:15,407 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/bakery-4.wvr.bpl [2021-03-12 00:12:15,407 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/bakery-4.wvr.bpl' [2021-03-12 00:12:15,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-12 00:12:15,461 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-03-12 00:12:15,462 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-12 00:12:15,462 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-12 00:12:15,462 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-12 00:12:15,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bakery-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.03 12:12:15" (1/1) ... [2021-03-12 00:12:15,485 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bakery-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.03 12:12:15" (1/1) ... [2021-03-12 00:12:15,490 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-12 00:12:15,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-12 00:12:15,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-12 00:12:15,491 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-12 00:12:15,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bakery-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.03 12:12:15" (1/1) ... [2021-03-12 00:12:15,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bakery-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.03 12:12:15" (1/1) ... [2021-03-12 00:12:15,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bakery-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.03 12:12:15" (1/1) ... [2021-03-12 00:12:15,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bakery-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.03 12:12:15" (1/1) ... [2021-03-12 00:12:15,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bakery-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.03 12:12:15" (1/1) ... [2021-03-12 00:12:15,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bakery-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.03 12:12:15" (1/1) ... [2021-03-12 00:12:15,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bakery-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.03 12:12:15" (1/1) ... [2021-03-12 00:12:15,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-12 00:12:15,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-12 00:12:15,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-12 00:12:15,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-12 00:12:15,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bakery-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.03 12:12:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-12 00:12:15,569 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-03-12 00:12:15,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-03-12 00:12:15,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-03-12 00:12:15,570 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-03-12 00:12:15,570 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-03-12 00:12:15,570 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-03-12 00:12:15,570 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-03-12 00:12:15,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-12 00:12:15,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-12 00:12:15,570 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-03-12 00:12:15,570 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-03-12 00:12:15,570 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-03-12 00:12:15,573 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2021-03-12 00:12:15,574 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-03-12 00:12:15,574 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-03-12 00:12:15,575 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-12 00:12:15,844 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-12 00:12:15,845 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-03-12 00:12:15,846 INFO L202 PluginConnector]: Adding new model bakery-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 12:12:15 BoogieIcfgContainer [2021-03-12 00:12:15,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-12 00:12:15,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-12 00:12:15,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-12 00:12:15,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-12 00:12:15,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bakery-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.03 12:12:15" (1/2) ... [2021-03-12 00:12:15,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9c72f3 and model type bakery-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 12:12:15, skipping insertion in model container [2021-03-12 00:12:15,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bakery-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 12:12:15" (2/2) ... [2021-03-12 00:12:15,850 INFO L111 eAbstractionObserver]: Analyzing ICFG bakery-4.wvr.bpl [2021-03-12 00:12:15,853 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-12 00:12:15,856 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-12 00:12:15,856 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-12 00:12:15,916 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-03-12 00:12:15,929 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-12 00:12:15,956 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-12 00:12:15,956 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-12 00:12:15,956 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-12 00:12:15,956 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-12 00:12:15,957 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-12 00:12:15,957 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-12 00:12:15,957 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-12 00:12:15,957 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-12 00:12:15,964 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 94 places, 81 transitions, 194 flow [2021-03-12 00:12:15,990 INFO L129 PetriNetUnfolder]: 0/77 cut-off events. [2021-03-12 00:12:15,991 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-12 00:12:15,992 INFO L84 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 77 events. 0/77 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 196 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-12 00:12:15,992 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 81 transitions, 194 flow [2021-03-12 00:12:15,996 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 75 transitions, 174 flow [2021-03-12 00:12:15,999 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-12 00:12:16,007 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 75 transitions, 174 flow [2021-03-12 00:12:16,011 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 75 transitions, 174 flow [2021-03-12 00:12:16,011 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 75 transitions, 174 flow [2021-03-12 00:12:16,046 INFO L129 PetriNetUnfolder]: 0/75 cut-off events. [2021-03-12 00:12:16,046 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-12 00:12:16,046 INFO L84 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 75 events. 0/75 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 194 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-12 00:12:16,049 INFO L116 LiptonReduction]: Number of co-enabled transitions 3456 [2021-03-12 00:12:16,634 INFO L131 LiptonReduction]: Checked pairs total: 9123 [2021-03-12 00:12:16,634 INFO L133 LiptonReduction]: Total number of compositions: 13 [2021-03-12 00:12:16,635 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 638 [2021-03-12 00:12:16,654 INFO L129 PetriNetUnfolder]: 0/61 cut-off events. [2021-03-12 00:12:16,655 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-12 00:12:16,655 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-12 00:12:16,655 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-12 00:12:16,656 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-12 00:12:16,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-12 00:12:16,661 INFO L82 PathProgramCache]: Analyzing trace with hash 427372341, now seen corresponding path program 1 times [2021-03-12 00:12:16,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-12 00:12:16,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519080950] [2021-03-12 00:12:16,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-12 00:12:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-12 00:12:16,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:16,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:16,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:16,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:16,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:16,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:16,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:16,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:16,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:16,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:16,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:16,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:16,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:16,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:16,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:16,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:16,871 INFO L142 QuantifierPusher]: treesize reduction 9, result has 43.8 percent of original size [2021-03-12 00:12:16,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:16,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-12 00:12:16,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519080950] [2021-03-12 00:12:16,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-12 00:12:16,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-12 00:12:16,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561857018] [2021-03-12 00:12:16,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-12 00:12:16,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-12 00:12:16,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-12 00:12:16,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-03-12 00:12:16,897 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 94 [2021-03-12 00:12:16,901 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 62 transitions, 148 flow. Second operand has 11 states, 11 states have (on average 82.9090909090909) internal successors, (912), 11 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:16,901 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-12 00:12:16,901 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 94 [2021-03-12 00:12:16,902 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-12 00:12:17,373 INFO L129 PetriNetUnfolder]: 205/610 cut-off events. [2021-03-12 00:12:17,373 INFO L130 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2021-03-12 00:12:17,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 610 events. 205/610 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4043 event pairs, 35 based on Foata normal form. 1/606 useless extension candidates. Maximal degree in co-relation 1009. Up to 142 conditions per place. [2021-03-12 00:12:17,380 INFO L132 encePairwiseOnDemand]: 84/94 looper letters, 37 selfloop transitions, 25 changer transitions 2/116 dead transitions. [2021-03-12 00:12:17,380 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 116 transitions, 384 flow [2021-03-12 00:12:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-12 00:12:17,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-03-12 00:12:17,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1213 transitions. [2021-03-12 00:12:17,392 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9217325227963525 [2021-03-12 00:12:17,392 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1213 transitions. [2021-03-12 00:12:17,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1213 transitions. [2021-03-12 00:12:17,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-12 00:12:17,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1213 transitions. [2021-03-12 00:12:17,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 86.64285714285714) internal successors, (1213), 14 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:17,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 94.0) internal successors, (1410), 15 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:17,423 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 94.0) internal successors, (1410), 15 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:17,425 INFO L185 Difference]: Start difference. First operand has 75 places, 62 transitions, 148 flow. Second operand 14 states and 1213 transitions. [2021-03-12 00:12:17,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 116 transitions, 384 flow [2021-03-12 00:12:17,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 116 transitions, 368 flow, removed 0 selfloop flow, removed 8 redundant places. [2021-03-12 00:12:17,443 INFO L241 Difference]: Finished difference. Result has 85 places, 91 transitions, 287 flow [2021-03-12 00:12:17,444 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=287, PETRI_PLACES=85, PETRI_TRANSITIONS=91} [2021-03-12 00:12:17,444 INFO L335 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2021-03-12 00:12:17,444 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 91 transitions, 287 flow [2021-03-12 00:12:17,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 82.9090909090909) internal successors, (912), 11 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:17,445 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-12 00:12:17,445 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-12 00:12:17,445 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-12 00:12:17,446 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-12 00:12:17,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-12 00:12:17,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1311210635, now seen corresponding path program 2 times [2021-03-12 00:12:17,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-12 00:12:17,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031444006] [2021-03-12 00:12:17,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-12 00:12:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-12 00:12:17,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:17,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-12 00:12:17,536 INFO L142 QuantifierPusher]: treesize reduction 13, result has 53.6 percent of original size [2021-03-12 00:12:17,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-12 00:12:17,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:17,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-12 00:12:17,550 INFO L142 QuantifierPusher]: treesize reduction 12, result has 36.8 percent of original size [2021-03-12 00:12:17,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:17,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:17,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-12 00:12:17,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:17,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-12 00:12:17,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-12 00:12:17,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031444006] [2021-03-12 00:12:17,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-12 00:12:17,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-12 00:12:17,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225392990] [2021-03-12 00:12:17,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-12 00:12:17,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-12 00:12:17,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-12 00:12:17,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-03-12 00:12:17,571 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 94 [2021-03-12 00:12:17,571 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 91 transitions, 287 flow. Second operand has 7 states, 7 states have (on average 65.57142857142857) internal successors, (459), 7 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:17,572 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-12 00:12:17,572 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 94 [2021-03-12 00:12:17,572 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-12 00:12:18,608 INFO L129 PetriNetUnfolder]: 7054/13590 cut-off events. [2021-03-12 00:12:18,609 INFO L130 PetriNetUnfolder]: For 142/166 co-relation queries the response was YES. [2021-03-12 00:12:18,635 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25762 conditions, 13590 events. 7054/13590 cut-off events. For 142/166 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 119008 event pairs, 3219 based on Foata normal form. 100/13340 useless extension candidates. Maximal degree in co-relation 25740. Up to 4938 conditions per place. [2021-03-12 00:12:18,689 INFO L132 encePairwiseOnDemand]: 88/94 looper letters, 61 selfloop transitions, 7 changer transitions 0/134 dead transitions. [2021-03-12 00:12:18,689 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 134 transitions, 509 flow [2021-03-12 00:12:18,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-12 00:12:18,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-12 00:12:18,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 441 transitions. [2021-03-12 00:12:18,690 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7819148936170213 [2021-03-12 00:12:18,690 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 441 transitions. [2021-03-12 00:12:18,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 441 transitions. [2021-03-12 00:12:18,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-12 00:12:18,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 441 transitions. [2021-03-12 00:12:18,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:18,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:18,693 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:18,693 INFO L185 Difference]: Start difference. First operand has 85 places, 91 transitions, 287 flow. Second operand 6 states and 441 transitions. [2021-03-12 00:12:18,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 134 transitions, 509 flow [2021-03-12 00:12:18,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 134 transitions, 507 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-12 00:12:18,701 INFO L241 Difference]: Finished difference. Result has 90 places, 95 transitions, 321 flow [2021-03-12 00:12:18,702 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=321, PETRI_PLACES=90, PETRI_TRANSITIONS=95} [2021-03-12 00:12:18,702 INFO L335 CegarLoopForPetriNet]: 75 programPoint places, 15 predicate places. [2021-03-12 00:12:18,702 INFO L480 AbstractCegarLoop]: Abstraction has has 90 places, 95 transitions, 321 flow [2021-03-12 00:12:18,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 65.57142857142857) internal successors, (459), 7 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:18,703 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-12 00:12:18,703 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-12 00:12:18,703 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-12 00:12:18,703 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-12 00:12:18,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-12 00:12:18,703 INFO L82 PathProgramCache]: Analyzing trace with hash -369702375, now seen corresponding path program 3 times [2021-03-12 00:12:18,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-12 00:12:18,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546792514] [2021-03-12 00:12:18,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-12 00:12:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-12 00:12:18,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:18,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-12 00:12:18,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:18,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-12 00:12:18,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:18,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-12 00:12:18,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-12 00:12:18,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546792514] [2021-03-12 00:12:18,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-12 00:12:18,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-12 00:12:18,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597274557] [2021-03-12 00:12:18,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-12 00:12:18,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-12 00:12:18,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-12 00:12:18,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-12 00:12:18,755 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 94 [2021-03-12 00:12:18,755 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 95 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:18,755 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-12 00:12:18,755 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 94 [2021-03-12 00:12:18,755 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-12 00:12:18,888 INFO L129 PetriNetUnfolder]: 130/666 cut-off events. [2021-03-12 00:12:18,889 INFO L130 PetriNetUnfolder]: For 61/66 co-relation queries the response was YES. [2021-03-12 00:12:18,890 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 666 events. 130/666 cut-off events. For 61/66 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4855 event pairs, 50 based on Foata normal form. 16/655 useless extension candidates. Maximal degree in co-relation 1135. Up to 88 conditions per place. [2021-03-12 00:12:18,892 INFO L132 encePairwiseOnDemand]: 89/94 looper letters, 4 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2021-03-12 00:12:18,892 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 95 transitions, 335 flow [2021-03-12 00:12:18,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-12 00:12:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-12 00:12:18,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2021-03-12 00:12:18,894 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9361702127659575 [2021-03-12 00:12:18,894 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 264 transitions. [2021-03-12 00:12:18,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 264 transitions. [2021-03-12 00:12:18,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-12 00:12:18,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 264 transitions. [2021-03-12 00:12:18,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:18,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:18,896 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:18,896 INFO L185 Difference]: Start difference. First operand has 90 places, 95 transitions, 321 flow. Second operand 3 states and 264 transitions. [2021-03-12 00:12:18,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 95 transitions, 335 flow [2021-03-12 00:12:18,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 95 transitions, 329 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-12 00:12:18,898 INFO L241 Difference]: Finished difference. Result has 91 places, 95 transitions, 330 flow [2021-03-12 00:12:18,898 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=91, PETRI_TRANSITIONS=95} [2021-03-12 00:12:18,898 INFO L335 CegarLoopForPetriNet]: 75 programPoint places, 16 predicate places. [2021-03-12 00:12:18,898 INFO L480 AbstractCegarLoop]: Abstraction has has 91 places, 95 transitions, 330 flow [2021-03-12 00:12:18,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:18,899 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-12 00:12:18,899 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-12 00:12:18,899 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-12 00:12:18,899 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-12 00:12:18,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-12 00:12:18,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1278840589, now seen corresponding path program 4 times [2021-03-12 00:12:18,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-12 00:12:18,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472313319] [2021-03-12 00:12:18,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-12 00:12:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-12 00:12:18,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:18,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:18,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:18,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:18,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:18,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:18,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:18,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:18,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:18,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:18,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:18,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:19,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:19,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:19,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:19,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:19,021 INFO L142 QuantifierPusher]: treesize reduction 9, result has 43.8 percent of original size [2021-03-12 00:12:19,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:19,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-12 00:12:19,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472313319] [2021-03-12 00:12:19,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-12 00:12:19,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-12 00:12:19,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624292787] [2021-03-12 00:12:19,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-12 00:12:19,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-12 00:12:19,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-12 00:12:19,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-03-12 00:12:19,034 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 94 [2021-03-12 00:12:19,035 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 95 transitions, 330 flow. Second operand has 11 states, 11 states have (on average 82.9090909090909) internal successors, (912), 11 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:19,035 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-12 00:12:19,035 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 94 [2021-03-12 00:12:19,035 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-12 00:12:19,447 INFO L129 PetriNetUnfolder]: 506/2019 cut-off events. [2021-03-12 00:12:19,447 INFO L130 PetriNetUnfolder]: For 606/627 co-relation queries the response was YES. [2021-03-12 00:12:19,453 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4606 conditions, 2019 events. 506/2019 cut-off events. For 606/627 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 18876 event pairs, 130 based on Foata normal form. 13/1972 useless extension candidates. Maximal degree in co-relation 4274. Up to 465 conditions per place. [2021-03-12 00:12:19,457 INFO L132 encePairwiseOnDemand]: 84/94 looper letters, 68 selfloop transitions, 40 changer transitions 2/166 dead transitions. [2021-03-12 00:12:19,461 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 166 transitions, 837 flow [2021-03-12 00:12:19,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-12 00:12:19,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-03-12 00:12:19,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1213 transitions. [2021-03-12 00:12:19,463 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9217325227963525 [2021-03-12 00:12:19,463 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1213 transitions. [2021-03-12 00:12:19,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1213 transitions. [2021-03-12 00:12:19,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-12 00:12:19,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1213 transitions. [2021-03-12 00:12:19,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 86.64285714285714) internal successors, (1213), 14 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:19,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 94.0) internal successors, (1410), 15 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:19,467 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 94.0) internal successors, (1410), 15 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:19,468 INFO L185 Difference]: Start difference. First operand has 91 places, 95 transitions, 330 flow. Second operand 14 states and 1213 transitions. [2021-03-12 00:12:19,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 166 transitions, 837 flow [2021-03-12 00:12:19,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 166 transitions, 831 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-12 00:12:19,474 INFO L241 Difference]: Finished difference. Result has 108 places, 132 transitions, 658 flow [2021-03-12 00:12:19,474 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=658, PETRI_PLACES=108, PETRI_TRANSITIONS=132} [2021-03-12 00:12:19,475 INFO L335 CegarLoopForPetriNet]: 75 programPoint places, 33 predicate places. [2021-03-12 00:12:19,475 INFO L480 AbstractCegarLoop]: Abstraction has has 108 places, 132 transitions, 658 flow [2021-03-12 00:12:19,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 82.9090909090909) internal successors, (912), 11 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:19,475 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-12 00:12:19,475 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-12 00:12:19,475 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-12 00:12:19,475 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-12 00:12:19,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-12 00:12:19,476 INFO L82 PathProgramCache]: Analyzing trace with hash -670223983, now seen corresponding path program 5 times [2021-03-12 00:12:19,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-12 00:12:19,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471429147] [2021-03-12 00:12:19,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-12 00:12:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-12 00:12:19,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:19,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-12 00:12:19,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:19,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-12 00:12:19,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:19,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-12 00:12:19,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:19,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-12 00:12:19,609 INFO L142 QuantifierPusher]: treesize reduction 5, result has 72.2 percent of original size [2021-03-12 00:12:19,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-12 00:12:19,617 INFO L142 QuantifierPusher]: treesize reduction 9, result has 52.6 percent of original size [2021-03-12 00:12:19,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-12 00:12:19,627 INFO L142 QuantifierPusher]: treesize reduction 9, result has 57.1 percent of original size [2021-03-12 00:12:19,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-12 00:12:19,638 INFO L142 QuantifierPusher]: treesize reduction 12, result has 62.5 percent of original size [2021-03-12 00:12:19,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-12 00:12:19,657 INFO L142 QuantifierPusher]: treesize reduction 25, result has 56.9 percent of original size [2021-03-12 00:12:19,658 INFO L147 QuantifierPusher]: treesize reduction 5, result has 84.8 percent of original size 28 [2021-03-12 00:12:19,688 INFO L142 QuantifierPusher]: treesize reduction 34, result has 50.7 percent of original size [2021-03-12 00:12:19,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-12 00:12:19,717 INFO L142 QuantifierPusher]: treesize reduction 28, result has 49.1 percent of original size [2021-03-12 00:12:19,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-12 00:12:19,738 INFO L142 QuantifierPusher]: treesize reduction 28, result has 53.3 percent of original size [2021-03-12 00:12:19,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-12 00:12:19,763 INFO L142 QuantifierPusher]: treesize reduction 28, result has 54.8 percent of original size [2021-03-12 00:12:19,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-12 00:12:19,789 INFO L142 QuantifierPusher]: treesize reduction 28, result has 53.3 percent of original size [2021-03-12 00:12:19,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-12 00:12:19,820 INFO L142 QuantifierPusher]: treesize reduction 30, result has 63.4 percent of original size [2021-03-12 00:12:19,821 INFO L147 QuantifierPusher]: treesize reduction 5, result has 90.4 percent of original size 47 [2021-03-12 00:12:19,861 INFO L142 QuantifierPusher]: treesize reduction 20, result has 65.5 percent of original size [2021-03-12 00:12:19,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-12 00:12:19,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:19,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-12 00:12:19,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-12 00:12:19,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471429147] [2021-03-12 00:12:19,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-12 00:12:19,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-03-12 00:12:19,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927954086] [2021-03-12 00:12:19,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-12 00:12:19,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-12 00:12:19,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-12 00:12:19,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2021-03-12 00:12:19,889 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 94 [2021-03-12 00:12:19,890 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 132 transitions, 658 flow. Second operand has 18 states, 18 states have (on average 49.833333333333336) internal successors, (897), 18 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:19,890 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-12 00:12:19,890 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 94 [2021-03-12 00:12:19,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-12 00:12:28,071 INFO L129 PetriNetUnfolder]: 46461/86276 cut-off events. [2021-03-12 00:12:28,072 INFO L130 PetriNetUnfolder]: For 26867/27145 co-relation queries the response was YES. [2021-03-12 00:12:28,431 INFO L84 FinitePrefix]: Finished finitePrefix Result has 199728 conditions, 86276 events. 46461/86276 cut-off events. For 26867/27145 co-relation queries the response was YES. Maximal size of possible extension queue 2311. Compared 885159 event pairs, 23549 based on Foata normal form. 809/82774 useless extension candidates. Maximal degree in co-relation 199672. Up to 51257 conditions per place. [2021-03-12 00:12:28,708 INFO L132 encePairwiseOnDemand]: 69/94 looper letters, 247 selfloop transitions, 161 changer transitions 0/503 dead transitions. [2021-03-12 00:12:28,708 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 503 transitions, 2409 flow [2021-03-12 00:12:28,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-03-12 00:12:28,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2021-03-12 00:12:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1833 transitions. [2021-03-12 00:12:28,712 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.65 [2021-03-12 00:12:28,712 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 1833 transitions. [2021-03-12 00:12:28,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 1833 transitions. [2021-03-12 00:12:28,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-12 00:12:28,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 1833 transitions. [2021-03-12 00:12:28,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 61.1) internal successors, (1833), 30 states have internal predecessors, (1833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:28,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 94.0) internal successors, (2914), 31 states have internal predecessors, (2914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:28,720 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 94.0) internal successors, (2914), 31 states have internal predecessors, (2914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:28,720 INFO L185 Difference]: Start difference. First operand has 108 places, 132 transitions, 658 flow. Second operand 30 states and 1833 transitions. [2021-03-12 00:12:28,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 503 transitions, 2409 flow [2021-03-12 00:12:30,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 503 transitions, 2377 flow, removed 16 selfloop flow, removed 1 redundant places. [2021-03-12 00:12:30,323 INFO L241 Difference]: Finished difference. Result has 158 places, 310 transitions, 1754 flow [2021-03-12 00:12:30,323 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1754, PETRI_PLACES=158, PETRI_TRANSITIONS=310} [2021-03-12 00:12:30,323 INFO L335 CegarLoopForPetriNet]: 75 programPoint places, 83 predicate places. [2021-03-12 00:12:30,323 INFO L480 AbstractCegarLoop]: Abstraction has has 158 places, 310 transitions, 1754 flow [2021-03-12 00:12:30,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 49.833333333333336) internal successors, (897), 18 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:30,324 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-12 00:12:30,324 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-12 00:12:30,324 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-12 00:12:30,324 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-12 00:12:30,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-12 00:12:30,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1132858975, now seen corresponding path program 6 times [2021-03-12 00:12:30,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-12 00:12:30,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177918989] [2021-03-12 00:12:30,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-12 00:12:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-12 00:12:30,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:30,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-12 00:12:30,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:30,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-12 00:12:30,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:30,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-12 00:12:30,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-12 00:12:30,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177918989] [2021-03-12 00:12:30,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-12 00:12:30,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-12 00:12:30,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875474227] [2021-03-12 00:12:30,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-12 00:12:30,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-12 00:12:30,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-12 00:12:30,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-12 00:12:30,342 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 94 [2021-03-12 00:12:30,342 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 310 transitions, 1754 flow. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:30,342 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-12 00:12:30,342 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 94 [2021-03-12 00:12:30,342 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-12 00:12:30,737 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([235] L60-->thread2EXIT: Formula: (= v_n2_62 0) InVars {} OutVars{n2=v_n2_62} AuxVars[] AssignedVars[n2][118], [Black: 199#(and (<= (+ n2 1) n4) (<= n1 0) (<= 1 n2)), Black: 232#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 202#(and (or (and (<= n3 n2) (or (<= (+ n3 n1 1) n2) (not (= n4 n3))) (= n2 n1)) (<= n2 0)) (not (= n2 0))), Black: 112#(and (<= 0 i4) (<= 1 i) (<= i4 0) (<= i 1)), Black: 234#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 203#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= n3 n1))) (<= n2 0)) (not (= n2 0))), Black: 116#(and (<= 0 i4) (<= 2 i) (<= i 2) (<= 1 i3) (<= i3 1) (<= i4 0)), Black: 100#(and (<= i 0) (<= 0 i)), Black: 236#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 238#(and (<= (+ n3 1) n4) (or (<= n3 n1) (<= n2 0)) (not (= n2 0)) (not (= n3 0))), Black: 122#(and (<= 0 i4) (<= 2 i1) (<= i 3) (<= 1 i3) (<= i3 1) (<= i4 0) (<= i1 2) (<= 3 i)), Black: 207#(and (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 240#(and (<= n1 0) (<= (+ n3 1) n4) (= n4 n2) (<= 1 n2)), Black: 208#(and (<= (+ n3 1) n4) (not (= n3 0))), Black: 244#(and (<= n1 0) (<= (+ n3 1) n4) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 212#(and (<= n1 0) (<= n3 n2) (not (= n4 n3)) (<= 1 n2)), Black: 214#(and (<= n1 0) (= n4 n2) (<= n3 n1) (<= 1 n2)), Black: 246#(and (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 248#(and (or (= n4 n3) (<= (+ n3 1) n4) (<= n3 n1) (<= n2 0)) (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0))), 15#L70true, Black: 216#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (or (not (= n4 n3)) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 218#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (not (= n4 n3)) (<= (+ n3 1) 0) (<= n2 0))), Black: 140#(and (<= 1 n3) (<= n3 n4)), Black: 220#(and (<= n1 0) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (<= 1 n2)), Black: 141#(and (<= 1 n3) (<= (+ n3 1) n4)), Black: 143#(and (<= 1 n3) (<= 0 n4)), 276#e3, Black: 150#e4, 153#true, 98#true, 45#L110true, 53#L28true, 56#thread2EXITtrue, Black: 177#(and (<= i4 1) (<= 2 i2) (<= i2 2) (<= 1 i4) (<= i 3) (<= i1 0) (<= 0 i1) (<= 3 i)), Black: 224#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (or (<= n3 n1) (<= n2 0)) (not (= n2 0))), Black: 167#(and (<= 1 i) (<= i1 0) (<= 0 i1) (<= i 1)), Black: 226#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 155#(and (<= i 0) (<= 0 i)), Black: 194#(and (<= 0 n4) (<= n4 0) (<= n1 n4) (<= n3 0) (<= 0 n2)), Black: 228#(and (<= (+ n2 1) n4) (<= n1 0) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 171#(and (<= i4 1) (<= 2 i) (<= 1 i4) (<= i 2) (<= i1 0) (<= 0 i1)), Black: 197#(and (<= n1 0) (= n4 n2) (<= n3 0) (<= 1 n2)), Black: 156#(and (<= i1 0) (<= 0 i1)), 62#L96true, 191#true, Black: 198#(and (<= n1 0) (= n4 n2) (<= 1 n2))]) [2021-03-12 00:12:30,737 INFO L384 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2021-03-12 00:12:30,737 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-12 00:12:30,737 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-12 00:12:30,737 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-12 00:12:30,754 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([235] L60-->thread2EXIT: Formula: (= v_n2_62 0) InVars {} OutVars{n2=v_n2_62} AuxVars[] AssignedVars[n2][118], [Black: 199#(and (<= (+ n2 1) n4) (<= n1 0) (<= 1 n2)), Black: 232#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 202#(and (or (and (<= n3 n2) (or (<= (+ n3 n1 1) n2) (not (= n4 n3))) (= n2 n1)) (<= n2 0)) (not (= n2 0))), Black: 234#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 112#(and (<= 0 i4) (<= 1 i) (<= i4 0) (<= i 1)), Black: 116#(and (<= 0 i4) (<= 2 i) (<= i 2) (<= 1 i3) (<= i3 1) (<= i4 0)), Black: 203#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= n3 n1))) (<= n2 0)) (not (= n2 0))), Black: 236#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 100#(and (<= i 0) (<= 0 i)), Black: 238#(and (<= (+ n3 1) n4) (or (<= n3 n1) (<= n2 0)) (not (= n2 0)) (not (= n3 0))), Black: 122#(and (<= 0 i4) (<= 2 i1) (<= i 3) (<= 1 i3) (<= i3 1) (<= i4 0) (<= i1 2) (<= 3 i)), Black: 207#(and (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 240#(and (<= n1 0) (<= (+ n3 1) n4) (= n4 n2) (<= 1 n2)), Black: 208#(and (<= (+ n3 1) n4) (not (= n3 0))), Black: 244#(and (<= n1 0) (<= (+ n3 1) n4) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 212#(and (<= n1 0) (<= n3 n2) (not (= n4 n3)) (<= 1 n2)), Black: 214#(and (<= n1 0) (= n4 n2) (<= n3 n1) (<= 1 n2)), Black: 246#(and (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 248#(and (or (= n4 n3) (<= (+ n3 1) n4) (<= n3 n1) (<= n2 0)) (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0))), Black: 216#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (or (not (= n4 n3)) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), 143#(and (<= 1 n3) (<= 0 n4)), Black: 218#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (not (= n4 n3)) (<= (+ n3 1) 0) (<= n2 0))), Black: 140#(and (<= 1 n3) (<= n3 n4)), Black: 220#(and (<= n1 0) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (<= 1 n2)), Black: 141#(and (<= 1 n3) (<= (+ n3 1) n4)), 274#true, Black: 150#e4, 153#true, 33#L72true, 98#true, 45#L110true, 53#L28true, 56#thread2EXITtrue, Black: 177#(and (<= i4 1) (<= 2 i2) (<= i2 2) (<= 1 i4) (<= i 3) (<= i1 0) (<= 0 i1) (<= 3 i)), Black: 224#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (or (<= n3 n1) (<= n2 0)) (not (= n2 0))), Black: 167#(and (<= 1 i) (<= i1 0) (<= 0 i1) (<= i 1)), Black: 226#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 155#(and (<= i 0) (<= 0 i)), Black: 194#(and (<= 0 n4) (<= n4 0) (<= n1 n4) (<= n3 0) (<= 0 n2)), Black: 228#(and (<= (+ n2 1) n4) (<= n1 0) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 171#(and (<= i4 1) (<= 2 i) (<= 1 i4) (<= i 2) (<= i1 0) (<= 0 i1)), Black: 197#(and (<= n1 0) (= n4 n2) (<= n3 0) (<= 1 n2)), Black: 156#(and (<= i1 0) (<= 0 i1)), 62#L96true, Black: 198#(and (<= n1 0) (= n4 n2) (<= 1 n2)), 191#true]) [2021-03-12 00:12:30,754 INFO L384 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2021-03-12 00:12:30,754 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2021-03-12 00:12:30,754 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2021-03-12 00:12:30,754 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2021-03-12 00:12:30,816 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([235] L60-->thread2EXIT: Formula: (= v_n2_62 0) InVars {} OutVars{n2=v_n2_62} AuxVars[] AssignedVars[n2][118], [Black: 199#(and (<= (+ n2 1) n4) (<= n1 0) (<= 1 n2)), Black: 232#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 202#(and (or (and (<= n3 n2) (or (<= (+ n3 n1 1) n2) (not (= n4 n3))) (= n2 n1)) (<= n2 0)) (not (= n2 0))), Black: 112#(and (<= 0 i4) (<= 1 i) (<= i4 0) (<= i 1)), Black: 234#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 203#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= n3 n1))) (<= n2 0)) (not (= n2 0))), Black: 116#(and (<= 0 i4) (<= 2 i) (<= i 2) (<= 1 i3) (<= i3 1) (<= i4 0)), Black: 100#(and (<= i 0) (<= 0 i)), Black: 236#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 238#(and (<= (+ n3 1) n4) (or (<= n3 n1) (<= n2 0)) (not (= n2 0)) (not (= n3 0))), Black: 122#(and (<= 0 i4) (<= 2 i1) (<= i 3) (<= 1 i3) (<= i3 1) (<= i4 0) (<= i1 2) (<= 3 i)), Black: 207#(and (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 240#(and (<= n1 0) (<= (+ n3 1) n4) (= n4 n2) (<= 1 n2)), Black: 208#(and (<= (+ n3 1) n4) (not (= n3 0))), Black: 244#(and (<= n1 0) (<= (+ n3 1) n4) (<= n3 n2) (<= 1 n2) (not (= n3 0))), 10#L30true, Black: 212#(and (<= n1 0) (<= n3 n2) (not (= n4 n3)) (<= 1 n2)), Black: 214#(and (<= n1 0) (= n4 n2) (<= n3 n1) (<= 1 n2)), Black: 246#(and (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 248#(and (or (= n4 n3) (<= (+ n3 1) n4) (<= n3 n1) (<= n2 0)) (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0))), 15#L70true, Black: 216#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (or (not (= n4 n3)) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 218#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (not (= n4 n3)) (<= (+ n3 1) 0) (<= n2 0))), Black: 140#(and (<= 1 n3) (<= n3 n4)), Black: 220#(and (<= n1 0) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (<= 1 n2)), Black: 141#(and (<= 1 n3) (<= (+ n3 1) n4)), Black: 143#(and (<= 1 n3) (<= 0 n4)), 276#e3, Black: 150#e4, 153#true, 98#true, 45#L110true, 56#thread2EXITtrue, Black: 177#(and (<= i4 1) (<= 2 i2) (<= i2 2) (<= 1 i4) (<= i 3) (<= i1 0) (<= 0 i1) (<= 3 i)), Black: 224#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (or (<= n3 n1) (<= n2 0)) (not (= n2 0))), Black: 167#(and (<= 1 i) (<= i1 0) (<= 0 i1) (<= i 1)), Black: 226#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 155#(and (<= i 0) (<= 0 i)), Black: 194#(and (<= 0 n4) (<= n4 0) (<= n1 n4) (<= n3 0) (<= 0 n2)), Black: 228#(and (<= (+ n2 1) n4) (<= n1 0) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 171#(and (<= i4 1) (<= 2 i) (<= 1 i4) (<= i 2) (<= i1 0) (<= 0 i1)), Black: 197#(and (<= n1 0) (= n4 n2) (<= n3 0) (<= 1 n2)), Black: 156#(and (<= i1 0) (<= 0 i1)), 62#L96true, Black: 198#(and (<= n1 0) (= n4 n2) (<= 1 n2)), 191#true]) [2021-03-12 00:12:30,816 INFO L384 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2021-03-12 00:12:30,817 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-12 00:12:30,817 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-12 00:12:30,817 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-12 00:12:30,832 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([235] L60-->thread2EXIT: Formula: (= v_n2_62 0) InVars {} OutVars{n2=v_n2_62} AuxVars[] AssignedVars[n2][118], [Black: 199#(and (<= (+ n2 1) n4) (<= n1 0) (<= 1 n2)), Black: 232#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 202#(and (or (and (<= n3 n2) (or (<= (+ n3 n1 1) n2) (not (= n4 n3))) (= n2 n1)) (<= n2 0)) (not (= n2 0))), Black: 234#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 112#(and (<= 0 i4) (<= 1 i) (<= i4 0) (<= i 1)), Black: 116#(and (<= 0 i4) (<= 2 i) (<= i 2) (<= 1 i3) (<= i3 1) (<= i4 0)), Black: 203#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= n3 n1))) (<= n2 0)) (not (= n2 0))), Black: 100#(and (<= i 0) (<= 0 i)), Black: 236#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 238#(and (<= (+ n3 1) n4) (or (<= n3 n1) (<= n2 0)) (not (= n2 0)) (not (= n3 0))), Black: 122#(and (<= 0 i4) (<= 2 i1) (<= i 3) (<= 1 i3) (<= i3 1) (<= i4 0) (<= i1 2) (<= 3 i)), Black: 207#(and (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 240#(and (<= n1 0) (<= (+ n3 1) n4) (= n4 n2) (<= 1 n2)), Black: 208#(and (<= (+ n3 1) n4) (not (= n3 0))), Black: 244#(and (<= n1 0) (<= (+ n3 1) n4) (<= n3 n2) (<= 1 n2) (not (= n3 0))), 10#L30true, Black: 212#(and (<= n1 0) (<= n3 n2) (not (= n4 n3)) (<= 1 n2)), Black: 214#(and (<= n1 0) (= n4 n2) (<= n3 n1) (<= 1 n2)), Black: 246#(and (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 248#(and (or (= n4 n3) (<= (+ n3 1) n4) (<= n3 n1) (<= n2 0)) (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0))), Black: 216#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (or (not (= n4 n3)) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), 143#(and (<= 1 n3) (<= 0 n4)), Black: 218#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (not (= n4 n3)) (<= (+ n3 1) 0) (<= n2 0))), Black: 140#(and (<= 1 n3) (<= n3 n4)), Black: 220#(and (<= n1 0) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (<= 1 n2)), 274#true, Black: 141#(and (<= 1 n3) (<= (+ n3 1) n4)), Black: 150#e4, 153#true, 33#L72true, 98#true, 45#L110true, 56#thread2EXITtrue, Black: 177#(and (<= i4 1) (<= 2 i2) (<= i2 2) (<= 1 i4) (<= i 3) (<= i1 0) (<= 0 i1) (<= 3 i)), Black: 224#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (or (<= n3 n1) (<= n2 0)) (not (= n2 0))), Black: 167#(and (<= 1 i) (<= i1 0) (<= 0 i1) (<= i 1)), Black: 226#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 155#(and (<= i 0) (<= 0 i)), Black: 194#(and (<= 0 n4) (<= n4 0) (<= n1 n4) (<= n3 0) (<= 0 n2)), Black: 228#(and (<= (+ n2 1) n4) (<= n1 0) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 171#(and (<= i4 1) (<= 2 i) (<= 1 i4) (<= i 2) (<= i1 0) (<= 0 i1)), Black: 197#(and (<= n1 0) (= n4 n2) (<= n3 0) (<= 1 n2)), Black: 156#(and (<= i1 0) (<= 0 i1)), 62#L96true, Black: 198#(and (<= n1 0) (= n4 n2) (<= 1 n2)), 191#true]) [2021-03-12 00:12:30,833 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2021-03-12 00:12:30,833 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-12 00:12:30,833 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-12 00:12:30,833 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-12 00:12:30,921 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([235] L60-->thread2EXIT: Formula: (= v_n2_62 0) InVars {} OutVars{n2=v_n2_62} AuxVars[] AssignedVars[n2][118], [Black: 199#(and (<= (+ n2 1) n4) (<= n1 0) (<= 1 n2)), Black: 232#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 202#(and (or (and (<= n3 n2) (or (<= (+ n3 n1 1) n2) (not (= n4 n3))) (= n2 n1)) (<= n2 0)) (not (= n2 0))), Black: 112#(and (<= 0 i4) (<= 1 i) (<= i4 0) (<= i 1)), Black: 234#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), 67#L35true, Black: 203#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= n3 n1))) (<= n2 0)) (not (= n2 0))), Black: 116#(and (<= 0 i4) (<= 2 i) (<= i 2) (<= 1 i3) (<= i3 1) (<= i4 0)), Black: 236#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 100#(and (<= i 0) (<= 0 i)), Black: 238#(and (<= (+ n3 1) n4) (or (<= n3 n1) (<= n2 0)) (not (= n2 0)) (not (= n3 0))), Black: 122#(and (<= 0 i4) (<= 2 i1) (<= i 3) (<= 1 i3) (<= i3 1) (<= i4 0) (<= i1 2) (<= 3 i)), Black: 207#(and (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 240#(and (<= n1 0) (<= (+ n3 1) n4) (= n4 n2) (<= 1 n2)), Black: 208#(and (<= (+ n3 1) n4) (not (= n3 0))), Black: 244#(and (<= n1 0) (<= (+ n3 1) n4) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 212#(and (<= n1 0) (<= n3 n2) (not (= n4 n3)) (<= 1 n2)), Black: 214#(and (<= n1 0) (= n4 n2) (<= n3 n1) (<= 1 n2)), Black: 246#(and (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 248#(and (or (= n4 n3) (<= (+ n3 1) n4) (<= n3 n1) (<= n2 0)) (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0))), Black: 216#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (or (not (= n4 n3)) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 218#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (not (= n4 n3)) (<= (+ n3 1) 0) (<= n2 0))), Black: 220#(and (<= n1 0) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (<= 1 n2)), Black: 140#(and (<= 1 n3) (<= n3 n4)), Black: 141#(and (<= 1 n3) (<= (+ n3 1) n4)), Black: 143#(and (<= 1 n3) (<= 0 n4)), 276#e3, Black: 150#e4, 153#true, 98#true, 39#L69true, 45#L110true, 56#thread2EXITtrue, Black: 177#(and (<= i4 1) (<= 2 i2) (<= i2 2) (<= 1 i4) (<= i 3) (<= i1 0) (<= 0 i1) (<= 3 i)), Black: 167#(and (<= 1 i) (<= i1 0) (<= 0 i1) (<= i 1)), Black: 224#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (or (<= n3 n1) (<= n2 0)) (not (= n2 0))), Black: 226#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 194#(and (<= 0 n4) (<= n4 0) (<= n1 n4) (<= n3 0) (<= 0 n2)), Black: 155#(and (<= i 0) (<= 0 i)), Black: 228#(and (<= (+ n2 1) n4) (<= n1 0) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 171#(and (<= i4 1) (<= 2 i) (<= 1 i4) (<= i 2) (<= i1 0) (<= 0 i1)), Black: 156#(and (<= i1 0) (<= 0 i1)), Black: 197#(and (<= n1 0) (= n4 n2) (<= n3 0) (<= 1 n2)), 62#L96true, 191#true, Black: 198#(and (<= n1 0) (= n4 n2) (<= 1 n2))]) [2021-03-12 00:12:30,921 INFO L384 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2021-03-12 00:12:30,921 INFO L387 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2021-03-12 00:12:30,921 INFO L387 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2021-03-12 00:12:30,921 INFO L387 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2021-03-12 00:12:30,969 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([235] L60-->thread2EXIT: Formula: (= v_n2_62 0) InVars {} OutVars{n2=v_n2_62} AuxVars[] AssignedVars[n2][118], [Black: 199#(and (<= (+ n2 1) n4) (<= n1 0) (<= 1 n2)), Black: 232#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 202#(and (or (and (<= n3 n2) (or (<= (+ n3 n1 1) n2) (not (= n4 n3))) (= n2 n1)) (<= n2 0)) (not (= n2 0))), Black: 234#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 112#(and (<= 0 i4) (<= 1 i) (<= i4 0) (<= i 1)), 67#L35true, Black: 203#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= n3 n1))) (<= n2 0)) (not (= n2 0))), Black: 116#(and (<= 0 i4) (<= 2 i) (<= i 2) (<= 1 i3) (<= i3 1) (<= i4 0)), Black: 236#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 100#(and (<= i 0) (<= 0 i)), Black: 238#(and (<= (+ n3 1) n4) (or (<= n3 n1) (<= n2 0)) (not (= n2 0)) (not (= n3 0))), Black: 122#(and (<= 0 i4) (<= 2 i1) (<= i 3) (<= 1 i3) (<= i3 1) (<= i4 0) (<= i1 2) (<= 3 i)), Black: 207#(and (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 240#(and (<= n1 0) (<= (+ n3 1) n4) (= n4 n2) (<= 1 n2)), Black: 208#(and (<= (+ n3 1) n4) (not (= n3 0))), Black: 244#(and (<= n1 0) (<= (+ n3 1) n4) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 212#(and (<= n1 0) (<= n3 n2) (not (= n4 n3)) (<= 1 n2)), Black: 214#(and (<= n1 0) (= n4 n2) (<= n3 n1) (<= 1 n2)), Black: 246#(and (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 248#(and (or (= n4 n3) (<= (+ n3 1) n4) (<= n3 n1) (<= n2 0)) (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0))), Black: 216#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (or (not (= n4 n3)) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 218#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (not (= n4 n3)) (<= (+ n3 1) 0) (<= n2 0))), 80#L97true, Black: 220#(and (<= n1 0) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (<= 1 n2)), Black: 140#(and (<= 1 n3) (<= n3 n4)), Black: 141#(and (<= 1 n3) (<= (+ n3 1) n4)), Black: 143#(and (<= 1 n3) (<= 0 n4)), 276#e3, Black: 150#e4, 153#true, 98#true, 39#L69true, 45#L110true, 56#thread2EXITtrue, Black: 177#(and (<= i4 1) (<= 2 i2) (<= i2 2) (<= 1 i4) (<= i 3) (<= i1 0) (<= 0 i1) (<= 3 i)), Black: 224#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (or (<= n3 n1) (<= n2 0)) (not (= n2 0))), Black: 167#(and (<= 1 i) (<= i1 0) (<= 0 i1) (<= i 1)), Black: 226#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 194#(and (<= 0 n4) (<= n4 0) (<= n1 n4) (<= n3 0) (<= 0 n2)), Black: 155#(and (<= i 0) (<= 0 i)), Black: 228#(and (<= (+ n2 1) n4) (<= n1 0) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 171#(and (<= i4 1) (<= 2 i) (<= 1 i4) (<= i 2) (<= i1 0) (<= 0 i1)), Black: 156#(and (<= i1 0) (<= 0 i1)), Black: 197#(and (<= n1 0) (= n4 n2) (<= n3 0) (<= 1 n2)), 191#true, Black: 198#(and (<= n1 0) (= n4 n2) (<= 1 n2))]) [2021-03-12 00:12:30,970 INFO L384 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2021-03-12 00:12:30,970 INFO L387 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2021-03-12 00:12:30,970 INFO L387 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2021-03-12 00:12:30,970 INFO L387 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2021-03-12 00:12:31,011 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([235] L60-->thread2EXIT: Formula: (= v_n2_62 0) InVars {} OutVars{n2=v_n2_62} AuxVars[] AssignedVars[n2][118], [Black: 199#(and (<= (+ n2 1) n4) (<= n1 0) (<= 1 n2)), Black: 232#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 202#(and (or (and (<= n3 n2) (or (<= (+ n3 n1 1) n2) (not (= n4 n3))) (= n2 n1)) (<= n2 0)) (not (= n2 0))), Black: 112#(and (<= 0 i4) (<= 1 i) (<= i4 0) (<= i 1)), Black: 234#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), 67#L35true, Black: 203#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= n3 n1))) (<= n2 0)) (not (= n2 0))), Black: 116#(and (<= 0 i4) (<= 2 i) (<= i 2) (<= 1 i3) (<= i3 1) (<= i4 0)), Black: 236#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 100#(and (<= i 0) (<= 0 i)), Black: 238#(and (<= (+ n3 1) n4) (or (<= n3 n1) (<= n2 0)) (not (= n2 0)) (not (= n3 0))), Black: 122#(and (<= 0 i4) (<= 2 i1) (<= i 3) (<= 1 i3) (<= i3 1) (<= i4 0) (<= i1 2) (<= 3 i)), Black: 207#(and (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 240#(and (<= n1 0) (<= (+ n3 1) n4) (= n4 n2) (<= 1 n2)), Black: 208#(and (<= (+ n3 1) n4) (not (= n3 0))), Black: 244#(and (<= n1 0) (<= (+ n3 1) n4) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 212#(and (<= n1 0) (<= n3 n2) (not (= n4 n3)) (<= 1 n2)), Black: 214#(and (<= n1 0) (= n4 n2) (<= n3 n1) (<= 1 n2)), Black: 246#(and (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 248#(and (or (= n4 n3) (<= (+ n3 1) n4) (<= n3 n1) (<= n2 0)) (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0))), 15#L70true, Black: 216#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (or (not (= n4 n3)) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 218#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (not (= n4 n3)) (<= (+ n3 1) 0) (<= n2 0))), Black: 220#(and (<= n1 0) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (<= 1 n2)), Black: 140#(and (<= 1 n3) (<= n3 n4)), Black: 141#(and (<= 1 n3) (<= (+ n3 1) n4)), Black: 143#(and (<= 1 n3) (<= 0 n4)), 276#e3, Black: 150#e4, 153#true, 98#true, 45#L110true, 56#thread2EXITtrue, Black: 177#(and (<= i4 1) (<= 2 i2) (<= i2 2) (<= 1 i4) (<= i 3) (<= i1 0) (<= 0 i1) (<= 3 i)), Black: 167#(and (<= 1 i) (<= i1 0) (<= 0 i1) (<= i 1)), Black: 224#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (or (<= n3 n1) (<= n2 0)) (not (= n2 0))), Black: 226#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 194#(and (<= 0 n4) (<= n4 0) (<= n1 n4) (<= n3 0) (<= 0 n2)), Black: 155#(and (<= i 0) (<= 0 i)), Black: 228#(and (<= (+ n2 1) n4) (<= n1 0) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 171#(and (<= i4 1) (<= 2 i) (<= 1 i4) (<= i 2) (<= i1 0) (<= 0 i1)), Black: 156#(and (<= i1 0) (<= 0 i1)), Black: 197#(and (<= n1 0) (= n4 n2) (<= n3 0) (<= 1 n2)), 62#L96true, 191#true, Black: 198#(and (<= n1 0) (= n4 n2) (<= 1 n2))]) [2021-03-12 00:12:31,012 INFO L384 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2021-03-12 00:12:31,012 INFO L387 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2021-03-12 00:12:31,012 INFO L387 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2021-03-12 00:12:31,012 INFO L387 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2021-03-12 00:12:31,050 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([188] L68-->L69: Formula: (= v_n3_8 (ite (< v_n3_9 v_n2_16) v_n2_16 v_n3_9)) InVars {n2=v_n2_16, n3=v_n3_9} OutVars{n2=v_n2_16, n3=v_n3_8} AuxVars[] AssignedVars[n3][13], [Black: 199#(and (<= (+ n2 1) n4) (<= n1 0) (<= 1 n2)), Black: 232#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 202#(and (or (and (<= n3 n2) (or (<= (+ n3 n1 1) n2) (not (= n4 n3))) (= n2 n1)) (<= n2 0)) (not (= n2 0))), 67#L35true, Black: 112#(and (<= 0 i4) (<= 1 i) (<= i4 0) (<= i 1)), Black: 234#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 116#(and (<= 0 i4) (<= 2 i) (<= i 2) (<= 1 i3) (<= i3 1) (<= i4 0)), Black: 203#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= n3 n1))) (<= n2 0)) (not (= n2 0))), Black: 236#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 100#(and (<= i 0) (<= 0 i)), Black: 122#(and (<= 0 i4) (<= 2 i1) (<= i 3) (<= 1 i3) (<= i3 1) (<= i4 0) (<= i1 2) (<= 3 i)), Black: 238#(and (<= (+ n3 1) n4) (or (<= n3 n1) (<= n2 0)) (not (= n2 0)) (not (= n3 0))), Black: 207#(and (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 240#(and (<= n1 0) (<= (+ n3 1) n4) (= n4 n2) (<= 1 n2)), Black: 208#(and (<= (+ n3 1) n4) (not (= n3 0))), Black: 244#(and (<= n1 0) (<= (+ n3 1) n4) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 212#(and (<= n1 0) (<= n3 n2) (not (= n4 n3)) (<= 1 n2)), Black: 214#(and (<= n1 0) (= n4 n2) (<= n3 n1) (<= 1 n2)), Black: 246#(and (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 248#(and (or (= n4 n3) (<= (+ n3 1) n4) (<= n3 n1) (<= n2 0)) (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0))), Black: 216#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (or (not (= n4 n3)) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 218#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (not (= n4 n3)) (<= (+ n3 1) 0) (<= n2 0))), Black: 220#(and (<= n1 0) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (<= 1 n2)), Black: 140#(and (<= 1 n3) (<= n3 n4)), Black: 141#(and (<= 1 n3) (<= (+ n3 1) n4)), Black: 143#(and (<= 1 n3) (<= 0 n4)), 276#e3, Black: 150#e4, 153#true, 98#true, 39#L69true, 45#L110true, 56#thread2EXITtrue, Black: 177#(and (<= i4 1) (<= 2 i2) (<= i2 2) (<= 1 i4) (<= i 3) (<= i1 0) (<= 0 i1) (<= 3 i)), Black: 224#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (or (<= n3 n1) (<= n2 0)) (not (= n2 0))), Black: 167#(and (<= 1 i) (<= i1 0) (<= 0 i1) (<= i 1)), Black: 226#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 194#(and (<= 0 n4) (<= n4 0) (<= n1 n4) (<= n3 0) (<= 0 n2)), Black: 155#(and (<= i 0) (<= 0 i)), Black: 171#(and (<= i4 1) (<= 2 i) (<= 1 i4) (<= i 2) (<= i1 0) (<= 0 i1)), Black: 228#(and (<= (+ n2 1) n4) (<= n1 0) (<= n3 n2) (<= 1 n2) (not (= n3 0))), 62#L96true, Black: 156#(and (<= i1 0) (<= 0 i1)), Black: 197#(and (<= n1 0) (= n4 n2) (<= n3 0) (<= 1 n2)), Black: 198#(and (<= n1 0) (= n4 n2) (<= 1 n2)), 191#true]) [2021-03-12 00:12:31,050 INFO L384 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2021-03-12 00:12:31,050 INFO L387 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2021-03-12 00:12:31,050 INFO L387 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2021-03-12 00:12:31,050 INFO L387 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2021-03-12 00:12:31,126 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([235] L60-->thread2EXIT: Formula: (= v_n2_62 0) InVars {} OutVars{n2=v_n2_62} AuxVars[] AssignedVars[n2][118], [Black: 199#(and (<= (+ n2 1) n4) (<= n1 0) (<= 1 n2)), Black: 232#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 202#(and (or (and (<= n3 n2) (or (<= (+ n3 n1 1) n2) (not (= n4 n3))) (= n2 n1)) (<= n2 0)) (not (= n2 0))), Black: 234#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 112#(and (<= 0 i4) (<= 1 i) (<= i4 0) (<= i 1)), 67#L35true, Black: 203#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= n3 n1))) (<= n2 0)) (not (= n2 0))), Black: 116#(and (<= 0 i4) (<= 2 i) (<= i 2) (<= 1 i3) (<= i3 1) (<= i4 0)), Black: 236#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 100#(and (<= i 0) (<= 0 i)), Black: 238#(and (<= (+ n3 1) n4) (or (<= n3 n1) (<= n2 0)) (not (= n2 0)) (not (= n3 0))), Black: 122#(and (<= 0 i4) (<= 2 i1) (<= i 3) (<= 1 i3) (<= i3 1) (<= i4 0) (<= i1 2) (<= 3 i)), Black: 207#(and (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 240#(and (<= n1 0) (<= (+ n3 1) n4) (= n4 n2) (<= 1 n2)), Black: 208#(and (<= (+ n3 1) n4) (not (= n3 0))), Black: 244#(and (<= n1 0) (<= (+ n3 1) n4) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 212#(and (<= n1 0) (<= n3 n2) (not (= n4 n3)) (<= 1 n2)), Black: 214#(and (<= n1 0) (= n4 n2) (<= n3 n1) (<= 1 n2)), Black: 246#(and (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 248#(and (or (= n4 n3) (<= (+ n3 1) n4) (<= n3 n1) (<= n2 0)) (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0))), Black: 216#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (or (not (= n4 n3)) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), 15#L70true, Black: 218#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (not (= n4 n3)) (<= (+ n3 1) 0) (<= n2 0))), 80#L97true, Black: 220#(and (<= n1 0) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (<= 1 n2)), Black: 140#(and (<= 1 n3) (<= n3 n4)), Black: 141#(and (<= 1 n3) (<= (+ n3 1) n4)), Black: 143#(and (<= 1 n3) (<= 0 n4)), 276#e3, Black: 150#e4, 153#true, 98#true, 45#L110true, 56#thread2EXITtrue, Black: 177#(and (<= i4 1) (<= 2 i2) (<= i2 2) (<= 1 i4) (<= i 3) (<= i1 0) (<= 0 i1) (<= 3 i)), Black: 224#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (or (<= n3 n1) (<= n2 0)) (not (= n2 0))), Black: 167#(and (<= 1 i) (<= i1 0) (<= 0 i1) (<= i 1)), Black: 226#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 194#(and (<= 0 n4) (<= n4 0) (<= n1 n4) (<= n3 0) (<= 0 n2)), Black: 155#(and (<= i 0) (<= 0 i)), Black: 228#(and (<= (+ n2 1) n4) (<= n1 0) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 171#(and (<= i4 1) (<= 2 i) (<= 1 i4) (<= i 2) (<= i1 0) (<= 0 i1)), Black: 156#(and (<= i1 0) (<= 0 i1)), Black: 197#(and (<= n1 0) (= n4 n2) (<= n3 0) (<= 1 n2)), 191#true, Black: 198#(and (<= n1 0) (= n4 n2) (<= 1 n2))]) [2021-03-12 00:12:31,127 INFO L384 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2021-03-12 00:12:31,127 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2021-03-12 00:12:31,127 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2021-03-12 00:12:31,127 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2021-03-12 00:12:32,062 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([213] L97-->L98: Formula: (or (= v_n3_19 0) (and (not (< v_n3_19 v_n4_14)) (not (= v_n3_19 v_n4_14)))) InVars {n3=v_n3_19, n4=v_n4_14} OutVars{n3=v_n3_19, n4=v_n4_14} AuxVars[] AssignedVars[][95], [Black: 199#(and (<= (+ n2 1) n4) (<= n1 0) (<= 1 n2)), Black: 232#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 202#(and (or (and (<= n3 n2) (or (<= (+ n3 n1 1) n2) (not (= n4 n3))) (= n2 n1)) (<= n2 0)) (not (= n2 0))), Black: 234#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 112#(and (<= 0 i4) (<= 1 i) (<= i4 0) (<= i 1)), Black: 116#(and (<= 0 i4) (<= 2 i) (<= i 2) (<= 1 i3) (<= i3 1) (<= i4 0)), Black: 203#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= n3 n1))) (<= n2 0)) (not (= n2 0))), Black: 236#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), 69#L56true, Black: 100#(and (<= i 0) (<= 0 i)), Black: 238#(and (<= (+ n3 1) n4) (or (<= n3 n1) (<= n2 0)) (not (= n2 0)) (not (= n3 0))), Black: 122#(and (<= 0 i4) (<= 2 i1) (<= i 3) (<= 1 i3) (<= i3 1) (<= i4 0) (<= i1 2) (<= 3 i)), Black: 207#(and (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 240#(and (<= n1 0) (<= (+ n3 1) n4) (= n4 n2) (<= 1 n2)), 72#thread3EXITtrue, Black: 208#(and (<= (+ n3 1) n4) (not (= n3 0))), Black: 244#(and (<= n1 0) (<= (+ n3 1) n4) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 212#(and (<= n1 0) (<= n3 n2) (not (= n4 n3)) (<= 1 n2)), Black: 214#(and (<= n1 0) (= n4 n2) (<= n3 n1) (<= 1 n2)), 12#thread1EXITtrue, Black: 246#(and (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 248#(and (or (= n4 n3) (<= (+ n3 1) n4) (<= n3 n1) (<= n2 0)) (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0))), Black: 216#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (or (not (= n4 n3)) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 218#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (not (= n4 n3)) (<= (+ n3 1) 0) (<= n2 0))), Black: 140#(and (<= 1 n3) (<= n3 n4)), Black: 220#(and (<= n1 0) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (<= 1 n2)), Black: 141#(and (<= 1 n3) (<= (+ n3 1) n4)), 274#true, Black: 143#(and (<= 1 n3) (<= 0 n4)), 22#L98true, Black: 150#e4, 153#true, 98#true, 45#L110true, Black: 177#(and (<= i4 1) (<= 2 i2) (<= i2 2) (<= 1 i4) (<= i 3) (<= i1 0) (<= 0 i1) (<= 3 i)), Black: 167#(and (<= 1 i) (<= i1 0) (<= 0 i1) (<= i 1)), Black: 224#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (or (<= n3 n1) (<= n2 0)) (not (= n2 0))), Black: 226#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 155#(and (<= i 0) (<= 0 i)), Black: 194#(and (<= 0 n4) (<= n4 0) (<= n1 n4) (<= n3 0) (<= 0 n2)), Black: 228#(and (<= (+ n2 1) n4) (<= n1 0) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 171#(and (<= i4 1) (<= 2 i) (<= 1 i4) (<= i 2) (<= i1 0) (<= 0 i1)), Black: 197#(and (<= n1 0) (= n4 n2) (<= n3 0) (<= 1 n2)), Black: 156#(and (<= i1 0) (<= 0 i1)), Black: 198#(and (<= n1 0) (= n4 n2) (<= 1 n2)), 191#true]) [2021-03-12 00:12:32,063 INFO L384 tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event [2021-03-12 00:12:32,063 INFO L387 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2021-03-12 00:12:32,063 INFO L387 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2021-03-12 00:12:32,063 INFO L387 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2021-03-12 00:12:32,411 INFO L129 PetriNetUnfolder]: 8418/23139 cut-off events. [2021-03-12 00:12:32,411 INFO L130 PetriNetUnfolder]: For 27062/28068 co-relation queries the response was YES. [2021-03-12 00:12:32,613 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64098 conditions, 23139 events. 8418/23139 cut-off events. For 27062/28068 co-relation queries the response was YES. Maximal size of possible extension queue 1058. Compared 278719 event pairs, 4246 based on Foata normal form. 315/20668 useless extension candidates. Maximal degree in co-relation 62923. Up to 8504 conditions per place. [2021-03-12 00:12:32,707 INFO L132 encePairwiseOnDemand]: 89/94 looper letters, 4 selfloop transitions, 19 changer transitions 0/297 dead transitions. [2021-03-12 00:12:32,707 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 297 transitions, 1732 flow [2021-03-12 00:12:32,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-12 00:12:32,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-12 00:12:32,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2021-03-12 00:12:32,709 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9361702127659575 [2021-03-12 00:12:32,709 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 264 transitions. [2021-03-12 00:12:32,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 264 transitions. [2021-03-12 00:12:32,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-12 00:12:32,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 264 transitions. [2021-03-12 00:12:32,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:32,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:32,710 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:32,710 INFO L185 Difference]: Start difference. First operand has 158 places, 310 transitions, 1754 flow. Second operand 3 states and 264 transitions. [2021-03-12 00:12:32,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 297 transitions, 1732 flow [2021-03-12 00:12:32,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 297 transitions, 1722 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-12 00:12:32,953 INFO L241 Difference]: Finished difference. Result has 159 places, 297 transitions, 1739 flow [2021-03-12 00:12:32,953 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=1676, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1739, PETRI_PLACES=159, PETRI_TRANSITIONS=297} [2021-03-12 00:12:32,953 INFO L335 CegarLoopForPetriNet]: 75 programPoint places, 84 predicate places. [2021-03-12 00:12:32,953 INFO L480 AbstractCegarLoop]: Abstraction has has 159 places, 297 transitions, 1739 flow [2021-03-12 00:12:32,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:32,954 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-12 00:12:32,954 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-12 00:12:32,954 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-12 00:12:32,954 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-12 00:12:32,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-12 00:12:32,954 INFO L82 PathProgramCache]: Analyzing trace with hash -801452145, now seen corresponding path program 7 times [2021-03-12 00:12:32,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-12 00:12:32,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282249414] [2021-03-12 00:12:32,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-12 00:12:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-12 00:12:32,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:32,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:32,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:32,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:32,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:32,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:33,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:33,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:33,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:33,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:33,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:33,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:33,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:33,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:33,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:33,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:33,045 INFO L142 QuantifierPusher]: treesize reduction 9, result has 43.8 percent of original size [2021-03-12 00:12:33,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:33,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-12 00:12:33,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282249414] [2021-03-12 00:12:33,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-12 00:12:33,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-12 00:12:33,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363220658] [2021-03-12 00:12:33,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-12 00:12:33,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-12 00:12:33,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-12 00:12:33,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-03-12 00:12:33,057 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 94 [2021-03-12 00:12:33,058 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 297 transitions, 1739 flow. Second operand has 11 states, 11 states have (on average 82.9090909090909) internal successors, (912), 11 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:33,058 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-12 00:12:33,058 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 94 [2021-03-12 00:12:33,058 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-12 00:12:33,582 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([235] L60-->thread2EXIT: Formula: (= v_n2_62 0) InVars {} OutVars{n2=v_n2_62} AuxVars[] AssignedVars[n2][118], [Black: 199#(and (<= (+ n2 1) n4) (<= n1 0) (<= 1 n2)), Black: 232#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 202#(and (or (and (<= n3 n2) (or (<= (+ n3 n1 1) n2) (not (= n4 n3))) (= n2 n1)) (<= n2 0)) (not (= n2 0))), Black: 112#(and (<= 0 i4) (<= 1 i) (<= i4 0) (<= i 1)), Black: 234#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 203#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= n3 n1))) (<= n2 0)) (not (= n2 0))), Black: 116#(and (<= 0 i4) (<= 2 i) (<= i 2) (<= 1 i3) (<= i3 1) (<= i4 0)), Black: 236#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 100#(and (<= i 0) (<= 0 i)), Black: 238#(and (<= (+ n3 1) n4) (or (<= n3 n1) (<= n2 0)) (not (= n2 0)) (not (= n3 0))), Black: 122#(and (<= 0 i4) (<= 2 i1) (<= i 3) (<= 1 i3) (<= i3 1) (<= i4 0) (<= i1 2) (<= 3 i)), Black: 207#(and (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 240#(and (<= n1 0) (<= (+ n3 1) n4) (= n4 n2) (<= 1 n2)), Black: 208#(and (<= (+ n3 1) n4) (not (= n3 0))), Black: 244#(and (<= n1 0) (<= (+ n3 1) n4) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 212#(and (<= n1 0) (<= n3 n2) (not (= n4 n3)) (<= 1 n2)), Black: 214#(and (<= n1 0) (= n4 n2) (<= n3 n1) (<= 1 n2)), Black: 246#(and (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 248#(and (or (= n4 n3) (<= (+ n3 1) n4) (<= n3 n1) (<= n2 0)) (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0))), 15#L70true, Black: 216#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (or (not (= n4 n3)) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 220#(and (<= n1 0) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (<= 1 n2)), Black: 140#(and (<= 1 n3) (<= n3 n4)), Black: 141#(and (<= 1 n3) (<= (+ n3 1) n4)), Black: 143#(and (<= 1 n3) (<= 0 n4)), 276#e3, Black: 150#e4, 153#true, 98#true, 293#(and (<= i2 0) (<= 1 i) (<= 0 i2) (<= i 1)), 45#L110true, 53#L28true, 56#thread2EXITtrue, Black: 177#(and (<= i4 1) (<= 2 i2) (<= i2 2) (<= 1 i4) (<= i 3) (<= i1 0) (<= 0 i1) (<= 3 i)), Black: 224#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (or (<= n3 n1) (<= n2 0)) (not (= n2 0))), Black: 167#(and (<= 1 i) (<= i1 0) (<= 0 i1) (<= i 1)), Black: 226#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 194#(and (<= 0 n4) (<= n4 0) (<= n1 n4) (<= n3 0) (<= 0 n2)), Black: 155#(and (<= i 0) (<= 0 i)), Black: 228#(and (<= (+ n2 1) n4) (<= n1 0) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 171#(and (<= i4 1) (<= 2 i) (<= 1 i4) (<= i 2) (<= i1 0) (<= 0 i1)), 62#L96true, Black: 156#(and (<= i1 0) (<= 0 i1)), Black: 197#(and (<= n1 0) (= n4 n2) (<= n3 0) (<= 1 n2)), Black: 198#(and (<= n1 0) (= n4 n2) (<= 1 n2)), 191#true]) [2021-03-12 00:12:33,582 INFO L384 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2021-03-12 00:12:33,582 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-12 00:12:33,582 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-12 00:12:33,582 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-12 00:12:33,604 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([235] L60-->thread2EXIT: Formula: (= v_n2_62 0) InVars {} OutVars{n2=v_n2_62} AuxVars[] AssignedVars[n2][118], [Black: 199#(and (<= (+ n2 1) n4) (<= n1 0) (<= 1 n2)), Black: 232#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 202#(and (or (and (<= n3 n2) (or (<= (+ n3 n1 1) n2) (not (= n4 n3))) (= n2 n1)) (<= n2 0)) (not (= n2 0))), Black: 234#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 112#(and (<= 0 i4) (<= 1 i) (<= i4 0) (<= i 1)), Black: 116#(and (<= 0 i4) (<= 2 i) (<= i 2) (<= 1 i3) (<= i3 1) (<= i4 0)), Black: 203#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= n3 n1))) (<= n2 0)) (not (= n2 0))), Black: 236#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 100#(and (<= i 0) (<= 0 i)), Black: 238#(and (<= (+ n3 1) n4) (or (<= n3 n1) (<= n2 0)) (not (= n2 0)) (not (= n3 0))), Black: 122#(and (<= 0 i4) (<= 2 i1) (<= i 3) (<= 1 i3) (<= i3 1) (<= i4 0) (<= i1 2) (<= 3 i)), Black: 207#(and (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 240#(and (<= n1 0) (<= (+ n3 1) n4) (= n4 n2) (<= 1 n2)), Black: 208#(and (<= (+ n3 1) n4) (not (= n3 0))), Black: 244#(and (<= n1 0) (<= (+ n3 1) n4) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 212#(and (<= n1 0) (<= n3 n2) (not (= n4 n3)) (<= 1 n2)), Black: 214#(and (<= n1 0) (= n4 n2) (<= n3 n1) (<= 1 n2)), Black: 246#(and (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 248#(and (or (= n4 n3) (<= (+ n3 1) n4) (<= n3 n1) (<= n2 0)) (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0))), Black: 216#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (or (not (= n4 n3)) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), 143#(and (<= 1 n3) (<= 0 n4)), Black: 220#(and (<= n1 0) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (<= 1 n2)), Black: 140#(and (<= 1 n3) (<= n3 n4)), Black: 141#(and (<= 1 n3) (<= (+ n3 1) n4)), 274#true, Black: 276#e3, Black: 150#e4, 153#true, 33#L72true, 98#true, 293#(and (<= i2 0) (<= 1 i) (<= 0 i2) (<= i 1)), 45#L110true, 53#L28true, 56#thread2EXITtrue, Black: 177#(and (<= i4 1) (<= 2 i2) (<= i2 2) (<= 1 i4) (<= i 3) (<= i1 0) (<= 0 i1) (<= 3 i)), Black: 224#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (or (<= n3 n1) (<= n2 0)) (not (= n2 0))), Black: 167#(and (<= 1 i) (<= i1 0) (<= 0 i1) (<= i 1)), Black: 226#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 194#(and (<= 0 n4) (<= n4 0) (<= n1 n4) (<= n3 0) (<= 0 n2)), Black: 155#(and (<= i 0) (<= 0 i)), Black: 228#(and (<= (+ n2 1) n4) (<= n1 0) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 171#(and (<= i4 1) (<= 2 i) (<= 1 i4) (<= i 2) (<= i1 0) (<= 0 i1)), Black: 197#(and (<= n1 0) (= n4 n2) (<= n3 0) (<= 1 n2)), Black: 156#(and (<= i1 0) (<= 0 i1)), 62#L96true, Black: 198#(and (<= n1 0) (= n4 n2) (<= 1 n2)), 191#true]) [2021-03-12 00:12:33,605 INFO L384 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2021-03-12 00:12:33,605 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2021-03-12 00:12:33,605 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2021-03-12 00:12:33,605 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2021-03-12 00:12:33,688 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([235] L60-->thread2EXIT: Formula: (= v_n2_62 0) InVars {} OutVars{n2=v_n2_62} AuxVars[] AssignedVars[n2][118], [Black: 199#(and (<= (+ n2 1) n4) (<= n1 0) (<= 1 n2)), Black: 232#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 202#(and (or (and (<= n3 n2) (or (<= (+ n3 n1 1) n2) (not (= n4 n3))) (= n2 n1)) (<= n2 0)) (not (= n2 0))), Black: 112#(and (<= 0 i4) (<= 1 i) (<= i4 0) (<= i 1)), Black: 234#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 203#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= n3 n1))) (<= n2 0)) (not (= n2 0))), Black: 116#(and (<= 0 i4) (<= 2 i) (<= i 2) (<= 1 i3) (<= i3 1) (<= i4 0)), Black: 100#(and (<= i 0) (<= 0 i)), Black: 236#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 238#(and (<= (+ n3 1) n4) (or (<= n3 n1) (<= n2 0)) (not (= n2 0)) (not (= n3 0))), Black: 122#(and (<= 0 i4) (<= 2 i1) (<= i 3) (<= 1 i3) (<= i3 1) (<= i4 0) (<= i1 2) (<= 3 i)), Black: 207#(and (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 240#(and (<= n1 0) (<= (+ n3 1) n4) (= n4 n2) (<= 1 n2)), Black: 208#(and (<= (+ n3 1) n4) (not (= n3 0))), 10#L30true, Black: 244#(and (<= n1 0) (<= (+ n3 1) n4) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 212#(and (<= n1 0) (<= n3 n2) (not (= n4 n3)) (<= 1 n2)), Black: 214#(and (<= n1 0) (= n4 n2) (<= n3 n1) (<= 1 n2)), Black: 246#(and (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 248#(and (or (= n4 n3) (<= (+ n3 1) n4) (<= n3 n1) (<= n2 0)) (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0))), 15#L70true, Black: 216#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (or (not (= n4 n3)) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 220#(and (<= n1 0) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (<= 1 n2)), Black: 140#(and (<= 1 n3) (<= n3 n4)), Black: 141#(and (<= 1 n3) (<= (+ n3 1) n4)), Black: 143#(and (<= 1 n3) (<= 0 n4)), 276#e3, Black: 150#e4, 153#true, 98#true, 293#(and (<= i2 0) (<= 1 i) (<= 0 i2) (<= i 1)), 45#L110true, 56#thread2EXITtrue, Black: 177#(and (<= i4 1) (<= 2 i2) (<= i2 2) (<= 1 i4) (<= i 3) (<= i1 0) (<= 0 i1) (<= 3 i)), Black: 224#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (or (<= n3 n1) (<= n2 0)) (not (= n2 0))), Black: 167#(and (<= 1 i) (<= i1 0) (<= 0 i1) (<= i 1)), Black: 226#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 194#(and (<= 0 n4) (<= n4 0) (<= n1 n4) (<= n3 0) (<= 0 n2)), Black: 155#(and (<= i 0) (<= 0 i)), Black: 228#(and (<= (+ n2 1) n4) (<= n1 0) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 171#(and (<= i4 1) (<= 2 i) (<= 1 i4) (<= i 2) (<= i1 0) (<= 0 i1)), 62#L96true, Black: 156#(and (<= i1 0) (<= 0 i1)), Black: 197#(and (<= n1 0) (= n4 n2) (<= n3 0) (<= 1 n2)), 191#true, Black: 198#(and (<= n1 0) (= n4 n2) (<= 1 n2))]) [2021-03-12 00:12:33,688 INFO L384 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2021-03-12 00:12:33,688 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-12 00:12:33,688 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-12 00:12:33,688 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-12 00:12:33,711 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([235] L60-->thread2EXIT: Formula: (= v_n2_62 0) InVars {} OutVars{n2=v_n2_62} AuxVars[] AssignedVars[n2][118], [Black: 199#(and (<= (+ n2 1) n4) (<= n1 0) (<= 1 n2)), Black: 232#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 202#(and (or (and (<= n3 n2) (or (<= (+ n3 n1 1) n2) (not (= n4 n3))) (= n2 n1)) (<= n2 0)) (not (= n2 0))), Black: 234#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 112#(and (<= 0 i4) (<= 1 i) (<= i4 0) (<= i 1)), Black: 116#(and (<= 0 i4) (<= 2 i) (<= i 2) (<= 1 i3) (<= i3 1) (<= i4 0)), Black: 203#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= n3 n1))) (<= n2 0)) (not (= n2 0))), Black: 100#(and (<= i 0) (<= 0 i)), Black: 236#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 238#(and (<= (+ n3 1) n4) (or (<= n3 n1) (<= n2 0)) (not (= n2 0)) (not (= n3 0))), Black: 122#(and (<= 0 i4) (<= 2 i1) (<= i 3) (<= 1 i3) (<= i3 1) (<= i4 0) (<= i1 2) (<= 3 i)), Black: 207#(and (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 240#(and (<= n1 0) (<= (+ n3 1) n4) (= n4 n2) (<= 1 n2)), Black: 208#(and (<= (+ n3 1) n4) (not (= n3 0))), Black: 244#(and (<= n1 0) (<= (+ n3 1) n4) (<= n3 n2) (<= 1 n2) (not (= n3 0))), 10#L30true, Black: 212#(and (<= n1 0) (<= n3 n2) (not (= n4 n3)) (<= 1 n2)), Black: 214#(and (<= n1 0) (= n4 n2) (<= n3 n1) (<= 1 n2)), Black: 246#(and (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 248#(and (or (= n4 n3) (<= (+ n3 1) n4) (<= n3 n1) (<= n2 0)) (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0))), 143#(and (<= 1 n3) (<= 0 n4)), Black: 216#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (or (not (= n4 n3)) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 220#(and (<= n1 0) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (<= 1 n2)), Black: 140#(and (<= 1 n3) (<= n3 n4)), 274#true, Black: 141#(and (<= 1 n3) (<= (+ n3 1) n4)), Black: 276#e3, Black: 150#e4, 153#true, 33#L72true, 98#true, 293#(and (<= i2 0) (<= 1 i) (<= 0 i2) (<= i 1)), 45#L110true, 56#thread2EXITtrue, Black: 177#(and (<= i4 1) (<= 2 i2) (<= i2 2) (<= 1 i4) (<= i 3) (<= i1 0) (<= 0 i1) (<= 3 i)), Black: 224#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (or (<= n3 n1) (<= n2 0)) (not (= n2 0))), Black: 167#(and (<= 1 i) (<= i1 0) (<= 0 i1) (<= i 1)), Black: 226#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 194#(and (<= 0 n4) (<= n4 0) (<= n1 n4) (<= n3 0) (<= 0 n2)), Black: 155#(and (<= i 0) (<= 0 i)), Black: 228#(and (<= (+ n2 1) n4) (<= n1 0) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 171#(and (<= i4 1) (<= 2 i) (<= 1 i4) (<= i 2) (<= i1 0) (<= 0 i1)), Black: 197#(and (<= n1 0) (= n4 n2) (<= n3 0) (<= 1 n2)), Black: 156#(and (<= i1 0) (<= 0 i1)), 62#L96true, 191#true, Black: 198#(and (<= n1 0) (= n4 n2) (<= 1 n2))]) [2021-03-12 00:12:33,712 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2021-03-12 00:12:33,712 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-12 00:12:33,712 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-12 00:12:33,712 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-12 00:12:33,823 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([235] L60-->thread2EXIT: Formula: (= v_n2_62 0) InVars {} OutVars{n2=v_n2_62} AuxVars[] AssignedVars[n2][118], [Black: 199#(and (<= (+ n2 1) n4) (<= n1 0) (<= 1 n2)), Black: 232#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 202#(and (or (and (<= n3 n2) (or (<= (+ n3 n1 1) n2) (not (= n4 n3))) (= n2 n1)) (<= n2 0)) (not (= n2 0))), Black: 112#(and (<= 0 i4) (<= 1 i) (<= i4 0) (<= i 1)), 67#L35true, Black: 234#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 203#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= n3 n1))) (<= n2 0)) (not (= n2 0))), Black: 116#(and (<= 0 i4) (<= 2 i) (<= i 2) (<= 1 i3) (<= i3 1) (<= i4 0)), Black: 100#(and (<= i 0) (<= 0 i)), Black: 236#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 122#(and (<= 0 i4) (<= 2 i1) (<= i 3) (<= 1 i3) (<= i3 1) (<= i4 0) (<= i1 2) (<= 3 i)), Black: 238#(and (<= (+ n3 1) n4) (or (<= n3 n1) (<= n2 0)) (not (= n2 0)) (not (= n3 0))), Black: 207#(and (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 240#(and (<= n1 0) (<= (+ n3 1) n4) (= n4 n2) (<= 1 n2)), Black: 208#(and (<= (+ n3 1) n4) (not (= n3 0))), Black: 244#(and (<= n1 0) (<= (+ n3 1) n4) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 212#(and (<= n1 0) (<= n3 n2) (not (= n4 n3)) (<= 1 n2)), Black: 214#(and (<= n1 0) (= n4 n2) (<= n3 n1) (<= 1 n2)), Black: 246#(and (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 248#(and (or (= n4 n3) (<= (+ n3 1) n4) (<= n3 n1) (<= n2 0)) (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0))), Black: 216#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (or (not (= n4 n3)) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 220#(and (<= n1 0) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (<= 1 n2)), Black: 140#(and (<= 1 n3) (<= n3 n4)), Black: 141#(and (<= 1 n3) (<= (+ n3 1) n4)), Black: 143#(and (<= 1 n3) (<= 0 n4)), 276#e3, Black: 150#e4, 153#true, 98#true, 293#(and (<= i2 0) (<= 1 i) (<= 0 i2) (<= i 1)), 39#L69true, 45#L110true, 56#thread2EXITtrue, Black: 177#(and (<= i4 1) (<= 2 i2) (<= i2 2) (<= 1 i4) (<= i 3) (<= i1 0) (<= 0 i1) (<= 3 i)), Black: 167#(and (<= 1 i) (<= i1 0) (<= 0 i1) (<= i 1)), Black: 224#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (or (<= n3 n1) (<= n2 0)) (not (= n2 0))), Black: 226#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 155#(and (<= i 0) (<= 0 i)), Black: 194#(and (<= 0 n4) (<= n4 0) (<= n1 n4) (<= n3 0) (<= 0 n2)), Black: 171#(and (<= i4 1) (<= 2 i) (<= 1 i4) (<= i 2) (<= i1 0) (<= 0 i1)), Black: 228#(and (<= (+ n2 1) n4) (<= n1 0) (<= n3 n2) (<= 1 n2) (not (= n3 0))), 62#L96true, Black: 156#(and (<= i1 0) (<= 0 i1)), Black: 197#(and (<= n1 0) (= n4 n2) (<= n3 0) (<= 1 n2)), 191#true, Black: 198#(and (<= n1 0) (= n4 n2) (<= 1 n2))]) [2021-03-12 00:12:33,823 INFO L384 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2021-03-12 00:12:33,823 INFO L387 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2021-03-12 00:12:33,823 INFO L387 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2021-03-12 00:12:33,823 INFO L387 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2021-03-12 00:12:33,904 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([235] L60-->thread2EXIT: Formula: (= v_n2_62 0) InVars {} OutVars{n2=v_n2_62} AuxVars[] AssignedVars[n2][118], [Black: 199#(and (<= (+ n2 1) n4) (<= n1 0) (<= 1 n2)), Black: 232#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 202#(and (or (and (<= n3 n2) (or (<= (+ n3 n1 1) n2) (not (= n4 n3))) (= n2 n1)) (<= n2 0)) (not (= n2 0))), Black: 112#(and (<= 0 i4) (<= 1 i) (<= i4 0) (<= i 1)), 67#L35true, Black: 234#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 203#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= n3 n1))) (<= n2 0)) (not (= n2 0))), Black: 116#(and (<= 0 i4) (<= 2 i) (<= i 2) (<= 1 i3) (<= i3 1) (<= i4 0)), Black: 100#(and (<= i 0) (<= 0 i)), Black: 236#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 122#(and (<= 0 i4) (<= 2 i1) (<= i 3) (<= 1 i3) (<= i3 1) (<= i4 0) (<= i1 2) (<= 3 i)), Black: 238#(and (<= (+ n3 1) n4) (or (<= n3 n1) (<= n2 0)) (not (= n2 0)) (not (= n3 0))), Black: 207#(and (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 240#(and (<= n1 0) (<= (+ n3 1) n4) (= n4 n2) (<= 1 n2)), Black: 208#(and (<= (+ n3 1) n4) (not (= n3 0))), Black: 244#(and (<= n1 0) (<= (+ n3 1) n4) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 212#(and (<= n1 0) (<= n3 n2) (not (= n4 n3)) (<= 1 n2)), Black: 214#(and (<= n1 0) (= n4 n2) (<= n3 n1) (<= 1 n2)), Black: 246#(and (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 248#(and (or (= n4 n3) (<= (+ n3 1) n4) (<= n3 n1) (<= n2 0)) (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0))), Black: 216#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (or (not (= n4 n3)) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), 80#L97true, Black: 220#(and (<= n1 0) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (<= 1 n2)), Black: 140#(and (<= 1 n3) (<= n3 n4)), Black: 141#(and (<= 1 n3) (<= (+ n3 1) n4)), Black: 143#(and (<= 1 n3) (<= 0 n4)), 276#e3, Black: 150#e4, 153#true, 98#true, 293#(and (<= i2 0) (<= 1 i) (<= 0 i2) (<= i 1)), 39#L69true, 45#L110true, 56#thread2EXITtrue, Black: 177#(and (<= i4 1) (<= 2 i2) (<= i2 2) (<= 1 i4) (<= i 3) (<= i1 0) (<= 0 i1) (<= 3 i)), Black: 167#(and (<= 1 i) (<= i1 0) (<= 0 i1) (<= i 1)), Black: 224#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (or (<= n3 n1) (<= n2 0)) (not (= n2 0))), Black: 226#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 155#(and (<= i 0) (<= 0 i)), Black: 194#(and (<= 0 n4) (<= n4 0) (<= n1 n4) (<= n3 0) (<= 0 n2)), Black: 171#(and (<= i4 1) (<= 2 i) (<= 1 i4) (<= i 2) (<= i1 0) (<= 0 i1)), Black: 228#(and (<= (+ n2 1) n4) (<= n1 0) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 156#(and (<= i1 0) (<= 0 i1)), Black: 197#(and (<= n1 0) (= n4 n2) (<= n3 0) (<= 1 n2)), 191#true, Black: 198#(and (<= n1 0) (= n4 n2) (<= 1 n2))]) [2021-03-12 00:12:33,905 INFO L384 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2021-03-12 00:12:33,905 INFO L387 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2021-03-12 00:12:33,905 INFO L387 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2021-03-12 00:12:33,905 INFO L387 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2021-03-12 00:12:33,980 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([235] L60-->thread2EXIT: Formula: (= v_n2_62 0) InVars {} OutVars{n2=v_n2_62} AuxVars[] AssignedVars[n2][118], [Black: 199#(and (<= (+ n2 1) n4) (<= n1 0) (<= 1 n2)), Black: 232#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 202#(and (or (and (<= n3 n2) (or (<= (+ n3 n1 1) n2) (not (= n4 n3))) (= n2 n1)) (<= n2 0)) (not (= n2 0))), Black: 112#(and (<= 0 i4) (<= 1 i) (<= i4 0) (<= i 1)), 67#L35true, Black: 234#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 203#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= n3 n1))) (<= n2 0)) (not (= n2 0))), Black: 116#(and (<= 0 i4) (<= 2 i) (<= i 2) (<= 1 i3) (<= i3 1) (<= i4 0)), Black: 100#(and (<= i 0) (<= 0 i)), Black: 236#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 122#(and (<= 0 i4) (<= 2 i1) (<= i 3) (<= 1 i3) (<= i3 1) (<= i4 0) (<= i1 2) (<= 3 i)), Black: 238#(and (<= (+ n3 1) n4) (or (<= n3 n1) (<= n2 0)) (not (= n2 0)) (not (= n3 0))), Black: 207#(and (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 240#(and (<= n1 0) (<= (+ n3 1) n4) (= n4 n2) (<= 1 n2)), Black: 208#(and (<= (+ n3 1) n4) (not (= n3 0))), Black: 244#(and (<= n1 0) (<= (+ n3 1) n4) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 212#(and (<= n1 0) (<= n3 n2) (not (= n4 n3)) (<= 1 n2)), Black: 214#(and (<= n1 0) (= n4 n2) (<= n3 n1) (<= 1 n2)), Black: 246#(and (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 248#(and (or (= n4 n3) (<= (+ n3 1) n4) (<= n3 n1) (<= n2 0)) (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0))), Black: 216#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (or (not (= n4 n3)) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), 15#L70true, Black: 220#(and (<= n1 0) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (<= 1 n2)), Black: 140#(and (<= 1 n3) (<= n3 n4)), Black: 141#(and (<= 1 n3) (<= (+ n3 1) n4)), Black: 143#(and (<= 1 n3) (<= 0 n4)), 276#e3, Black: 150#e4, 153#true, 98#true, 293#(and (<= i2 0) (<= 1 i) (<= 0 i2) (<= i 1)), 45#L110true, 56#thread2EXITtrue, Black: 177#(and (<= i4 1) (<= 2 i2) (<= i2 2) (<= 1 i4) (<= i 3) (<= i1 0) (<= 0 i1) (<= 3 i)), Black: 167#(and (<= 1 i) (<= i1 0) (<= 0 i1) (<= i 1)), Black: 224#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (or (<= n3 n1) (<= n2 0)) (not (= n2 0))), Black: 226#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 155#(and (<= i 0) (<= 0 i)), Black: 194#(and (<= 0 n4) (<= n4 0) (<= n1 n4) (<= n3 0) (<= 0 n2)), Black: 171#(and (<= i4 1) (<= 2 i) (<= 1 i4) (<= i 2) (<= i1 0) (<= 0 i1)), Black: 228#(and (<= (+ n2 1) n4) (<= n1 0) (<= n3 n2) (<= 1 n2) (not (= n3 0))), 62#L96true, Black: 156#(and (<= i1 0) (<= 0 i1)), Black: 197#(and (<= n1 0) (= n4 n2) (<= n3 0) (<= 1 n2)), 191#true, Black: 198#(and (<= n1 0) (= n4 n2) (<= 1 n2))]) [2021-03-12 00:12:33,981 INFO L384 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2021-03-12 00:12:33,981 INFO L387 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2021-03-12 00:12:33,981 INFO L387 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2021-03-12 00:12:33,981 INFO L387 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2021-03-12 00:12:34,046 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([188] L68-->L69: Formula: (= v_n3_8 (ite (< v_n3_9 v_n2_16) v_n2_16 v_n3_9)) InVars {n2=v_n2_16, n3=v_n3_9} OutVars{n2=v_n2_16, n3=v_n3_8} AuxVars[] AssignedVars[n3][13], [Black: 199#(and (<= (+ n2 1) n4) (<= n1 0) (<= 1 n2)), Black: 232#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 202#(and (or (and (<= n3 n2) (or (<= (+ n3 n1 1) n2) (not (= n4 n3))) (= n2 n1)) (<= n2 0)) (not (= n2 0))), Black: 234#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 112#(and (<= 0 i4) (<= 1 i) (<= i4 0) (<= i 1)), 67#L35true, Black: 116#(and (<= 0 i4) (<= 2 i) (<= i 2) (<= 1 i3) (<= i3 1) (<= i4 0)), Black: 203#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= n3 n1))) (<= n2 0)) (not (= n2 0))), Black: 236#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 100#(and (<= i 0) (<= 0 i)), Black: 122#(and (<= 0 i4) (<= 2 i1) (<= i 3) (<= 1 i3) (<= i3 1) (<= i4 0) (<= i1 2) (<= 3 i)), Black: 238#(and (<= (+ n3 1) n4) (or (<= n3 n1) (<= n2 0)) (not (= n2 0)) (not (= n3 0))), Black: 207#(and (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 240#(and (<= n1 0) (<= (+ n3 1) n4) (= n4 n2) (<= 1 n2)), Black: 208#(and (<= (+ n3 1) n4) (not (= n3 0))), Black: 244#(and (<= n1 0) (<= (+ n3 1) n4) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 212#(and (<= n1 0) (<= n3 n2) (not (= n4 n3)) (<= 1 n2)), Black: 214#(and (<= n1 0) (= n4 n2) (<= n3 n1) (<= 1 n2)), Black: 246#(and (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 248#(and (or (= n4 n3) (<= (+ n3 1) n4) (<= n3 n1) (<= n2 0)) (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0))), Black: 216#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (or (not (= n4 n3)) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 140#(and (<= 1 n3) (<= n3 n4)), Black: 220#(and (<= n1 0) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (<= 1 n2)), Black: 141#(and (<= 1 n3) (<= (+ n3 1) n4)), Black: 143#(and (<= 1 n3) (<= 0 n4)), 276#e3, Black: 150#e4, 153#true, 98#true, 293#(and (<= i2 0) (<= 1 i) (<= 0 i2) (<= i 1)), 39#L69true, 45#L110true, 56#thread2EXITtrue, Black: 177#(and (<= i4 1) (<= 2 i2) (<= i2 2) (<= 1 i4) (<= i 3) (<= i1 0) (<= 0 i1) (<= 3 i)), Black: 167#(and (<= 1 i) (<= i1 0) (<= 0 i1) (<= i 1)), Black: 224#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (or (<= n3 n1) (<= n2 0)) (not (= n2 0))), Black: 226#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 194#(and (<= 0 n4) (<= n4 0) (<= n1 n4) (<= n3 0) (<= 0 n2)), Black: 155#(and (<= i 0) (<= 0 i)), Black: 171#(and (<= i4 1) (<= 2 i) (<= 1 i4) (<= i 2) (<= i1 0) (<= 0 i1)), Black: 228#(and (<= (+ n2 1) n4) (<= n1 0) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 197#(and (<= n1 0) (= n4 n2) (<= n3 0) (<= 1 n2)), Black: 156#(and (<= i1 0) (<= 0 i1)), 62#L96true, Black: 198#(and (<= n1 0) (= n4 n2) (<= 1 n2)), 191#true]) [2021-03-12 00:12:34,046 INFO L384 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2021-03-12 00:12:34,046 INFO L387 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2021-03-12 00:12:34,046 INFO L387 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2021-03-12 00:12:34,046 INFO L387 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2021-03-12 00:12:34,162 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([235] L60-->thread2EXIT: Formula: (= v_n2_62 0) InVars {} OutVars{n2=v_n2_62} AuxVars[] AssignedVars[n2][118], [Black: 199#(and (<= (+ n2 1) n4) (<= n1 0) (<= 1 n2)), Black: 232#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 202#(and (or (and (<= n3 n2) (or (<= (+ n3 n1 1) n2) (not (= n4 n3))) (= n2 n1)) (<= n2 0)) (not (= n2 0))), Black: 112#(and (<= 0 i4) (<= 1 i) (<= i4 0) (<= i 1)), 67#L35true, Black: 234#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 203#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= n3 n1))) (<= n2 0)) (not (= n2 0))), Black: 116#(and (<= 0 i4) (<= 2 i) (<= i 2) (<= 1 i3) (<= i3 1) (<= i4 0)), Black: 100#(and (<= i 0) (<= 0 i)), Black: 236#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 122#(and (<= 0 i4) (<= 2 i1) (<= i 3) (<= 1 i3) (<= i3 1) (<= i4 0) (<= i1 2) (<= 3 i)), Black: 238#(and (<= (+ n3 1) n4) (or (<= n3 n1) (<= n2 0)) (not (= n2 0)) (not (= n3 0))), Black: 207#(and (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 240#(and (<= n1 0) (<= (+ n3 1) n4) (= n4 n2) (<= 1 n2)), Black: 208#(and (<= (+ n3 1) n4) (not (= n3 0))), Black: 244#(and (<= n1 0) (<= (+ n3 1) n4) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 212#(and (<= n1 0) (<= n3 n2) (not (= n4 n3)) (<= 1 n2)), Black: 214#(and (<= n1 0) (= n4 n2) (<= n3 n1) (<= 1 n2)), Black: 246#(and (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 248#(and (or (= n4 n3) (<= (+ n3 1) n4) (<= n3 n1) (<= n2 0)) (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0))), Black: 216#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (or (not (= n4 n3)) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), 15#L70true, 80#L97true, Black: 220#(and (<= n1 0) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (<= 1 n2)), Black: 140#(and (<= 1 n3) (<= n3 n4)), Black: 141#(and (<= 1 n3) (<= (+ n3 1) n4)), Black: 143#(and (<= 1 n3) (<= 0 n4)), 276#e3, Black: 150#e4, 153#true, 98#true, 293#(and (<= i2 0) (<= 1 i) (<= 0 i2) (<= i 1)), 45#L110true, 56#thread2EXITtrue, Black: 177#(and (<= i4 1) (<= 2 i2) (<= i2 2) (<= 1 i4) (<= i 3) (<= i1 0) (<= 0 i1) (<= 3 i)), Black: 167#(and (<= 1 i) (<= i1 0) (<= 0 i1) (<= i 1)), Black: 224#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (or (<= n3 n1) (<= n2 0)) (not (= n2 0))), Black: 226#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 155#(and (<= i 0) (<= 0 i)), Black: 194#(and (<= 0 n4) (<= n4 0) (<= n1 n4) (<= n3 0) (<= 0 n2)), Black: 171#(and (<= i4 1) (<= 2 i) (<= 1 i4) (<= i 2) (<= i1 0) (<= 0 i1)), Black: 228#(and (<= (+ n2 1) n4) (<= n1 0) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 156#(and (<= i1 0) (<= 0 i1)), Black: 197#(and (<= n1 0) (= n4 n2) (<= n3 0) (<= 1 n2)), 191#true, Black: 198#(and (<= n1 0) (= n4 n2) (<= 1 n2))]) [2021-03-12 00:12:34,162 INFO L384 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2021-03-12 00:12:34,162 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2021-03-12 00:12:34,162 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2021-03-12 00:12:34,162 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2021-03-12 00:12:36,263 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([213] L97-->L98: Formula: (or (= v_n3_19 0) (and (not (< v_n3_19 v_n4_14)) (not (= v_n3_19 v_n4_14)))) InVars {n3=v_n3_19, n4=v_n4_14} OutVars{n3=v_n3_19, n4=v_n4_14} AuxVars[] AssignedVars[][95], [Black: 199#(and (<= (+ n2 1) n4) (<= n1 0) (<= 1 n2)), Black: 232#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 202#(and (or (and (<= n3 n2) (or (<= (+ n3 n1 1) n2) (not (= n4 n3))) (= n2 n1)) (<= n2 0)) (not (= n2 0))), Black: 234#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 112#(and (<= 0 i4) (<= 1 i) (<= i4 0) (<= i 1)), Black: 116#(and (<= 0 i4) (<= 2 i) (<= i 2) (<= 1 i3) (<= i3 1) (<= i4 0)), Black: 203#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= n3 n1))) (<= n2 0)) (not (= n2 0))), Black: 100#(and (<= i 0) (<= 0 i)), Black: 236#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), 69#L56true, Black: 238#(and (<= (+ n3 1) n4) (or (<= n3 n1) (<= n2 0)) (not (= n2 0)) (not (= n3 0))), Black: 122#(and (<= 0 i4) (<= 2 i1) (<= i 3) (<= 1 i3) (<= i3 1) (<= i4 0) (<= i1 2) (<= 3 i)), Black: 207#(and (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 240#(and (<= n1 0) (<= (+ n3 1) n4) (= n4 n2) (<= 1 n2)), 72#thread3EXITtrue, Black: 208#(and (<= (+ n3 1) n4) (not (= n3 0))), Black: 244#(and (<= n1 0) (<= (+ n3 1) n4) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 212#(and (<= n1 0) (<= n3 n2) (not (= n4 n3)) (<= 1 n2)), 12#thread1EXITtrue, Black: 214#(and (<= n1 0) (= n4 n2) (<= n3 n1) (<= 1 n2)), Black: 246#(and (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 248#(and (or (= n4 n3) (<= (+ n3 1) n4) (<= n3 n1) (<= n2 0)) (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0))), Black: 216#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (or (not (= n4 n3)) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 220#(and (<= n1 0) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (<= 1 n2)), Black: 140#(and (<= 1 n3) (<= n3 n4)), Black: 141#(and (<= 1 n3) (<= (+ n3 1) n4)), 274#true, Black: 143#(and (<= 1 n3) (<= 0 n4)), 22#L98true, Black: 276#e3, 279#true, Black: 150#e4, 153#true, 98#true, 45#L110true, Black: 177#(and (<= i4 1) (<= 2 i2) (<= i2 2) (<= 1 i4) (<= i 3) (<= i1 0) (<= 0 i1) (<= 3 i)), Black: 167#(and (<= 1 i) (<= i1 0) (<= 0 i1) (<= i 1)), Black: 224#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (or (<= n3 n1) (<= n2 0)) (not (= n2 0))), Black: 226#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 155#(and (<= i 0) (<= 0 i)), Black: 194#(and (<= 0 n4) (<= n4 0) (<= n1 n4) (<= n3 0) (<= 0 n2)), Black: 228#(and (<= (+ n2 1) n4) (<= n1 0) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 171#(and (<= i4 1) (<= 2 i) (<= 1 i4) (<= i 2) (<= i1 0) (<= 0 i1)), Black: 197#(and (<= n1 0) (= n4 n2) (<= n3 0) (<= 1 n2)), Black: 156#(and (<= i1 0) (<= 0 i1)), 191#true, Black: 198#(and (<= n1 0) (= n4 n2) (<= 1 n2))]) [2021-03-12 00:12:36,263 INFO L384 tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event [2021-03-12 00:12:36,263 INFO L387 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2021-03-12 00:12:36,263 INFO L387 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2021-03-12 00:12:36,263 INFO L387 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2021-03-12 00:12:37,325 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([231] L100-->thread4EXIT: Formula: (= v_n4_39 0) InVars {} OutVars{n4=v_n4_39} AuxVars[] AssignedVars[n4][133], [Black: 199#(and (<= (+ n2 1) n4) (<= n1 0) (<= 1 n2)), Black: 232#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 202#(and (or (and (<= n3 n2) (or (<= (+ n3 n1 1) n2) (not (= n4 n3))) (= n2 n1)) (<= n2 0)) (not (= n2 0))), Black: 234#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 112#(and (<= 0 i4) (<= 1 i) (<= i4 0) (<= i 1)), Black: 116#(and (<= 0 i4) (<= 2 i) (<= i 2) (<= 1 i3) (<= i3 1) (<= i4 0)), Black: 203#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= n3 n1))) (<= n2 0)) (not (= n2 0))), Black: 100#(and (<= i 0) (<= 0 i)), Black: 236#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 122#(and (<= 0 i4) (<= 2 i1) (<= i 3) (<= 1 i3) (<= i3 1) (<= i4 0) (<= i1 2) (<= 3 i)), Black: 238#(and (<= (+ n3 1) n4) (or (<= n3 n1) (<= n2 0)) (not (= n2 0)) (not (= n3 0))), Black: 207#(and (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), 72#thread3EXITtrue, Black: 240#(and (<= n1 0) (<= (+ n3 1) n4) (= n4 n2) (<= 1 n2)), Black: 208#(and (<= (+ n3 1) n4) (not (= n3 0))), Black: 244#(and (<= n1 0) (<= (+ n3 1) n4) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 212#(and (<= n1 0) (<= n3 n2) (not (= n4 n3)) (<= 1 n2)), Black: 214#(and (<= n1 0) (= n4 n2) (<= n3 n1) (<= 1 n2)), 12#thread1EXITtrue, Black: 246#(and (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 248#(and (or (= n4 n3) (<= (+ n3 1) n4) (<= n3 n1) (<= n2 0)) (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0))), Black: 216#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (or (not (= n4 n3)) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 220#(and (<= n1 0) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (<= 1 n2)), Black: 140#(and (<= 1 n3) (<= n3 n4)), Black: 141#(and (<= 1 n3) (<= (+ n3 1) n4)), 82#thread4EXITtrue, 274#true, Black: 143#(and (<= 1 n3) (<= 0 n4)), Black: 276#e3, Black: 150#e4, 153#true, 98#true, 301#(and (<= i2 0) (<= i1 1) (<= 0 i2) (<= 1 i1)), 45#L110true, 56#thread2EXITtrue, Black: 177#(and (<= i4 1) (<= 2 i2) (<= i2 2) (<= 1 i4) (<= i 3) (<= i1 0) (<= 0 i1) (<= 3 i)), Black: 167#(and (<= 1 i) (<= i1 0) (<= 0 i1) (<= i 1)), Black: 224#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (or (<= n3 n1) (<= n2 0)) (not (= n2 0))), Black: 226#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 194#(and (<= 0 n4) (<= n4 0) (<= n1 n4) (<= n3 0) (<= 0 n2)), Black: 155#(and (<= i 0) (<= 0 i)), Black: 171#(and (<= i4 1) (<= 2 i) (<= 1 i4) (<= i 2) (<= i1 0) (<= 0 i1)), Black: 228#(and (<= (+ n2 1) n4) (<= n1 0) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 156#(and (<= i1 0) (<= 0 i1)), Black: 197#(and (<= n1 0) (= n4 n2) (<= n3 0) (<= 1 n2)), Black: 198#(and (<= n1 0) (= n4 n2) (<= 1 n2)), 191#true]) [2021-03-12 00:12:37,325 INFO L384 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2021-03-12 00:12:37,325 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-03-12 00:12:37,325 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-03-12 00:12:37,325 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-03-12 00:12:37,351 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([235] L60-->thread2EXIT: Formula: (= v_n2_62 0) InVars {} OutVars{n2=v_n2_62} AuxVars[] AssignedVars[n2][118], [Black: 199#(and (<= (+ n2 1) n4) (<= n1 0) (<= 1 n2)), Black: 232#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4) (<= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 202#(and (or (and (<= n3 n2) (or (<= (+ n3 n1 1) n2) (not (= n4 n3))) (= n2 n1)) (<= n2 0)) (not (= n2 0))), Black: 112#(and (<= 0 i4) (<= 1 i) (<= i4 0) (<= i 1)), Black: 234#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 116#(and (<= 0 i4) (<= 2 i) (<= i 2) (<= 1 i3) (<= i3 1) (<= i4 0)), Black: 203#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= n3 n1))) (<= n2 0)) (not (= n2 0))), Black: 236#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 100#(and (<= i 0) (<= 0 i)), Black: 122#(and (<= 0 i4) (<= 2 i1) (<= i 3) (<= 1 i3) (<= i3 1) (<= i4 0) (<= i1 2) (<= 3 i)), Black: 238#(and (<= (+ n3 1) n4) (or (<= n3 n1) (<= n2 0)) (not (= n2 0)) (not (= n3 0))), Black: 207#(and (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 240#(and (<= n1 0) (<= (+ n3 1) n4) (= n4 n2) (<= 1 n2)), 72#thread3EXITtrue, Black: 208#(and (<= (+ n3 1) n4) (not (= n3 0))), Black: 244#(and (<= n1 0) (<= (+ n3 1) n4) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 212#(and (<= n1 0) (<= n3 n2) (not (= n4 n3)) (<= 1 n2)), 12#thread1EXITtrue, Black: 214#(and (<= n1 0) (= n4 n2) (<= n3 n1) (<= 1 n2)), Black: 246#(and (<= (+ n3 1) n4) (not (= n2 0)) (not (= n3 0))), Black: 248#(and (or (= n4 n3) (<= (+ n3 1) n4) (<= n3 n1) (<= n2 0)) (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (= n3 0) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0))), Black: 216#(and (or (and (<= n3 n2) (= n2 n1)) (<= n2 0)) (or (not (= n4 n3)) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (not (= n2 0))), Black: 140#(and (<= 1 n3) (<= n3 n4)), Black: 220#(and (<= n1 0) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (<= 1 n2)), 82#thread4EXITtrue, Black: 141#(and (<= 1 n3) (<= (+ n3 1) n4)), 274#true, Black: 143#(and (<= 1 n3) (<= 0 n4)), Black: 276#e3, 279#true, Black: 150#e4, 153#true, 45#L110true, 120#(and (<= 0 i4) (<= 1 i3) (<= i3 1) (<= i4 0)), 56#thread2EXITtrue, Black: 177#(and (<= i4 1) (<= 2 i2) (<= i2 2) (<= 1 i4) (<= i 3) (<= i1 0) (<= 0 i1) (<= 3 i)), Black: 224#(and (or (<= (+ n3 1) n4) (<= n2 0)) (or (<= n2 n4) (and (<= (+ n3 1) n4) (not (= n3 0)))) (or (<= n3 n1) (<= n2 0)) (not (= n2 0))), Black: 167#(and (<= 1 i) (<= i1 0) (<= 0 i1) (<= i 1)), Black: 226#(and (or (and (or (not (= n4 n3)) (<= (+ n3 1) 0)) (or (= n4 n3) (<= (+ n3 1) n1) (<= (+ n3 1) n4))) (<= n2 0)) (not (= n2 0)) (or (= n4 n3) (<= n3 n1) (<= n2 0))), Black: 194#(and (<= 0 n4) (<= n4 0) (<= n1 n4) (<= n3 0) (<= 0 n2)), Black: 155#(and (<= i 0) (<= 0 i)), Black: 228#(and (<= (+ n2 1) n4) (<= n1 0) (<= n3 n2) (<= 1 n2) (not (= n3 0))), Black: 171#(and (<= i4 1) (<= 2 i) (<= 1 i4) (<= i 2) (<= i1 0) (<= 0 i1)), Black: 156#(and (<= i1 0) (<= 0 i1)), Black: 197#(and (<= n1 0) (= n4 n2) (<= n3 0) (<= 1 n2)), 191#true, Black: 198#(and (<= n1 0) (= n4 n2) (<= 1 n2))]) [2021-03-12 00:12:37,351 INFO L384 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2021-03-12 00:12:37,351 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-03-12 00:12:37,351 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-03-12 00:12:37,351 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-03-12 00:12:37,401 INFO L129 PetriNetUnfolder]: 15432/38328 cut-off events. [2021-03-12 00:12:37,401 INFO L130 PetriNetUnfolder]: For 49221/50645 co-relation queries the response was YES. [2021-03-12 00:12:37,784 INFO L84 FinitePrefix]: Finished finitePrefix Result has 118287 conditions, 38328 events. 15432/38328 cut-off events. For 49221/50645 co-relation queries the response was YES. Maximal size of possible extension queue 1841. Compared 469431 event pairs, 7314 based on Foata normal form. 324/34425 useless extension candidates. Maximal degree in co-relation 115963. Up to 14506 conditions per place. [2021-03-12 00:12:37,951 INFO L132 encePairwiseOnDemand]: 84/94 looper letters, 121 selfloop transitions, 79 changer transitions 0/421 dead transitions. [2021-03-12 00:12:37,952 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 421 transitions, 2889 flow [2021-03-12 00:12:37,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-12 00:12:37,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-03-12 00:12:37,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1213 transitions. [2021-03-12 00:12:37,954 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9217325227963525 [2021-03-12 00:12:37,954 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1213 transitions. [2021-03-12 00:12:37,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1213 transitions. [2021-03-12 00:12:37,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-12 00:12:37,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1213 transitions. [2021-03-12 00:12:37,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 86.64285714285714) internal successors, (1213), 14 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:37,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 94.0) internal successors, (1410), 15 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:37,958 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 94.0) internal successors, (1410), 15 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:37,958 INFO L185 Difference]: Start difference. First operand has 159 places, 297 transitions, 1739 flow. Second operand 14 states and 1213 transitions. [2021-03-12 00:12:37,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 421 transitions, 2889 flow [2021-03-12 00:12:38,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 421 transitions, 2851 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-12 00:12:38,625 INFO L241 Difference]: Finished difference. Result has 178 places, 370 transitions, 2539 flow [2021-03-12 00:12:38,625 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=1701, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2539, PETRI_PLACES=178, PETRI_TRANSITIONS=370} [2021-03-12 00:12:38,625 INFO L335 CegarLoopForPetriNet]: 75 programPoint places, 103 predicate places. [2021-03-12 00:12:38,625 INFO L480 AbstractCegarLoop]: Abstraction has has 178 places, 370 transitions, 2539 flow [2021-03-12 00:12:38,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 82.9090909090909) internal successors, (912), 11 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:38,626 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-12 00:12:38,626 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-12 00:12:38,626 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-12 00:12:38,626 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-12 00:12:38,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-12 00:12:38,626 INFO L82 PathProgramCache]: Analyzing trace with hash 194383863, now seen corresponding path program 8 times [2021-03-12 00:12:38,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-12 00:12:38,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651023480] [2021-03-12 00:12:38,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-12 00:12:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-12 00:12:38,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:38,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-12 00:12:38,665 INFO L142 QuantifierPusher]: treesize reduction 4, result has 63.6 percent of original size [2021-03-12 00:12:38,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:38,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:38,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-12 00:12:38,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:38,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-12 00:12:38,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:38,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:38,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:38,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-12 00:12:38,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:38,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:12:38,696 INFO L142 QuantifierPusher]: treesize reduction 7, result has 68.2 percent of original size [2021-03-12 00:12:38,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-12 00:12:38,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:38,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-12 00:12:38,721 INFO L142 QuantifierPusher]: treesize reduction 54, result has 27.0 percent of original size [2021-03-12 00:12:38,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-12 00:12:38,735 INFO L142 QuantifierPusher]: treesize reduction 15, result has 69.4 percent of original size [2021-03-12 00:12:38,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-12 00:12:38,759 INFO L142 QuantifierPusher]: treesize reduction 9, result has 78.0 percent of original size [2021-03-12 00:12:38,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-12 00:12:38,770 INFO L142 QuantifierPusher]: treesize reduction 42, result has 40.0 percent of original size [2021-03-12 00:12:38,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-12 00:12:38,797 INFO L142 QuantifierPusher]: treesize reduction 35, result has 23.9 percent of original size [2021-03-12 00:12:38,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-12 00:12:38,814 INFO L142 QuantifierPusher]: treesize reduction 28, result has 26.3 percent of original size [2021-03-12 00:12:38,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-12 00:12:38,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:12:38,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-12 00:12:38,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-12 00:12:38,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651023480] [2021-03-12 00:12:38,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-12 00:12:38,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-03-12 00:12:38,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797556574] [2021-03-12 00:12:38,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-12 00:12:38,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-12 00:12:38,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-12 00:12:38,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-03-12 00:12:38,830 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 94 [2021-03-12 00:12:38,830 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 370 transitions, 2539 flow. Second operand has 15 states, 15 states have (on average 50.2) internal successors, (753), 15 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:12:38,831 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-12 00:12:38,831 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 94 [2021-03-12 00:12:38,831 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-12 00:12:43,401 WARN L205 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 6 [2021-03-12 00:13:57,539 INFO L129 PetriNetUnfolder]: 221443/410514 cut-off events. [2021-03-12 00:13:57,539 INFO L130 PetriNetUnfolder]: For 1243106/1283176 co-relation queries the response was YES. [2021-03-12 00:14:02,073 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1490061 conditions, 410514 events. 221443/410514 cut-off events. For 1243106/1283176 co-relation queries the response was YES. Maximal size of possible extension queue 11907. Compared 5077666 event pairs, 28349 based on Foata normal form. 4303/390405 useless extension candidates. Maximal degree in co-relation 1488882. Up to 127479 conditions per place. [2021-03-12 00:14:03,842 INFO L132 encePairwiseOnDemand]: 65/94 looper letters, 872 selfloop transitions, 321 changer transitions 0/1361 dead transitions. [2021-03-12 00:14:03,843 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 1361 transitions, 10214 flow [2021-03-12 00:14:03,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-03-12 00:14:03,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2021-03-12 00:14:03,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 3416 transitions. [2021-03-12 00:14:03,848 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7125573633708803 [2021-03-12 00:14:03,848 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 3416 transitions. [2021-03-12 00:14:03,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 3416 transitions. [2021-03-12 00:14:03,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-12 00:14:03,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 3416 transitions. [2021-03-12 00:14:03,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 66.98039215686275) internal successors, (3416), 51 states have internal predecessors, (3416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:14:03,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 94.0) internal successors, (4888), 52 states have internal predecessors, (4888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:14:03,859 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 94.0) internal successors, (4888), 52 states have internal predecessors, (4888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:14:03,859 INFO L185 Difference]: Start difference. First operand has 178 places, 370 transitions, 2539 flow. Second operand 51 states and 3416 transitions. [2021-03-12 00:14:03,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 1361 transitions, 10214 flow [2021-03-12 00:16:27,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 1361 transitions, 10144 flow, removed 35 selfloop flow, removed 0 redundant places. [2021-03-12 00:16:27,316 INFO L241 Difference]: Finished difference. Result has 277 places, 679 transitions, 5884 flow [2021-03-12 00:16:27,317 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=2469, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=5884, PETRI_PLACES=277, PETRI_TRANSITIONS=679} [2021-03-12 00:16:27,317 INFO L335 CegarLoopForPetriNet]: 75 programPoint places, 202 predicate places. [2021-03-12 00:16:27,317 INFO L480 AbstractCegarLoop]: Abstraction has has 277 places, 679 transitions, 5884 flow [2021-03-12 00:16:27,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 50.2) internal successors, (753), 15 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:16:27,317 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-12 00:16:27,317 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-12 00:16:27,317 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-12 00:16:27,318 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-12 00:16:27,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-12 00:16:27,318 INFO L82 PathProgramCache]: Analyzing trace with hash 375258023, now seen corresponding path program 9 times [2021-03-12 00:16:27,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-12 00:16:27,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099397582] [2021-03-12 00:16:27,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-12 00:16:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-12 00:16:27,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:16:27,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-12 00:16:27,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:16:27,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:16:27,373 INFO L142 QuantifierPusher]: treesize reduction 4, result has 71.4 percent of original size [2021-03-12 00:16:27,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-12 00:16:27,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:16:27,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-12 00:16:27,388 INFO L142 QuantifierPusher]: treesize reduction 7, result has 63.2 percent of original size [2021-03-12 00:16:27,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-12 00:16:27,397 INFO L142 QuantifierPusher]: treesize reduction 7, result has 70.8 percent of original size [2021-03-12 00:16:27,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-12 00:16:27,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:16:27,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-12 00:16:27,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:16:27,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-12 00:16:27,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:16:27,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-12 00:16:27,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-12 00:16:27,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-12 00:16:27,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-12 00:16:27,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099397582] [2021-03-12 00:16:27,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-12 00:16:27,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-12 00:16:27,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043816193] [2021-03-12 00:16:27,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-12 00:16:27,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-12 00:16:27,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-12 00:16:27,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-03-12 00:16:27,439 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 94 [2021-03-12 00:16:27,440 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 679 transitions, 5884 flow. Second operand has 11 states, 11 states have (on average 51.0) internal successors, (561), 11 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-12 00:16:27,440 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-12 00:16:27,440 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 94 [2021-03-12 00:16:27,440 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand