/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/bakery-3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 19:26:04,177 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 19:26:04,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 19:26:04,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 19:26:04,209 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 19:26:04,212 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 19:26:04,214 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 19:26:04,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 19:26:04,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 19:26:04,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 19:26:04,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 19:26:04,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 19:26:04,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 19:26:04,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 19:26:04,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 19:26:04,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 19:26:04,233 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 19:26:04,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 19:26:04,236 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 19:26:04,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 19:26:04,240 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 19:26:04,242 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 19:26:04,243 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 19:26:04,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 19:26:04,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 19:26:04,254 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 19:26:04,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 19:26:04,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 19:26:04,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 19:26:04,255 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 19:26:04,256 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 19:26:04,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 19:26:04,257 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 19:26:04,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 19:26:04,258 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 19:26:04,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 19:26:04,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 19:26:04,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 19:26:04,259 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 19:26:04,260 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 19:26:04,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 19:26:04,268 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-RepeatedSemanticLbe.epf [2021-03-25 19:26:04,306 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 19:26:04,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 19:26:04,309 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 19:26:04,309 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 19:26:04,309 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 19:26:04,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 19:26:04,310 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 19:26:04,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 19:26:04,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 19:26:04,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 19:26:04,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 19:26:04,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 19:26:04,311 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 19:26:04,311 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 19:26:04,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 19:26:04,312 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 19:26:04,312 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 19:26:04,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 19:26:04,312 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 19:26:04,312 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 19:26:04,312 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 19:26:04,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 19:26:04,313 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 19:26:04,313 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 19:26:04,313 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 19:26:04,313 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 19:26:04,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 19:26:04,313 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 19:26:04,314 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 19:26:04,314 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true 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-25 19:26:04,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 19:26:04,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 19:26:04,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 19:26:04,621 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-03-25 19:26:04,622 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-03-25 19:26:04,623 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-3.wvr.bpl [2021-03-25 19:26:04,632 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/bakery-3.wvr.bpl' [2021-03-25 19:26:04,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 19:26:04,671 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-03-25 19:26:04,672 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 19:26:04,672 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 19:26:04,672 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 19:26:04,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.03 07:26:04" (1/1) ... [2021-03-25 19:26:04,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.03 07:26:04" (1/1) ... [2021-03-25 19:26:04,704 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 19:26:04,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 19:26:04,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 19:26:04,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 19:26:04,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.03 07:26:04" (1/1) ... [2021-03-25 19:26:04,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.03 07:26:04" (1/1) ... [2021-03-25 19:26:04,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.03 07:26:04" (1/1) ... [2021-03-25 19:26:04,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.03 07:26:04" (1/1) ... [2021-03-25 19:26:04,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.03 07:26:04" (1/1) ... [2021-03-25 19:26:04,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.03 07:26:04" (1/1) ... [2021-03-25 19:26:04,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.03 07:26:04" (1/1) ... [2021-03-25 19:26:04,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 19:26:04,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 19:26:04,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 19:26:04,736 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 19:26:04,741 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.03 07:26:04" (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-25 19:26:04,811 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-03-25 19:26:04,811 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-03-25 19:26:04,813 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-03-25 19:26:04,813 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-03-25 19:26:04,813 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-03-25 19:26:04,813 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-03-25 19:26:04,814 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-03-25 19:26:04,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 19:26:04,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 19:26:04,815 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-03-25 19:26:04,815 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-03-25 19:26:04,815 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-03-25 19:26:04,816 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 19:26:04,984 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 19:26:04,984 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-03-25 19:26:04,986 INFO L202 PluginConnector]: Adding new model bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 07:26:04 BoogieIcfgContainer [2021-03-25 19:26:04,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 19:26:04,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 19:26:04,987 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 19:26:04,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 19:26:04,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.03 07:26:04" (1/2) ... [2021-03-25 19:26:04,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6295cbf7 and model type bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 07:26:04, skipping insertion in model container [2021-03-25 19:26:04,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 07:26:04" (2/2) ... [2021-03-25 19:26:04,996 INFO L111 eAbstractionObserver]: Analyzing ICFG bakery-3.wvr.bpl [2021-03-25 19:26:05,001 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 19:26:05,005 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-25 19:26:05,006 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 19:26:05,085 INFO L149 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-03-25 19:26:05,103 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-03-25 19:26:05,123 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 19:26:05,124 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 19:26:05,124 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 19:26:05,124 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 19:26:05,124 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 19:26:05,124 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 19:26:05,124 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 19:26:05,124 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 19:26:05,135 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 53 transitions, 130 flow [2021-03-25 19:26:05,167 INFO L129 PetriNetUnfolder]: 0/50 cut-off events. [2021-03-25 19:26:05,167 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-25 19:26:05,169 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 50 events. 0/50 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 19:26:05,169 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 53 transitions, 130 flow [2021-03-25 19:26:05,172 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 48 transitions, 114 flow [2021-03-25 19:26:05,174 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 19:26:05,187 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 48 transitions, 114 flow [2021-03-25 19:26:05,189 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 48 transitions, 114 flow [2021-03-25 19:26:05,191 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 48 transitions, 114 flow [2021-03-25 19:26:05,222 INFO L129 PetriNetUnfolder]: 0/48 cut-off events. [2021-03-25 19:26:05,222 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-25 19:26:05,222 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 48 events. 0/48 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 80 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 19:26:05,232 INFO L142 LiptonReduction]: Number of co-enabled transitions 1170 [2021-03-25 19:26:05,786 INFO L154 LiptonReduction]: Checked pairs total: 2728 [2021-03-25 19:26:05,786 INFO L156 LiptonReduction]: Total number of compositions: 10 [2021-03-25 19:26:05,788 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 615 [2021-03-25 19:26:05,823 INFO L129 PetriNetUnfolder]: 0/37 cut-off events. [2021-03-25 19:26:05,823 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-25 19:26:05,823 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 19:26:05,824 INFO L263 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] [2021-03-25 19:26:05,825 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 19:26:05,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 19:26:05,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1589473928, now seen corresponding path program 1 times [2021-03-25 19:26:05,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 19:26:05,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698213413] [2021-03-25 19:26:05,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 19:26:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 19:26:06,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:06,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:26:06,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:06,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:26:06,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:06,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:26:06,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:06,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:26:06,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:06,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:26:06,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:06,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:26:06,073 INFO L142 QuantifierPusher]: treesize reduction 9, result has 43.8 percent of original size [2021-03-25 19:26:06,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:26:06,085 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-25 19:26:06,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698213413] [2021-03-25 19:26:06,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 19:26:06,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 19:26:06,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822213895] [2021-03-25 19:26:06,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 19:26:06,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 19:26:06,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 19:26:06,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-03-25 19:26:06,107 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 63 [2021-03-25 19:26:06,109 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 94 flow. Second operand has 9 states, 9 states have (on average 53.888888888888886) internal successors, (485), 9 states have internal predecessors, (485), 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-25 19:26:06,109 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 19:26:06,110 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 63 [2021-03-25 19:26:06,111 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 19:26:06,317 INFO L129 PetriNetUnfolder]: 29/168 cut-off events. [2021-03-25 19:26:06,317 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-03-25 19:26:06,320 INFO L84 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 168 events. 29/168 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 852 event pairs, 3 based on Foata normal form. 1/168 useless extension candidates. Maximal degree in co-relation 249. Up to 28 conditions per place. [2021-03-25 19:26:06,322 INFO L132 encePairwiseOnDemand]: 55/63 looper letters, 21 selfloop transitions, 15 changer transitions 2/68 dead transitions. [2021-03-25 19:26:06,322 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 230 flow [2021-03-25 19:26:06,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 19:26:06,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 19:26:06,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 622 transitions. [2021-03-25 19:26:06,335 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8975468975468975 [2021-03-25 19:26:06,336 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 622 transitions. [2021-03-25 19:26:06,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 622 transitions. [2021-03-25 19:26:06,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 19:26:06,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 622 transitions. [2021-03-25 19:26:06,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 56.54545454545455) internal successors, (622), 11 states have internal predecessors, (622), 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-25 19:26:06,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 63.0) internal successors, (756), 12 states have internal predecessors, (756), 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-25 19:26:06,351 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 63.0) internal successors, (756), 12 states have internal predecessors, (756), 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-25 19:26:06,353 INFO L185 Difference]: Start difference. First operand has 48 places, 38 transitions, 94 flow. Second operand 11 states and 622 transitions. [2021-03-25 19:26:06,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 230 flow [2021-03-25 19:26:06,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 68 transitions, 218 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-03-25 19:26:06,360 INFO L241 Difference]: Finished difference. Result has 56 places, 54 transitions, 174 flow [2021-03-25 19:26:06,362 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=174, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2021-03-25 19:26:06,362 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2021-03-25 19:26:06,362 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 19:26:06,363 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 54 transitions, 174 flow [2021-03-25 19:26:06,363 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 54 transitions, 174 flow [2021-03-25 19:26:06,364 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 54 transitions, 174 flow [2021-03-25 19:26:06,375 INFO L129 PetriNetUnfolder]: 9/112 cut-off events. [2021-03-25 19:26:06,375 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-25 19:26:06,376 INFO L84 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 112 events. 9/112 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 465 event pairs, 2 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 162. Up to 12 conditions per place. [2021-03-25 19:26:06,377 INFO L142 LiptonReduction]: Number of co-enabled transitions 978 [2021-03-25 19:26:06,428 INFO L154 LiptonReduction]: Checked pairs total: 3129 [2021-03-25 19:26:06,428 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 19:26:06,428 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 66 [2021-03-25 19:26:06,429 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 54 transitions, 176 flow [2021-03-25 19:26:06,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 53.888888888888886) internal successors, (485), 9 states have internal predecessors, (485), 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-25 19:26:06,430 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 19:26:06,430 INFO L263 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] [2021-03-25 19:26:06,430 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 19:26:06,431 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 19:26:06,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 19:26:06,431 INFO L82 PathProgramCache]: Analyzing trace with hash -748688888, now seen corresponding path program 2 times [2021-03-25 19:26:06,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 19:26:06,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583766125] [2021-03-25 19:26:06,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 19:26:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 19:26:06,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:06,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 19:26:06,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:06,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 19:26:06,500 INFO L142 QuantifierPusher]: treesize reduction 19, result has 57.8 percent of original size [2021-03-25 19:26:06,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 19:26:06,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:06,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 19:26:06,512 INFO L142 QuantifierPusher]: treesize reduction 7, result has 63.2 percent of original size [2021-03-25 19:26:06,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 19:26:06,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:06,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:26:06,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:06,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 19:26:06,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:06,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:26:06,539 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-25 19:26:06,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583766125] [2021-03-25 19:26:06,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 19:26:06,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 19:26:06,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626470255] [2021-03-25 19:26:06,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 19:26:06,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 19:26:06,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 19:26:06,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 19:26:06,543 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 65 [2021-03-25 19:26:06,544 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 54 transitions, 176 flow. Second operand has 7 states, 7 states have (on average 38.714285714285715) internal successors, (271), 7 states have internal predecessors, (271), 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-25 19:26:06,544 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 19:26:06,544 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 65 [2021-03-25 19:26:06,544 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 19:26:06,939 INFO L129 PetriNetUnfolder]: 865/1981 cut-off events. [2021-03-25 19:26:06,940 INFO L130 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2021-03-25 19:26:06,947 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3871 conditions, 1981 events. 865/1981 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 13885 event pairs, 234 based on Foata normal form. 24/1915 useless extension candidates. Maximal degree in co-relation 3854. Up to 1085 conditions per place. [2021-03-25 19:26:06,957 INFO L132 encePairwiseOnDemand]: 56/65 looper letters, 51 selfloop transitions, 21 changer transitions 0/107 dead transitions. [2021-03-25 19:26:06,958 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 107 transitions, 426 flow [2021-03-25 19:26:06,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 19:26:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 19:26:06,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 361 transitions. [2021-03-25 19:26:06,960 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6942307692307692 [2021-03-25 19:26:06,960 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 361 transitions. [2021-03-25 19:26:06,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 361 transitions. [2021-03-25 19:26:06,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 19:26:06,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 361 transitions. [2021-03-25 19:26:06,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 45.125) internal successors, (361), 8 states have internal predecessors, (361), 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-25 19:26:06,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 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-25 19:26:06,964 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 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-25 19:26:06,964 INFO L185 Difference]: Start difference. First operand has 54 places, 54 transitions, 176 flow. Second operand 8 states and 361 transitions. [2021-03-25 19:26:06,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 107 transitions, 426 flow [2021-03-25 19:26:06,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 107 transitions, 424 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-25 19:26:06,970 INFO L241 Difference]: Finished difference. Result has 64 places, 75 transitions, 300 flow [2021-03-25 19:26:06,970 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=300, PETRI_PLACES=64, PETRI_TRANSITIONS=75} [2021-03-25 19:26:06,971 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2021-03-25 19:26:06,971 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 19:26:06,971 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 75 transitions, 300 flow [2021-03-25 19:26:06,972 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 75 transitions, 300 flow [2021-03-25 19:26:06,972 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 75 transitions, 300 flow [2021-03-25 19:26:07,026 INFO L129 PetriNetUnfolder]: 66/391 cut-off events. [2021-03-25 19:26:07,026 INFO L130 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2021-03-25 19:26:07,042 INFO L84 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 391 events. 66/391 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2647 event pairs, 14 based on Foata normal form. 0/378 useless extension candidates. Maximal degree in co-relation 668. Up to 71 conditions per place. [2021-03-25 19:26:07,051 INFO L142 LiptonReduction]: Number of co-enabled transitions 1276 [2021-03-25 19:26:07,094 INFO L154 LiptonReduction]: Checked pairs total: 1563 [2021-03-25 19:26:07,094 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 19:26:07,094 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 123 [2021-03-25 19:26:07,095 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 75 transitions, 300 flow [2021-03-25 19:26:07,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 38.714285714285715) internal successors, (271), 7 states have internal predecessors, (271), 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-25 19:26:07,096 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 19:26:07,096 INFO L263 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] [2021-03-25 19:26:07,096 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 19:26:07,096 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 19:26:07,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 19:26:07,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1721158409, now seen corresponding path program 1 times [2021-03-25 19:26:07,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 19:26:07,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069135101] [2021-03-25 19:26:07,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 19:26:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 19:26:07,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:07,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:26:07,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:07,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:26:07,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:07,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:26:07,121 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-25 19:26:07,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069135101] [2021-03-25 19:26:07,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 19:26:07,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 19:26:07,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172285469] [2021-03-25 19:26:07,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 19:26:07,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 19:26:07,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 19:26:07,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 19:26:07,123 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 65 [2021-03-25 19:26:07,123 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 75 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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-25 19:26:07,123 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 19:26:07,123 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 65 [2021-03-25 19:26:07,123 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 19:26:07,167 INFO L129 PetriNetUnfolder]: 72/401 cut-off events. [2021-03-25 19:26:07,168 INFO L130 PetriNetUnfolder]: For 116/122 co-relation queries the response was YES. [2021-03-25 19:26:07,169 INFO L84 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 401 events. 72/401 cut-off events. For 116/122 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2629 event pairs, 19 based on Foata normal form. 19/406 useless extension candidates. Maximal degree in co-relation 753. Up to 60 conditions per place. [2021-03-25 19:26:07,171 INFO L132 encePairwiseOnDemand]: 61/65 looper letters, 3 selfloop transitions, 8 changer transitions 0/75 dead transitions. [2021-03-25 19:26:07,171 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 75 transitions, 322 flow [2021-03-25 19:26:07,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 19:26:07,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 19:26:07,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 178 transitions. [2021-03-25 19:26:07,172 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9128205128205128 [2021-03-25 19:26:07,172 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 178 transitions. [2021-03-25 19:26:07,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 178 transitions. [2021-03-25 19:26:07,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 19:26:07,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 178 transitions. [2021-03-25 19:26:07,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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-25 19:26:07,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 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-25 19:26:07,174 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 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-25 19:26:07,174 INFO L185 Difference]: Start difference. First operand has 64 places, 75 transitions, 300 flow. Second operand 3 states and 178 transitions. [2021-03-25 19:26:07,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 75 transitions, 322 flow [2021-03-25 19:26:07,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 75 transitions, 322 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 19:26:07,178 INFO L241 Difference]: Finished difference. Result has 67 places, 75 transitions, 328 flow [2021-03-25 19:26:07,178 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=67, PETRI_TRANSITIONS=75} [2021-03-25 19:26:07,178 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2021-03-25 19:26:07,178 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 19:26:07,179 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 75 transitions, 328 flow [2021-03-25 19:26:07,179 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 75 transitions, 328 flow [2021-03-25 19:26:07,179 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 75 transitions, 328 flow [2021-03-25 19:26:07,204 INFO L129 PetriNetUnfolder]: 73/426 cut-off events. [2021-03-25 19:26:07,204 INFO L130 PetriNetUnfolder]: For 149/149 co-relation queries the response was YES. [2021-03-25 19:26:07,206 INFO L84 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 426 events. 73/426 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2863 event pairs, 23 based on Foata normal form. 0/418 useless extension candidates. Maximal degree in co-relation 815. Up to 68 conditions per place. [2021-03-25 19:26:07,209 INFO L142 LiptonReduction]: Number of co-enabled transitions 1194 [2021-03-25 19:26:07,245 INFO L154 LiptonReduction]: Checked pairs total: 1237 [2021-03-25 19:26:07,245 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 19:26:07,245 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 67 [2021-03-25 19:26:07,246 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 75 transitions, 328 flow [2021-03-25 19:26:07,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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-25 19:26:07,246 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 19:26:07,247 INFO L263 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] [2021-03-25 19:26:07,247 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 19:26:07,247 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 19:26:07,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 19:26:07,247 INFO L82 PathProgramCache]: Analyzing trace with hash 590375385, now seen corresponding path program 2 times [2021-03-25 19:26:07,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 19:26:07,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320026950] [2021-03-25 19:26:07,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 19:26:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 19:26:07,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:07,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 19:26:07,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:07,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 19:26:07,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:07,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:26:07,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:07,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:26:07,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:07,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 19:26:07,317 INFO L142 QuantifierPusher]: treesize reduction 7, result has 50.0 percent of original size [2021-03-25 19:26:07,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:26:07,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:07,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 19:26:07,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:07,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:26:07,337 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-25 19:26:07,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320026950] [2021-03-25 19:26:07,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 19:26:07,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 19:26:07,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759023182] [2021-03-25 19:26:07,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 19:26:07,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 19:26:07,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 19:26:07,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-03-25 19:26:07,339 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 65 [2021-03-25 19:26:07,340 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 75 transitions, 328 flow. Second operand has 8 states, 8 states have (on average 38.375) internal successors, (307), 8 states have internal predecessors, (307), 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-25 19:26:07,340 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 19:26:07,340 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 65 [2021-03-25 19:26:07,340 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 19:26:07,931 INFO L129 PetriNetUnfolder]: 1731/3913 cut-off events. [2021-03-25 19:26:07,931 INFO L130 PetriNetUnfolder]: For 1728/1766 co-relation queries the response was YES. [2021-03-25 19:26:07,946 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9462 conditions, 3913 events. 1731/3913 cut-off events. For 1728/1766 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 31905 event pairs, 345 based on Foata normal form. 41/3819 useless extension candidates. Maximal degree in co-relation 9324. Up to 1389 conditions per place. [2021-03-25 19:26:07,965 INFO L132 encePairwiseOnDemand]: 52/65 looper letters, 93 selfloop transitions, 63 changer transitions 0/191 dead transitions. [2021-03-25 19:26:07,965 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 191 transitions, 1028 flow [2021-03-25 19:26:07,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 19:26:07,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 19:26:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 522 transitions. [2021-03-25 19:26:07,967 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.73006993006993 [2021-03-25 19:26:07,967 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 522 transitions. [2021-03-25 19:26:07,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 522 transitions. [2021-03-25 19:26:07,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 19:26:07,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 522 transitions. [2021-03-25 19:26:07,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 47.45454545454545) internal successors, (522), 11 states have internal predecessors, (522), 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-25 19:26:07,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 65.0) internal successors, (780), 12 states have internal predecessors, (780), 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-25 19:26:07,970 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 65.0) internal successors, (780), 12 states have internal predecessors, (780), 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-25 19:26:07,970 INFO L185 Difference]: Start difference. First operand has 67 places, 75 transitions, 328 flow. Second operand 11 states and 522 transitions. [2021-03-25 19:26:07,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 191 transitions, 1028 flow [2021-03-25 19:26:07,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 191 transitions, 1000 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 19:26:07,986 INFO L241 Difference]: Finished difference. Result has 83 places, 126 transitions, 776 flow [2021-03-25 19:26:07,987 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=776, PETRI_PLACES=83, PETRI_TRANSITIONS=126} [2021-03-25 19:26:07,987 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 35 predicate places. [2021-03-25 19:26:07,987 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 19:26:07,987 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 126 transitions, 776 flow [2021-03-25 19:26:07,987 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 126 transitions, 776 flow [2021-03-25 19:26:07,988 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 126 transitions, 776 flow [2021-03-25 19:26:08,111 INFO L129 PetriNetUnfolder]: 349/1271 cut-off events. [2021-03-25 19:26:08,112 INFO L130 PetriNetUnfolder]: For 912/939 co-relation queries the response was YES. [2021-03-25 19:26:08,118 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3297 conditions, 1271 events. 349/1271 cut-off events. For 912/939 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10683 event pairs, 69 based on Foata normal form. 4/1201 useless extension candidates. Maximal degree in co-relation 3197. Up to 256 conditions per place. [2021-03-25 19:26:08,131 INFO L142 LiptonReduction]: Number of co-enabled transitions 2104 [2021-03-25 19:26:08,504 INFO L154 LiptonReduction]: Checked pairs total: 4334 [2021-03-25 19:26:08,504 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 19:26:08,504 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 517 [2021-03-25 19:26:08,505 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 126 transitions, 778 flow [2021-03-25 19:26:08,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 38.375) internal successors, (307), 8 states have internal predecessors, (307), 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-25 19:26:08,505 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 19:26:08,506 INFO L263 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] [2021-03-25 19:26:08,506 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 19:26:08,506 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 19:26:08,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 19:26:08,506 INFO L82 PathProgramCache]: Analyzing trace with hash -521920061, now seen corresponding path program 3 times [2021-03-25 19:26:08,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 19:26:08,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92959234] [2021-03-25 19:26:08,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 19:26:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 19:26:08,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:08,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:26:08,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:08,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:26:08,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:08,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:26:08,526 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-25 19:26:08,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92959234] [2021-03-25 19:26:08,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 19:26:08,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 19:26:08,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18883297] [2021-03-25 19:26:08,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 19:26:08,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 19:26:08,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 19:26:08,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 19:26:08,528 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 66 [2021-03-25 19:26:08,529 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 126 transitions, 778 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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-25 19:26:08,529 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 19:26:08,529 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 66 [2021-03-25 19:26:08,529 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 19:26:08,656 INFO L129 PetriNetUnfolder]: 338/1396 cut-off events. [2021-03-25 19:26:08,657 INFO L130 PetriNetUnfolder]: For 1180/1204 co-relation queries the response was YES. [2021-03-25 19:26:08,664 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3778 conditions, 1396 events. 338/1396 cut-off events. For 1180/1204 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12358 event pairs, 63 based on Foata normal form. 49/1378 useless extension candidates. Maximal degree in co-relation 3668. Up to 271 conditions per place. [2021-03-25 19:26:08,670 INFO L132 encePairwiseOnDemand]: 62/66 looper letters, 3 selfloop transitions, 25 changer transitions 0/126 dead transitions. [2021-03-25 19:26:08,670 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 126 transitions, 834 flow [2021-03-25 19:26:08,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 19:26:08,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 19:26:08,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2021-03-25 19:26:08,671 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9141414141414141 [2021-03-25 19:26:08,671 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 181 transitions. [2021-03-25 19:26:08,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 181 transitions. [2021-03-25 19:26:08,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 19:26:08,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 181 transitions. [2021-03-25 19:26:08,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 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-25 19:26:08,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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-25 19:26:08,673 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 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-25 19:26:08,673 INFO L185 Difference]: Start difference. First operand has 83 places, 126 transitions, 778 flow. Second operand 3 states and 181 transitions. [2021-03-25 19:26:08,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 126 transitions, 834 flow [2021-03-25 19:26:08,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 126 transitions, 808 flow, removed 13 selfloop flow, removed 0 redundant places. [2021-03-25 19:26:08,685 INFO L241 Difference]: Finished difference. Result has 86 places, 126 transitions, 831 flow [2021-03-25 19:26:08,685 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=831, PETRI_PLACES=86, PETRI_TRANSITIONS=126} [2021-03-25 19:26:08,685 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 38 predicate places. [2021-03-25 19:26:08,685 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 19:26:08,686 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 126 transitions, 831 flow [2021-03-25 19:26:08,686 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 126 transitions, 831 flow [2021-03-25 19:26:08,687 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 126 transitions, 831 flow [2021-03-25 19:26:08,791 INFO L129 PetriNetUnfolder]: 350/1380 cut-off events. [2021-03-25 19:26:08,791 INFO L130 PetriNetUnfolder]: For 1157/1168 co-relation queries the response was YES. [2021-03-25 19:26:08,798 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3746 conditions, 1380 events. 350/1380 cut-off events. For 1157/1168 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12150 event pairs, 70 based on Foata normal form. 2/1321 useless extension candidates. Maximal degree in co-relation 3638. Up to 268 conditions per place. [2021-03-25 19:26:08,810 INFO L142 LiptonReduction]: Number of co-enabled transitions 1868 [2021-03-25 19:26:09,110 INFO L154 LiptonReduction]: Checked pairs total: 3396 [2021-03-25 19:26:09,110 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 19:26:09,111 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 426 [2021-03-25 19:26:09,111 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 126 transitions, 833 flow [2021-03-25 19:26:09,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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-25 19:26:09,112 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 19:26:09,112 INFO L263 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] [2021-03-25 19:26:09,112 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 19:26:09,112 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 19:26:09,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 19:26:09,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1392032748, now seen corresponding path program 1 times [2021-03-25 19:26:09,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 19:26:09,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359142486] [2021-03-25 19:26:09,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 19:26:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 19:26:09,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:09,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:26:09,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:09,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:26:09,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:09,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:26:09,129 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-25 19:26:09,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359142486] [2021-03-25 19:26:09,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 19:26:09,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 19:26:09,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584980705] [2021-03-25 19:26:09,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 19:26:09,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 19:26:09,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 19:26:09,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 19:26:09,131 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 67 [2021-03-25 19:26:09,131 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 126 transitions, 833 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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-25 19:26:09,131 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 19:26:09,131 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 67 [2021-03-25 19:26:09,131 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 19:26:09,303 INFO L129 PetriNetUnfolder]: 458/1778 cut-off events. [2021-03-25 19:26:09,303 INFO L130 PetriNetUnfolder]: For 1649/1673 co-relation queries the response was YES. [2021-03-25 19:26:09,314 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4871 conditions, 1778 events. 458/1778 cut-off events. For 1649/1673 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 16227 event pairs, 104 based on Foata normal form. 32/1695 useless extension candidates. Maximal degree in co-relation 4732. Up to 349 conditions per place. [2021-03-25 19:26:09,322 INFO L132 encePairwiseOnDemand]: 62/67 looper letters, 3 selfloop transitions, 12 changer transitions 0/125 dead transitions. [2021-03-25 19:26:09,322 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 125 transitions, 856 flow [2021-03-25 19:26:09,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 19:26:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 19:26:09,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2021-03-25 19:26:09,323 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9054726368159204 [2021-03-25 19:26:09,324 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 182 transitions. [2021-03-25 19:26:09,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 182 transitions. [2021-03-25 19:26:09,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 19:26:09,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 182 transitions. [2021-03-25 19:26:09,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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-25 19:26:09,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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-25 19:26:09,325 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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-25 19:26:09,325 INFO L185 Difference]: Start difference. First operand has 86 places, 126 transitions, 833 flow. Second operand 3 states and 182 transitions. [2021-03-25 19:26:09,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 125 transitions, 856 flow [2021-03-25 19:26:09,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 125 transitions, 806 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 19:26:09,341 INFO L241 Difference]: Finished difference. Result has 87 places, 125 transitions, 816 flow [2021-03-25 19:26:09,342 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=87, PETRI_TRANSITIONS=125} [2021-03-25 19:26:09,342 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 39 predicate places. [2021-03-25 19:26:09,342 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 19:26:09,342 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 125 transitions, 816 flow [2021-03-25 19:26:09,342 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 125 transitions, 816 flow [2021-03-25 19:26:09,343 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 125 transitions, 816 flow [2021-03-25 19:26:09,491 INFO L129 PetriNetUnfolder]: 446/1705 cut-off events. [2021-03-25 19:26:09,492 INFO L130 PetriNetUnfolder]: For 1436/1450 co-relation queries the response was YES. [2021-03-25 19:26:09,500 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4619 conditions, 1705 events. 446/1705 cut-off events. For 1436/1450 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 15539 event pairs, 114 based on Foata normal form. 5/1611 useless extension candidates. Maximal degree in co-relation 4488. Up to 331 conditions per place. [2021-03-25 19:26:09,516 INFO L142 LiptonReduction]: Number of co-enabled transitions 1794 [2021-03-25 19:26:09,997 INFO L154 LiptonReduction]: Checked pairs total: 1941 [2021-03-25 19:26:09,997 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 19:26:09,997 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 655 [2021-03-25 19:26:09,998 INFO L480 AbstractCegarLoop]: Abstraction has has 87 places, 125 transitions, 822 flow [2021-03-25 19:26:09,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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-25 19:26:09,998 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 19:26:09,998 INFO L263 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] [2021-03-25 19:26:09,999 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 19:26:09,999 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 19:26:09,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 19:26:09,999 INFO L82 PathProgramCache]: Analyzing trace with hash 355761542, now seen corresponding path program 2 times [2021-03-25 19:26:09,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 19:26:09,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694895444] [2021-03-25 19:26:10,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 19:26:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 19:26:10,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:10,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 19:26:10,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:10,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 19:26:10,080 INFO L142 QuantifierPusher]: treesize reduction 17, result has 62.2 percent of original size [2021-03-25 19:26:10,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 19:26:10,088 INFO L142 QuantifierPusher]: treesize reduction 17, result has 59.5 percent of original size [2021-03-25 19:26:10,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 19:26:10,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:10,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 19:26:10,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:10,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 19:26:10,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:10,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 19:26:10,127 INFO L142 QuantifierPusher]: treesize reduction 5, result has 70.6 percent of original size [2021-03-25 19:26:10,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 19:26:10,138 INFO L142 QuantifierPusher]: treesize reduction 15, result has 46.4 percent of original size [2021-03-25 19:26:10,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 19:26:10,151 INFO L142 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-03-25 19:26:10,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:26:10,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:10,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:26:10,153 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-25 19:26:10,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694895444] [2021-03-25 19:26:10,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 19:26:10,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 19:26:10,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442356573] [2021-03-25 19:26:10,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 19:26:10,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 19:26:10,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 19:26:10,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-03-25 19:26:10,155 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 70 [2021-03-25 19:26:10,156 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 125 transitions, 822 flow. Second operand has 8 states, 8 states have (on average 38.375) internal successors, (307), 8 states have internal predecessors, (307), 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-25 19:26:10,156 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 19:26:10,156 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 70 [2021-03-25 19:26:10,156 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 19:26:10,764 INFO L129 PetriNetUnfolder]: 2046/4799 cut-off events. [2021-03-25 19:26:10,764 INFO L130 PetriNetUnfolder]: For 6854/6998 co-relation queries the response was YES. [2021-03-25 19:26:10,785 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15485 conditions, 4799 events. 2046/4799 cut-off events. For 6854/6998 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 41152 event pairs, 618 based on Foata normal form. 48/4625 useless extension candidates. Maximal degree in co-relation 15295. Up to 2312 conditions per place. [2021-03-25 19:26:10,809 INFO L132 encePairwiseOnDemand]: 58/70 looper letters, 120 selfloop transitions, 45 changer transitions 0/200 dead transitions. [2021-03-25 19:26:10,810 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 200 transitions, 1633 flow [2021-03-25 19:26:10,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 19:26:10,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 19:26:10,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 329 transitions. [2021-03-25 19:26:10,811 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6714285714285714 [2021-03-25 19:26:10,811 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 329 transitions. [2021-03-25 19:26:10,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 329 transitions. [2021-03-25 19:26:10,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 19:26:10,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 329 transitions. [2021-03-25 19:26:10,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 47.0) internal successors, (329), 7 states have internal predecessors, (329), 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-25 19:26:10,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 70.0) internal successors, (560), 8 states have internal predecessors, (560), 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-25 19:26:10,814 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 70.0) internal successors, (560), 8 states have internal predecessors, (560), 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-25 19:26:10,814 INFO L185 Difference]: Start difference. First operand has 87 places, 125 transitions, 822 flow. Second operand 7 states and 329 transitions. [2021-03-25 19:26:10,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 200 transitions, 1633 flow [2021-03-25 19:26:10,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 200 transitions, 1587 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 19:26:10,851 INFO L241 Difference]: Finished difference. Result has 95 places, 153 transitions, 1181 flow [2021-03-25 19:26:10,852 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1181, PETRI_PLACES=95, PETRI_TRANSITIONS=153} [2021-03-25 19:26:10,852 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 47 predicate places. [2021-03-25 19:26:10,852 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 19:26:10,852 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 153 transitions, 1181 flow [2021-03-25 19:26:10,852 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 153 transitions, 1181 flow [2021-03-25 19:26:10,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 95 places, 153 transitions, 1181 flow [2021-03-25 19:26:11,007 INFO L129 PetriNetUnfolder]: 573/2121 cut-off events. [2021-03-25 19:26:11,007 INFO L130 PetriNetUnfolder]: For 2457/2481 co-relation queries the response was YES. [2021-03-25 19:26:11,020 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6433 conditions, 2121 events. 573/2121 cut-off events. For 2457/2481 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 19932 event pairs, 151 based on Foata normal form. 7/2009 useless extension candidates. Maximal degree in co-relation 6282. Up to 439 conditions per place. [2021-03-25 19:26:11,041 INFO L142 LiptonReduction]: Number of co-enabled transitions 2052 [2021-03-25 19:26:11,596 INFO L154 LiptonReduction]: Checked pairs total: 1905 [2021-03-25 19:26:11,596 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 19:26:11,597 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 745 [2021-03-25 19:26:11,597 INFO L480 AbstractCegarLoop]: Abstraction has has 95 places, 153 transitions, 1183 flow [2021-03-25 19:26:11,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 38.375) internal successors, (307), 8 states have internal predecessors, (307), 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-25 19:26:11,598 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 19:26:11,598 INFO L263 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] [2021-03-25 19:26:11,598 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 19:26:11,598 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 19:26:11,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 19:26:11,599 INFO L82 PathProgramCache]: Analyzing trace with hash 899971332, now seen corresponding path program 3 times [2021-03-25 19:26:11,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 19:26:11,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434454784] [2021-03-25 19:26:11,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 19:26:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 19:26:11,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:11,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 19:26:11,657 INFO L142 QuantifierPusher]: treesize reduction 6, result has 62.5 percent of original size [2021-03-25 19:26:11,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 19:26:11,661 INFO L142 QuantifierPusher]: treesize reduction 6, result has 53.8 percent of original size [2021-03-25 19:26:11,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:26:11,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:11,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:26:11,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:11,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:26:11,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:11,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 19:26:11,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:11,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:26:11,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:11,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:26:11,692 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-25 19:26:11,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434454784] [2021-03-25 19:26:11,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 19:26:11,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 19:26:11,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784180760] [2021-03-25 19:26:11,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 19:26:11,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 19:26:11,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 19:26:11,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-03-25 19:26:11,696 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 71 [2021-03-25 19:26:11,697 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 153 transitions, 1183 flow. Second operand has 7 states, 7 states have (on average 38.714285714285715) internal successors, (271), 7 states have internal predecessors, (271), 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-25 19:26:11,697 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 19:26:11,697 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 71 [2021-03-25 19:26:11,697 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 19:26:12,391 INFO L129 PetriNetUnfolder]: 2175/5128 cut-off events. [2021-03-25 19:26:12,391 INFO L130 PetriNetUnfolder]: For 9029/9262 co-relation queries the response was YES. [2021-03-25 19:26:12,427 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17385 conditions, 5128 events. 2175/5128 cut-off events. For 9029/9262 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 44919 event pairs, 577 based on Foata normal form. 89/4979 useless extension candidates. Maximal degree in co-relation 17186. Up to 1774 conditions per place. [2021-03-25 19:26:12,457 INFO L132 encePairwiseOnDemand]: 57/71 looper letters, 142 selfloop transitions, 59 changer transitions 0/236 dead transitions. [2021-03-25 19:26:12,457 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 236 transitions, 2109 flow [2021-03-25 19:26:12,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 19:26:12,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 19:26:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 343 transitions. [2021-03-25 19:26:12,459 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6901408450704225 [2021-03-25 19:26:12,459 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 343 transitions. [2021-03-25 19:26:12,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 343 transitions. [2021-03-25 19:26:12,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 19:26:12,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 343 transitions. [2021-03-25 19:26:12,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 49.0) internal successors, (343), 7 states have internal predecessors, (343), 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-25 19:26:12,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 71.0) internal successors, (568), 8 states have internal predecessors, (568), 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-25 19:26:12,462 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 71.0) internal successors, (568), 8 states have internal predecessors, (568), 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-25 19:26:12,462 INFO L185 Difference]: Start difference. First operand has 95 places, 153 transitions, 1183 flow. Second operand 7 states and 343 transitions. [2021-03-25 19:26:12,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 236 transitions, 2109 flow [2021-03-25 19:26:12,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 236 transitions, 2095 flow, removed 7 selfloop flow, removed 0 redundant places. [2021-03-25 19:26:12,515 INFO L241 Difference]: Finished difference. Result has 106 places, 181 transitions, 1650 flow [2021-03-25 19:26:12,515 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1650, PETRI_PLACES=106, PETRI_TRANSITIONS=181} [2021-03-25 19:26:12,516 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 58 predicate places. [2021-03-25 19:26:12,516 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 19:26:12,517 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 181 transitions, 1650 flow [2021-03-25 19:26:12,517 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 181 transitions, 1650 flow [2021-03-25 19:26:12,518 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 181 transitions, 1650 flow [2021-03-25 19:26:12,669 INFO L129 PetriNetUnfolder]: 608/2224 cut-off events. [2021-03-25 19:26:12,669 INFO L130 PetriNetUnfolder]: For 3799/3858 co-relation queries the response was YES. [2021-03-25 19:26:12,682 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7332 conditions, 2224 events. 608/2224 cut-off events. For 3799/3858 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 21076 event pairs, 152 based on Foata normal form. 18/2094 useless extension candidates. Maximal degree in co-relation 7172. Up to 427 conditions per place. [2021-03-25 19:26:12,704 INFO L142 LiptonReduction]: Number of co-enabled transitions 2156 [2021-03-25 19:26:13,292 INFO L154 LiptonReduction]: Checked pairs total: 1535 [2021-03-25 19:26:13,293 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 19:26:13,293 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 777 [2021-03-25 19:26:13,294 INFO L480 AbstractCegarLoop]: Abstraction has has 106 places, 181 transitions, 1654 flow [2021-03-25 19:26:13,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 38.714285714285715) internal successors, (271), 7 states have internal predecessors, (271), 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-25 19:26:13,294 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 19:26:13,294 INFO L263 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] [2021-03-25 19:26:13,294 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 19:26:13,294 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 19:26:13,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 19:26:13,295 INFO L82 PathProgramCache]: Analyzing trace with hash -324424872, now seen corresponding path program 1 times [2021-03-25 19:26:13,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 19:26:13,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943662859] [2021-03-25 19:26:13,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 19:26:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 19:26:13,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:13,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 19:26:13,337 INFO L142 QuantifierPusher]: treesize reduction 7, result has 68.2 percent of original size [2021-03-25 19:26:13,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 19:26:13,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:13,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 19:26:13,353 INFO L142 QuantifierPusher]: treesize reduction 7, result has 50.0 percent of original size [2021-03-25 19:26:13,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:26:13,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:13,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 19:26:13,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:13,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 19:26:13,400 INFO L142 QuantifierPusher]: treesize reduction 16, result has 54.3 percent of original size [2021-03-25 19:26:13,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 19:26:13,415 INFO L142 QuantifierPusher]: treesize reduction 16, result has 54.3 percent of original size [2021-03-25 19:26:13,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 19:26:13,431 INFO L142 QuantifierPusher]: treesize reduction 1, result has 87.5 percent of original size [2021-03-25 19:26:13,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:26:13,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:13,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:26:13,441 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-25 19:26:13,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943662859] [2021-03-25 19:26:13,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 19:26:13,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 19:26:13,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054095969] [2021-03-25 19:26:13,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 19:26:13,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 19:26:13,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 19:26:13,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-03-25 19:26:13,443 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 73 [2021-03-25 19:26:13,443 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 181 transitions, 1654 flow. Second operand has 11 states, 11 states have (on average 37.72727272727273) internal successors, (415), 11 states have internal predecessors, (415), 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-25 19:26:13,443 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 19:26:13,443 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 73 [2021-03-25 19:26:13,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 19:26:15,006 INFO L129 PetriNetUnfolder]: 4666/10859 cut-off events. [2021-03-25 19:26:15,006 INFO L130 PetriNetUnfolder]: For 25396/25907 co-relation queries the response was YES. [2021-03-25 19:26:15,087 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39109 conditions, 10859 events. 4666/10859 cut-off events. For 25396/25907 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 109210 event pairs, 1389 based on Foata normal form. 96/10301 useless extension candidates. Maximal degree in co-relation 38924. Up to 3196 conditions per place. [2021-03-25 19:26:15,135 INFO L132 encePairwiseOnDemand]: 57/73 looper letters, 239 selfloop transitions, 129 changer transitions 0/403 dead transitions. [2021-03-25 19:26:15,136 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 403 transitions, 4165 flow [2021-03-25 19:26:15,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-25 19:26:15,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-03-25 19:26:15,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 635 transitions. [2021-03-25 19:26:15,138 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6213307240704501 [2021-03-25 19:26:15,138 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 635 transitions. [2021-03-25 19:26:15,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 635 transitions. [2021-03-25 19:26:15,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 19:26:15,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 635 transitions. [2021-03-25 19:26:15,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 45.357142857142854) internal successors, (635), 14 states have internal predecessors, (635), 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-25 19:26:15,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 73.0) internal successors, (1095), 15 states have internal predecessors, (1095), 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-25 19:26:15,143 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 73.0) internal successors, (1095), 15 states have internal predecessors, (1095), 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-25 19:26:15,143 INFO L185 Difference]: Start difference. First operand has 106 places, 181 transitions, 1654 flow. Second operand 14 states and 635 transitions. [2021-03-25 19:26:15,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 403 transitions, 4165 flow [2021-03-25 19:26:15,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 403 transitions, 4139 flow, removed 13 selfloop flow, removed 0 redundant places. [2021-03-25 19:26:15,299 INFO L241 Difference]: Finished difference. Result has 131 places, 285 transitions, 3158 flow [2021-03-25 19:26:15,299 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=1642, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3158, PETRI_PLACES=131, PETRI_TRANSITIONS=285} [2021-03-25 19:26:15,299 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 83 predicate places. [2021-03-25 19:26:15,300 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 19:26:15,300 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 285 transitions, 3158 flow [2021-03-25 19:26:15,300 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 285 transitions, 3158 flow [2021-03-25 19:26:15,302 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 285 transitions, 3158 flow [2021-03-25 19:26:15,816 INFO L129 PetriNetUnfolder]: 1836/5529 cut-off events. [2021-03-25 19:26:15,816 INFO L130 PetriNetUnfolder]: For 16048/16223 co-relation queries the response was YES. [2021-03-25 19:26:15,861 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20260 conditions, 5529 events. 1836/5529 cut-off events. For 16048/16223 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 58636 event pairs, 497 based on Foata normal form. 51/5100 useless extension candidates. Maximal degree in co-relation 20028. Up to 1227 conditions per place. [2021-03-25 19:26:15,924 INFO L142 LiptonReduction]: Number of co-enabled transitions 3220 [2021-03-25 19:26:22,101 INFO L154 LiptonReduction]: Checked pairs total: 1322 [2021-03-25 19:26:22,101 INFO L156 LiptonReduction]: Total number of compositions: 10 [2021-03-25 19:26:22,101 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6801 [2021-03-25 19:26:22,102 INFO L480 AbstractCegarLoop]: Abstraction has has 131 places, 285 transitions, 3178 flow [2021-03-25 19:26:22,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 37.72727272727273) internal successors, (415), 11 states have internal predecessors, (415), 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-25 19:26:22,102 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 19:26:22,102 INFO L263 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] [2021-03-25 19:26:22,102 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 19:26:22,102 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 19:26:22,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 19:26:22,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1840607342, now seen corresponding path program 2 times [2021-03-25 19:26:22,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 19:26:22,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540770150] [2021-03-25 19:26:22,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 19:26:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 19:26:22,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:22,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 19:26:22,141 INFO L142 QuantifierPusher]: treesize reduction 7, result has 72.0 percent of original size [2021-03-25 19:26:22,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 19:26:22,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:22,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 19:26:22,162 INFO L142 QuantifierPusher]: treesize reduction 19, result has 26.9 percent of original size [2021-03-25 19:26:22,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:26:22,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:22,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 19:26:22,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:22,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 19:26:22,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:22,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 19:26:22,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:22,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 19:26:22,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:22,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 19:26:22,250 INFO L142 QuantifierPusher]: treesize reduction 8, result has 50.0 percent of original size [2021-03-25 19:26:22,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 19:26:22,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:22,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:26:22,261 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-25 19:26:22,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540770150] [2021-03-25 19:26:22,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 19:26:22,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 19:26:22,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861285821] [2021-03-25 19:26:22,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 19:26:22,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 19:26:22,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 19:26:22,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-03-25 19:26:22,262 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2021-03-25 19:26:22,263 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 285 transitions, 3178 flow. Second operand has 12 states, 12 states have (on average 37.583333333333336) internal successors, (451), 12 states have internal predecessors, (451), 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-25 19:26:22,263 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 19:26:22,263 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2021-03-25 19:26:22,263 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 19:26:23,915 INFO L129 PetriNetUnfolder]: 3832/9202 cut-off events. [2021-03-25 19:26:23,916 INFO L130 PetriNetUnfolder]: For 41906/42477 co-relation queries the response was YES. [2021-03-25 19:26:23,978 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39782 conditions, 9202 events. 3832/9202 cut-off events. For 41906/42477 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 91811 event pairs, 1161 based on Foata normal form. 305/8994 useless extension candidates. Maximal degree in co-relation 39579. Up to 2901 conditions per place. [2021-03-25 19:26:24,018 INFO L132 encePairwiseOnDemand]: 63/83 looper letters, 251 selfloop transitions, 184 changer transitions 0/470 dead transitions. [2021-03-25 19:26:24,018 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 470 transitions, 5704 flow [2021-03-25 19:26:24,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-03-25 19:26:24,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-03-25 19:26:24,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 947 transitions. [2021-03-25 19:26:24,021 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5433161216293746 [2021-03-25 19:26:24,021 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 947 transitions. [2021-03-25 19:26:24,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 947 transitions. [2021-03-25 19:26:24,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 19:26:24,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 947 transitions. [2021-03-25 19:26:24,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 45.095238095238095) internal successors, (947), 21 states have internal predecessors, (947), 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-25 19:26:24,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 83.0) internal successors, (1826), 22 states have internal predecessors, (1826), 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-25 19:26:24,026 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 83.0) internal successors, (1826), 22 states have internal predecessors, (1826), 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-25 19:26:24,026 INFO L185 Difference]: Start difference. First operand has 131 places, 285 transitions, 3178 flow. Second operand 21 states and 947 transitions. [2021-03-25 19:26:24,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 470 transitions, 5704 flow [2021-03-25 19:26:24,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 470 transitions, 5493 flow, removed 105 selfloop flow, removed 4 redundant places. [2021-03-25 19:26:24,285 INFO L241 Difference]: Finished difference. Result has 159 places, 347 transitions, 4375 flow [2021-03-25 19:26:24,286 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=2742, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4375, PETRI_PLACES=159, PETRI_TRANSITIONS=347} [2021-03-25 19:26:24,287 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 111 predicate places. [2021-03-25 19:26:24,288 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 19:26:24,288 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 347 transitions, 4375 flow [2021-03-25 19:26:24,288 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 347 transitions, 4375 flow [2021-03-25 19:26:24,291 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 159 places, 347 transitions, 4375 flow [2021-03-25 19:26:24,724 INFO L129 PetriNetUnfolder]: 1656/5133 cut-off events. [2021-03-25 19:26:24,724 INFO L130 PetriNetUnfolder]: For 23660/23971 co-relation queries the response was YES. [2021-03-25 19:26:24,759 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21953 conditions, 5133 events. 1656/5133 cut-off events. For 23660/23971 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 53912 event pairs, 423 based on Foata normal form. 53/4778 useless extension candidates. Maximal degree in co-relation 21742. Up to 1090 conditions per place. [2021-03-25 19:26:24,811 INFO L142 LiptonReduction]: Number of co-enabled transitions 3688 [2021-03-25 19:26:28,420 INFO L154 LiptonReduction]: Checked pairs total: 807 [2021-03-25 19:26:28,420 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 19:26:28,421 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4133 [2021-03-25 19:26:28,421 INFO L480 AbstractCegarLoop]: Abstraction has has 159 places, 347 transitions, 4381 flow [2021-03-25 19:26:28,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 37.583333333333336) internal successors, (451), 12 states have internal predecessors, (451), 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-25 19:26:28,421 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 19:26:28,421 INFO L263 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] [2021-03-25 19:26:28,422 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 19:26:28,422 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 19:26:28,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 19:26:28,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1005211925, now seen corresponding path program 4 times [2021-03-25 19:26:28,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 19:26:28,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827730219] [2021-03-25 19:26:28,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 19:26:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 19:26:28,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:28,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:26:28,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:28,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 19:26:28,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:28,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:26:28,466 INFO L142 QuantifierPusher]: treesize reduction 4, result has 78.9 percent of original size [2021-03-25 19:26:28,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 19:26:28,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:28,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 19:26:28,482 INFO L142 QuantifierPusher]: treesize reduction 5, result has 78.3 percent of original size [2021-03-25 19:26:28,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 19:26:28,495 INFO L142 QuantifierPusher]: treesize reduction 25, result has 47.9 percent of original size [2021-03-25 19:26:28,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 19:26:28,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:26:28,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:26:28,513 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-25 19:26:28,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827730219] [2021-03-25 19:26:28,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 19:26:28,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 19:26:28,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084440203] [2021-03-25 19:26:28,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 19:26:28,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 19:26:28,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 19:26:28,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-03-25 19:26:28,514 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 86 [2021-03-25 19:26:28,515 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 347 transitions, 4381 flow. Second operand has 8 states, 8 states have (on average 38.375) internal successors, (307), 8 states have internal predecessors, (307), 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-25 19:26:28,515 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 19:26:28,515 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 86 [2021-03-25 19:26:28,515 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 19:26:31,191 INFO L129 PetriNetUnfolder]: 6678/16291 cut-off events. [2021-03-25 19:26:31,191 INFO L130 PetriNetUnfolder]: For 115287/116499 co-relation queries the response was YES. [2021-03-25 19:26:31,294 INFO L84 FinitePrefix]: Finished finitePrefix Result has 79592 conditions, 16291 events. 6678/16291 cut-off events. For 115287/116499 co-relation queries the response was YES. Maximal size of possible extension queue 997. Compared 180538 event pairs, 1679 based on Foata normal form. 282/15642 useless extension candidates. Maximal degree in co-relation 79273. Up to 2691 conditions per place. [2021-03-25 19:26:31,368 INFO L132 encePairwiseOnDemand]: 68/86 looper letters, 462 selfloop transitions, 285 changer transitions 2/784 dead transitions. [2021-03-25 19:26:31,368 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 784 transitions, 11109 flow [2021-03-25 19:26:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-25 19:26:31,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-25 19:26:31,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 593 transitions. [2021-03-25 19:26:31,370 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5746124031007752 [2021-03-25 19:26:31,371 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 593 transitions. [2021-03-25 19:26:31,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 593 transitions. [2021-03-25 19:26:31,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 19:26:31,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 593 transitions. [2021-03-25 19:26:31,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 49.416666666666664) internal successors, (593), 12 states have internal predecessors, (593), 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-25 19:26:31,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 86.0) internal successors, (1118), 13 states have internal predecessors, (1118), 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-25 19:26:31,375 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 86.0) internal successors, (1118), 13 states have internal predecessors, (1118), 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-25 19:26:31,375 INFO L185 Difference]: Start difference. First operand has 159 places, 347 transitions, 4381 flow. Second operand 12 states and 593 transitions. [2021-03-25 19:26:31,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 784 transitions, 11109 flow [2021-03-25 19:26:32,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 784 transitions, 10722 flow, removed 193 selfloop flow, removed 1 redundant places. [2021-03-25 19:26:32,204 INFO L241 Difference]: Finished difference. Result has 179 places, 586 transitions, 8639 flow [2021-03-25 19:26:32,204 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=4234, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8639, PETRI_PLACES=179, PETRI_TRANSITIONS=586} [2021-03-25 19:26:32,205 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 131 predicate places. [2021-03-25 19:26:32,205 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 19:26:32,205 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 586 transitions, 8639 flow [2021-03-25 19:26:32,205 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 586 transitions, 8639 flow [2021-03-25 19:26:32,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 179 places, 586 transitions, 8639 flow [2021-03-25 19:26:33,090 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([108] L31-->L32: Formula: (or (not (< v_n3_2 v_n1_8)) (= v_n3_2 0)) InVars {n3=v_n3_2, n1=v_n1_8} OutVars{n3=v_n3_2, n1=v_n1_8} AuxVars[] AssignedVars[][585], [Black: 116#(and (<= n1 n3) (<= n3 n2) (<= 0 n2)), Black: 117#(and (<= n1 n2) (<= n3 n2) (<= 0 n2)), Black: 118#(and (<= n3 n2) (<= 0 n2)), Black: 119#(and (<= 1 n2) (<= (+ n3 1) n2)), Black: 120#(and (= n3 n2) (<= 1 n2)), Black: 121#(and (<= (+ n2 1) n3) (<= 1 n2)), Black: 256#(and (or (<= 2 n2) (<= 2 n3)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 123#(and (<= n1 n3) (<= 1 n2) (<= (+ n3 1) n2)), Black: 258#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 3 n2)), Black: 260#(and (<= (+ n3 1) n1) (or (<= 2 n2) (<= 2 n3)) (<= 0 n3)), Black: 125#(and (<= n1 n2) (<= 1 n2) (<= (+ n3 1) n2)), Black: 232#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3)), Black: 236#(and (<= n1 n3) (<= 1 n1)), Black: 238#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 2 n2)), Black: 242#(and (<= n1 n3) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), Black: 139#e3, Black: 244#(and (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 246#(and (= n3 n1) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 248#(and (or (<= n1 n2) (<= 2 n3)) (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 250#(and (<= n1 n3) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 144#e1, Black: 252#(and (<= (+ n3 1) n1) (or (<= 1 n3) (<= 2 n2)) (<= 0 n3)), 147#true, Black: 222#(and (= n3 n1) (<= 1 n1)), Black: 254#(and (= n3 n1) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), 280#(<= 0 n3), Black: 151#(and (<= n3 n2) (<= 0 n3)), Black: 152#(and (<= 0 n3) (<= (+ n3 1) n2)), Black: 153#(and (<= 1 n3) (< n3 (+ n2 1))), Black: 154#(and (<= 1 n3) (< n3 (+ n2 1)) (not (= n3 n2))), 32#L77true, 164#(and (<= n2 n3) (<= 0 n2)), Black: 288#(and (<= n1 n3) (<= 1 n3) (<= n3 (+ n2 1))), 38#L64true, Black: 290#(and (<= n1 n3) (<= 1 n3) (<= n3 n2)), Black: 292#(and (<= n1 n3) (<= 1 n3) (<= n3 n2) (not (= n3 n2))), 40#thread2EXITtrue, Black: 162#(and (<= n1 n2) (<= n3 n2) (<= n2 n3) (<= 0 n2)), Black: 279#(and (<= n1 n3) (<= 0 n3)), Black: 163#(and (= n3 n2) (<= 0 n2)), Black: 165#(and (<= n2 (+ n3 1)) (<= 1 n2)), Black: 281#(and (<= n3 n2) (<= 0 n3)), Black: 166#(and (<= n2 n3) (<= 1 n2)), Black: 282#(and (<= 1 n3) (<= n3 (+ n2 1))), Black: 283#(and (<= 1 n3) (<= n3 n2)), Black: 284#(and (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 286#(and (<= n1 n3) (<= n3 n2) (<= 0 n3)), 55#L32true, 185#(and (<= 0 n3) (<= n3 n1)), 67#true, Black: 178#(and (= n3 n1) (<= 1 n1)), Black: 195#(and (<= 1 n1) (<= 0 n3) (<= 2 n2)), Black: 197#(and (<= 1 n1) (<= 0 n3) (<= 3 n2)), Black: 201#(and (< n2 n1) (<= 0 n3) (<= 3 n2)), Black: 187#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 189#(and (<= 1 n1) (<= 0 n3) (or (<= n1 n3) (<= 2 n2))), Black: 191#(and (<= 1 n1) (<= 0 n3) (or (<= (+ n1 1) n3) (<= 2 n2))), Black: 175#(<= 0 n3), Black: 83#(and (<= i3 0) (<= 2 i) (<= i1 1) (<= i 2) (<= 0 i3) (<= 1 i1)), Black: 69#(and (<= i 0) (<= 0 i)), Black: 79#(and (<= i3 0) (<= 1 i) (<= i 1) (<= 0 i3)), 95#true, 230#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 97#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 98#(and (<= (+ n3 1) n1) (<= 1 n1) (<= (+ n2 1) n1)), Black: 99#(and (<= (+ n3 1) n1) (<= 1 n1) (= n2 n1)), Black: 101#(and (<= 1 n1) (<= (+ n1 1) n2)), Black: 111#e2, 114#true]) [2021-03-25 19:26:33,091 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2021-03-25 19:26:33,091 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 19:26:33,091 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 19:26:33,091 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 19:26:33,318 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([108] L31-->L32: Formula: (or (not (< v_n3_2 v_n1_8)) (= v_n3_2 0)) InVars {n3=v_n3_2, n1=v_n1_8} OutVars{n3=v_n3_2, n1=v_n1_8} AuxVars[] AssignedVars[][585], [Black: 116#(and (<= n1 n3) (<= n3 n2) (<= 0 n2)), Black: 117#(and (<= n1 n2) (<= n3 n2) (<= 0 n2)), Black: 118#(and (<= n3 n2) (<= 0 n2)), Black: 119#(and (<= 1 n2) (<= (+ n3 1) n2)), Black: 120#(and (= n3 n2) (<= 1 n2)), Black: 121#(and (<= (+ n2 1) n3) (<= 1 n2)), Black: 256#(and (or (<= 2 n2) (<= 2 n3)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 123#(and (<= n1 n3) (<= 1 n2) (<= (+ n3 1) n2)), Black: 258#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 3 n2)), Black: 260#(and (<= (+ n3 1) n1) (or (<= 2 n2) (<= 2 n3)) (<= 0 n3)), Black: 125#(and (<= n1 n2) (<= 1 n2) (<= (+ n3 1) n2)), Black: 230#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 232#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3)), Black: 236#(and (<= n1 n3) (<= 1 n1)), Black: 238#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 2 n2)), Black: 242#(and (<= n1 n3) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), Black: 139#e3, Black: 244#(and (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 246#(and (= n3 n1) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 248#(and (or (<= n1 n2) (<= 2 n3)) (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), 17#L66true, Black: 250#(and (<= n1 n3) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 252#(and (<= (+ n3 1) n1) (or (<= 1 n3) (<= 2 n2)) (<= 0 n3)), Black: 144#e1, 147#true, Black: 222#(and (= n3 n1) (<= 1 n1)), Black: 254#(and (= n3 n1) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), 280#(<= 0 n3), Black: 151#(and (<= n3 n2) (<= 0 n3)), Black: 152#(and (<= 0 n3) (<= (+ n3 1) n2)), Black: 153#(and (<= 1 n3) (< n3 (+ n2 1))), Black: 154#(and (<= 1 n3) (< n3 (+ n2 1)) (not (= n3 n2))), 32#L77true, 164#(and (<= n2 n3) (<= 0 n2)), Black: 288#(and (<= n1 n3) (<= 1 n3) (<= n3 (+ n2 1))), Black: 290#(and (<= n1 n3) (<= 1 n3) (<= n3 n2)), 40#thread2EXITtrue, Black: 162#(and (<= n1 n2) (<= n3 n2) (<= n2 n3) (<= 0 n2)), Black: 292#(and (<= n1 n3) (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 279#(and (<= n1 n3) (<= 0 n3)), Black: 163#(and (= n3 n2) (<= 0 n2)), Black: 165#(and (<= n2 (+ n3 1)) (<= 1 n2)), Black: 281#(and (<= n3 n2) (<= 0 n3)), Black: 166#(and (<= n2 n3) (<= 1 n2)), Black: 282#(and (<= 1 n3) (<= n3 (+ n2 1))), Black: 283#(and (<= 1 n3) (<= n3 n2)), Black: 284#(and (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 286#(and (<= n1 n3) (<= n3 n2) (<= 0 n3)), 175#(<= 0 n3), 55#L32true, 67#true, Black: 178#(and (= n3 n1) (<= 1 n1)), Black: 195#(and (<= 1 n1) (<= 0 n3) (<= 2 n2)), Black: 197#(and (<= 1 n1) (<= 0 n3) (<= 3 n2)), Black: 185#(and (<= 0 n3) (<= n3 n1)), Black: 201#(and (< n2 n1) (<= 0 n3) (<= 3 n2)), Black: 187#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 189#(and (<= 1 n1) (<= 0 n3) (or (<= n1 n3) (<= 2 n2))), Black: 191#(and (<= 1 n1) (<= 0 n3) (or (<= (+ n1 1) n3) (<= 2 n2))), 219#(<= 0 n3), Black: 83#(and (<= i3 0) (<= 2 i) (<= i1 1) (<= i 2) (<= 0 i3) (<= 1 i1)), Black: 69#(and (<= i 0) (<= 0 i)), Black: 79#(and (<= i3 0) (<= 1 i) (<= i 1) (<= 0 i3)), 95#true, Black: 97#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 98#(and (<= (+ n3 1) n1) (<= 1 n1) (<= (+ n2 1) n1)), Black: 99#(and (<= (+ n3 1) n1) (<= 1 n1) (= n2 n1)), Black: 101#(and (<= 1 n1) (<= (+ n1 1) n2)), Black: 111#e2, 114#true]) [2021-03-25 19:26:33,318 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2021-03-25 19:26:33,319 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-25 19:26:33,319 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2021-03-25 19:26:33,319 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-25 19:26:33,414 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([108] L31-->L32: Formula: (or (not (< v_n3_2 v_n1_8)) (= v_n3_2 0)) InVars {n3=v_n3_2, n1=v_n1_8} OutVars{n3=v_n3_2, n1=v_n1_8} AuxVars[] AssignedVars[][585], [Black: 116#(and (<= n1 n3) (<= n3 n2) (<= 0 n2)), Black: 117#(and (<= n1 n2) (<= n3 n2) (<= 0 n2)), Black: 118#(and (<= n3 n2) (<= 0 n2)), Black: 119#(and (<= 1 n2) (<= (+ n3 1) n2)), Black: 120#(and (= n3 n2) (<= 1 n2)), Black: 121#(and (<= (+ n2 1) n3) (<= 1 n2)), Black: 256#(and (or (<= 2 n2) (<= 2 n3)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 123#(and (<= n1 n3) (<= 1 n2) (<= (+ n3 1) n2)), Black: 258#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 3 n2)), Black: 125#(and (<= n1 n2) (<= 1 n2) (<= (+ n3 1) n2)), Black: 260#(and (<= (+ n3 1) n1) (or (<= 2 n2) (<= 2 n3)) (<= 0 n3)), Black: 232#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3)), Black: 236#(and (<= n1 n3) (<= 1 n1)), Black: 238#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 2 n2)), Black: 242#(and (<= n1 n3) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), Black: 139#e3, Black: 244#(and (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 246#(and (= n3 n1) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 248#(and (or (<= n1 n2) (<= 2 n3)) (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 250#(and (<= n1 n3) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 144#e1, Black: 252#(and (<= (+ n3 1) n1) (or (<= 1 n3) (<= 2 n2)) (<= 0 n3)), Black: 222#(and (= n3 n1) (<= 1 n1)), 147#true, Black: 254#(and (= n3 n1) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), 280#(<= 0 n3), Black: 151#(and (<= n3 n2) (<= 0 n3)), Black: 152#(and (<= 0 n3) (<= (+ n3 1) n2)), Black: 153#(and (<= 1 n3) (< n3 (+ n2 1))), Black: 154#(and (<= 1 n3) (< n3 (+ n2 1)) (not (= n3 n2))), 32#L77true, 160#true, Black: 288#(and (<= n1 n3) (<= 1 n3) (<= n3 (+ n2 1))), Black: 290#(and (<= n1 n3) (<= 1 n3) (<= n3 n2)), Black: 292#(and (<= n1 n3) (<= 1 n3) (<= n3 n2) (not (= n3 n2))), 40#thread2EXITtrue, Black: 162#(and (<= n1 n2) (<= n3 n2) (<= n2 n3) (<= 0 n2)), Black: 279#(and (<= n1 n3) (<= 0 n3)), Black: 163#(and (= n3 n2) (<= 0 n2)), Black: 164#(and (<= n2 n3) (<= 0 n2)), Black: 165#(and (<= n2 (+ n3 1)) (<= 1 n2)), Black: 281#(and (<= n3 n2) (<= 0 n3)), Black: 166#(and (<= n2 n3) (<= 1 n2)), Black: 282#(and (<= 1 n3) (<= n3 (+ n2 1))), Black: 283#(and (<= 1 n3) (<= n3 n2)), Black: 284#(and (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 286#(and (<= n1 n3) (<= n3 n2) (<= 0 n3)), 50#thread3EXITtrue, 55#L32true, 185#(and (<= 0 n3) (<= n3 n1)), 67#true, Black: 178#(and (= n3 n1) (<= 1 n1)), Black: 195#(and (<= 1 n1) (<= 0 n3) (<= 2 n2)), Black: 197#(and (<= 1 n1) (<= 0 n3) (<= 3 n2)), Black: 201#(and (< n2 n1) (<= 0 n3) (<= 3 n2)), Black: 187#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 189#(and (<= 1 n1) (<= 0 n3) (or (<= n1 n3) (<= 2 n2))), Black: 191#(and (<= 1 n1) (<= 0 n3) (or (<= (+ n1 1) n3) (<= 2 n2))), Black: 175#(<= 0 n3), Black: 83#(and (<= i3 0) (<= 2 i) (<= i1 1) (<= i 2) (<= 0 i3) (<= 1 i1)), Black: 69#(and (<= i 0) (<= 0 i)), Black: 79#(and (<= i3 0) (<= 1 i) (<= i 1) (<= 0 i3)), 95#true, 230#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 97#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 98#(and (<= (+ n3 1) n1) (<= 1 n1) (<= (+ n2 1) n1)), Black: 99#(and (<= (+ n3 1) n1) (<= 1 n1) (= n2 n1)), Black: 101#(and (<= 1 n1) (<= (+ n1 1) n2)), Black: 111#e2, 114#true]) [2021-03-25 19:26:33,414 INFO L384 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2021-03-25 19:26:33,414 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-25 19:26:33,414 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-25 19:26:33,414 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-25 19:26:33,480 INFO L129 PetriNetUnfolder]: 3387/10148 cut-off events. [2021-03-25 19:26:33,480 INFO L130 PetriNetUnfolder]: For 80982/82084 co-relation queries the response was YES. [2021-03-25 19:26:33,561 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49999 conditions, 10148 events. 3387/10148 cut-off events. For 80982/82084 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 117684 event pairs, 616 based on Foata normal form. 361/9779 useless extension candidates. Maximal degree in co-relation 49619. Up to 1810 conditions per place. [2021-03-25 19:26:33,747 INFO L142 LiptonReduction]: Number of co-enabled transitions 6014 [2021-03-25 19:27:00,474 INFO L154 LiptonReduction]: Checked pairs total: 4916 [2021-03-25 19:27:00,474 INFO L156 LiptonReduction]: Total number of compositions: 25 [2021-03-25 19:27:00,474 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 28269 [2021-03-25 19:27:00,475 INFO L480 AbstractCegarLoop]: Abstraction has has 179 places, 586 transitions, 8689 flow [2021-03-25 19:27:00,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 38.375) internal successors, (307), 8 states have internal predecessors, (307), 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-25 19:27:00,475 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 19:27:00,475 INFO L263 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] [2021-03-25 19:27:00,475 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 19:27:00,475 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 19:27:00,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 19:27:00,476 INFO L82 PathProgramCache]: Analyzing trace with hash 438081739, now seen corresponding path program 5 times [2021-03-25 19:27:00,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 19:27:00,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444707369] [2021-03-25 19:27:00,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 19:27:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 19:27:00,517 INFO L142 QuantifierPusher]: treesize reduction 31, result has 46.6 percent of original size [2021-03-25 19:27:00,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 19:27:00,542 INFO L142 QuantifierPusher]: treesize reduction 6, result has 68.4 percent of original size [2021-03-25 19:27:00,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 19:27:00,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:27:00,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 19:27:00,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:27:00,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 19:27:00,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:27:00,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 19:27:00,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:27:00,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 19:27:00,567 INFO L142 QuantifierPusher]: treesize reduction 9, result has 64.0 percent of original size [2021-03-25 19:27:00,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 19:27:00,579 INFO L142 QuantifierPusher]: treesize reduction 6, result has 14.3 percent of original size [2021-03-25 19:27:00,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:27:00,580 INFO L142 QuantifierPusher]: treesize reduction 13, result has 7.1 percent of original size [2021-03-25 19:27:00,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:27:00,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:27:00,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:27:00,581 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-25 19:27:00,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444707369] [2021-03-25 19:27:00,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 19:27:00,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 19:27:00,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114420822] [2021-03-25 19:27:00,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 19:27:00,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 19:27:00,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 19:27:00,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-25 19:27:00,583 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 111 [2021-03-25 19:27:00,583 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 586 transitions, 8689 flow. Second operand has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 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-25 19:27:00,583 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 19:27:00,583 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 111 [2021-03-25 19:27:00,583 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 19:27:03,684 INFO L129 PetriNetUnfolder]: 6136/15174 cut-off events. [2021-03-25 19:27:03,684 INFO L130 PetriNetUnfolder]: For 155810/157791 co-relation queries the response was YES. [2021-03-25 19:27:03,778 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84186 conditions, 15174 events. 6136/15174 cut-off events. For 155810/157791 co-relation queries the response was YES. Maximal size of possible extension queue 993. Compared 168793 event pairs, 2227 based on Foata normal form. 272/14635 useless extension candidates. Maximal degree in co-relation 83806. Up to 8610 conditions per place. [2021-03-25 19:27:03,828 INFO L132 encePairwiseOnDemand]: 97/111 looper letters, 557 selfloop transitions, 68 changer transitions 1/661 dead transitions. [2021-03-25 19:27:03,829 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 661 transitions, 10867 flow [2021-03-25 19:27:03,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 19:27:03,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 19:27:03,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 314 transitions. [2021-03-25 19:27:03,838 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.47147147147147145 [2021-03-25 19:27:03,838 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 314 transitions. [2021-03-25 19:27:03,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 314 transitions. [2021-03-25 19:27:03,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 19:27:03,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 314 transitions. [2021-03-25 19:27:03,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 52.333333333333336) internal successors, (314), 6 states have internal predecessors, (314), 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-25 19:27:03,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 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-25 19:27:03,840 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 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-25 19:27:03,840 INFO L185 Difference]: Start difference. First operand has 179 places, 586 transitions, 8689 flow. Second operand 6 states and 314 transitions. [2021-03-25 19:27:03,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 661 transitions, 10867 flow [2021-03-25 19:27:04,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 661 transitions, 10722 flow, removed 72 selfloop flow, removed 1 redundant places. [2021-03-25 19:27:04,995 INFO L241 Difference]: Finished difference. Result has 187 places, 592 transitions, 8896 flow [2021-03-25 19:27:04,996 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=8345, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8896, PETRI_PLACES=187, PETRI_TRANSITIONS=592} [2021-03-25 19:27:04,996 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 139 predicate places. [2021-03-25 19:27:04,996 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 19:27:04,996 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 592 transitions, 8896 flow [2021-03-25 19:27:04,996 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 592 transitions, 8896 flow [2021-03-25 19:27:05,000 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 187 places, 592 transitions, 8896 flow [2021-03-25 19:27:06,003 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L65-->L66: Formula: (or (= v_n2_14 0) (and (not (< v_n2_14 v_n3_13)) (not (= v_n2_14 v_n3_13)))) InVars {n2=v_n2_14, n3=v_n3_13} OutVars{n2=v_n2_14, n3=v_n3_13} AuxVars[] AssignedVars[][466], [Black: 116#(and (<= n1 n3) (<= n3 n2) (<= 0 n2)), Black: 117#(and (<= n1 n2) (<= n3 n2) (<= 0 n2)), Black: 118#(and (<= n3 n2) (<= 0 n2)), Black: 119#(and (<= 1 n2) (<= (+ n3 1) n2)), Black: 120#(and (= n3 n2) (<= 1 n2)), Black: 256#(and (or (<= 2 n2) (<= 2 n3)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 121#(and (<= (+ n2 1) n3) (<= 1 n2)), Black: 258#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 3 n2)), Black: 123#(and (<= n1 n3) (<= 1 n2) (<= (+ n3 1) n2)), Black: 260#(and (<= (+ n3 1) n1) (or (<= 2 n2) (<= 2 n3)) (<= 0 n3)), Black: 125#(and (<= n1 n2) (<= 1 n2) (<= (+ n3 1) n2)), Black: 230#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 232#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3)), 10#thread1EXITtrue, Black: 236#(and (<= n1 n3) (<= 1 n1)), Black: 238#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 2 n2)), Black: 139#e3, Black: 242#(and (<= n1 n3) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), Black: 244#(and (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 246#(and (= n3 n1) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 248#(and (or (<= n1 n2) (<= 2 n3)) (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 250#(and (<= n1 n3) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), 17#L66true, Black: 252#(and (<= (+ n3 1) n1) (or (<= 1 n3) (<= 2 n2)) (<= 0 n3)), Black: 144#e1, 147#true, Black: 222#(and (= n3 n1) (<= 1 n1)), Black: 254#(and (= n3 n1) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), 279#(and (<= n1 n3) (<= 0 n3)), Black: 151#(and (<= n3 n2) (<= 0 n3)), Black: 152#(and (<= 0 n3) (<= (+ n3 1) n2)), Black: 153#(and (<= 1 n3) (< n3 (+ n2 1))), Black: 154#(and (<= 1 n3) (< n3 (+ n2 1)) (not (= n3 n2))), 32#L77true, 164#(and (<= n2 n3) (<= 0 n2)), Black: 288#(and (<= n1 n3) (<= 1 n3) (<= n3 (+ n2 1))), Black: 290#(and (<= n1 n3) (<= 1 n3) (<= n3 n2)), 40#thread2EXITtrue, Black: 292#(and (<= n1 n3) (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 162#(and (<= n1 n2) (<= n3 n2) (<= n2 n3) (<= 0 n2)), Black: 163#(and (= n3 n2) (<= 0 n2)), Black: 280#(<= 0 n3), Black: 165#(and (<= n2 (+ n3 1)) (<= 1 n2)), Black: 281#(and (<= n3 n2) (<= 0 n3)), Black: 282#(and (<= 1 n3) (<= n3 (+ n2 1))), Black: 166#(and (<= n2 n3) (<= 1 n2)), Black: 283#(and (<= 1 n3) (<= n3 n2)), Black: 284#(and (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 286#(and (<= n1 n3) (<= n3 n2) (<= 0 n3)), 175#(<= 0 n3), 304#true, Black: 306#(and (<= n1 n2) (< n2 (+ n3 1)) (<= n3 n2) (<= 0 n2) (<= n2 0)), Black: 307#(and (<= n2 n3) (<= n3 0) (<= 0 n2)), Black: 308#(and (<= 0 n2) (<= (+ n2 1) n3) (<= n3 1)), Black: 309#(and (< n2 (+ n3 1)) (<= n3 n2) (<= 1 n2)), 67#true, Black: 178#(and (= n3 n1) (<= 1 n1)), Black: 195#(and (<= 1 n1) (<= 0 n3) (<= 2 n2)), Black: 197#(and (<= 1 n1) (<= 0 n3) (<= 3 n2)), Black: 185#(and (<= 0 n3) (<= n3 n1)), Black: 201#(and (< n2 n1) (<= 0 n3) (<= 3 n2)), Black: 187#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 189#(and (<= 1 n1) (<= 0 n3) (or (<= n1 n3) (<= 2 n2))), Black: 191#(and (<= 1 n1) (<= 0 n3) (or (<= (+ n1 1) n3) (<= 2 n2))), Black: 83#(and (<= i3 0) (<= 2 i) (<= i1 1) (<= i 2) (<= 0 i3) (<= 1 i1)), 219#(<= 0 n3), Black: 69#(and (<= i 0) (<= 0 i)), Black: 79#(and (<= i3 0) (<= 1 i) (<= i 1) (<= 0 i3)), 95#true, Black: 97#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 98#(and (<= (+ n3 1) n1) (<= 1 n1) (<= (+ n2 1) n1)), Black: 99#(and (<= (+ n3 1) n1) (<= 1 n1) (= n2 n1)), Black: 101#(and (<= 1 n1) (<= (+ n1 1) n2)), Black: 111#e2, 114#true]) [2021-03-25 19:27:06,003 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is not cut-off event [2021-03-25 19:27:06,003 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2021-03-25 19:27:06,003 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2021-03-25 19:27:06,003 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2021-03-25 19:27:06,167 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([108] L31-->L32: Formula: (or (not (< v_n3_2 v_n1_8)) (= v_n3_2 0)) InVars {n3=v_n3_2, n1=v_n1_8} OutVars{n3=v_n3_2, n1=v_n1_8} AuxVars[] AssignedVars[][590], [Black: 116#(and (<= n1 n3) (<= n3 n2) (<= 0 n2)), Black: 117#(and (<= n1 n2) (<= n3 n2) (<= 0 n2)), Black: 118#(and (<= n3 n2) (<= 0 n2)), Black: 119#(and (<= 1 n2) (<= (+ n3 1) n2)), Black: 120#(and (= n3 n2) (<= 1 n2)), Black: 121#(and (<= (+ n2 1) n3) (<= 1 n2)), Black: 256#(and (or (<= 2 n2) (<= 2 n3)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 123#(and (<= n1 n3) (<= 1 n2) (<= (+ n3 1) n2)), Black: 258#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 3 n2)), Black: 260#(and (<= (+ n3 1) n1) (or (<= 2 n2) (<= 2 n3)) (<= 0 n3)), Black: 125#(and (<= n1 n2) (<= 1 n2) (<= (+ n3 1) n2)), Black: 232#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3)), Black: 236#(and (<= n1 n3) (<= 1 n1)), Black: 238#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 2 n2)), Black: 242#(and (<= n1 n3) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), Black: 139#e3, Black: 244#(and (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 246#(and (= n3 n1) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 248#(and (or (<= n1 n2) (<= 2 n3)) (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 250#(and (<= n1 n3) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 252#(and (<= (+ n3 1) n1) (or (<= 1 n3) (<= 2 n2)) (<= 0 n3)), Black: 144#e1, 147#true, Black: 222#(and (= n3 n1) (<= 1 n1)), Black: 254#(and (= n3 n1) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), 280#(<= 0 n3), Black: 151#(and (<= n3 n2) (<= 0 n3)), Black: 152#(and (<= 0 n3) (<= (+ n3 1) n2)), Black: 153#(and (<= 1 n3) (< n3 (+ n2 1))), Black: 154#(and (<= 1 n3) (< n3 (+ n2 1)) (not (= n3 n2))), 160#true, 32#L77true, Black: 288#(and (<= n1 n3) (<= 1 n3) (<= n3 (+ n2 1))), Black: 290#(and (<= n1 n3) (<= 1 n3) (<= n3 n2)), Black: 162#(and (<= n1 n2) (<= n3 n2) (<= n2 n3) (<= 0 n2)), Black: 292#(and (<= n1 n3) (<= 1 n3) (<= n3 n2) (not (= n3 n2))), 40#thread2EXITtrue, Black: 163#(and (= n3 n2) (<= 0 n2)), Black: 279#(and (<= n1 n3) (<= 0 n3)), Black: 164#(and (<= n2 n3) (<= 0 n2)), Black: 281#(and (<= n3 n2) (<= 0 n3)), Black: 165#(and (<= n2 (+ n3 1)) (<= 1 n2)), Black: 166#(and (<= n2 n3) (<= 1 n2)), Black: 282#(and (<= 1 n3) (<= n3 (+ n2 1))), Black: 283#(and (<= 1 n3) (<= n3 n2)), Black: 284#(and (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 286#(and (<= n1 n3) (<= n3 n2) (<= 0 n3)), 304#true, 50#thread3EXITtrue, Black: 306#(and (<= n1 n2) (< n2 (+ n3 1)) (<= n3 n2) (<= 0 n2) (<= n2 0)), 55#L32true, Black: 307#(and (<= n2 n3) (<= n3 0) (<= 0 n2)), 185#(and (<= 0 n3) (<= n3 n1)), Black: 308#(and (<= 0 n2) (<= (+ n2 1) n3) (<= n3 1)), Black: 309#(and (< n2 (+ n3 1)) (<= n3 n2) (<= 1 n2)), 67#true, Black: 178#(and (= n3 n1) (<= 1 n1)), Black: 195#(and (<= 1 n1) (<= 0 n3) (<= 2 n2)), Black: 197#(and (<= 1 n1) (<= 0 n3) (<= 3 n2)), Black: 201#(and (< n2 n1) (<= 0 n3) (<= 3 n2)), Black: 187#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 189#(and (<= 1 n1) (<= 0 n3) (or (<= n1 n3) (<= 2 n2))), Black: 191#(and (<= 1 n1) (<= 0 n3) (or (<= (+ n1 1) n3) (<= 2 n2))), Black: 175#(<= 0 n3), Black: 83#(and (<= i3 0) (<= 2 i) (<= i1 1) (<= i 2) (<= 0 i3) (<= 1 i1)), Black: 69#(and (<= i 0) (<= 0 i)), Black: 79#(and (<= i3 0) (<= 1 i) (<= i 1) (<= 0 i3)), 95#true, 230#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 97#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 98#(and (<= (+ n3 1) n1) (<= 1 n1) (<= (+ n2 1) n1)), Black: 99#(and (<= (+ n3 1) n1) (<= 1 n1) (= n2 n1)), Black: 101#(and (<= 1 n1) (<= (+ n1 1) n2)), Black: 111#e2, 114#true]) [2021-03-25 19:27:06,168 INFO L384 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2021-03-25 19:27:06,168 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-25 19:27:06,168 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-25 19:27:06,168 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-25 19:27:06,194 INFO L129 PetriNetUnfolder]: 2924/9204 cut-off events. [2021-03-25 19:27:06,195 INFO L130 PetriNetUnfolder]: For 75143/76091 co-relation queries the response was YES. [2021-03-25 19:27:06,254 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45671 conditions, 9204 events. 2924/9204 cut-off events. For 75143/76091 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 107830 event pairs, 565 based on Foata normal form. 320/8909 useless extension candidates. Maximal degree in co-relation 45318. Up to 1572 conditions per place. [2021-03-25 19:27:06,328 INFO L142 LiptonReduction]: Number of co-enabled transitions 5590 [2021-03-25 19:27:27,426 INFO L154 LiptonReduction]: Checked pairs total: 2351 [2021-03-25 19:27:27,426 INFO L156 LiptonReduction]: Total number of compositions: 9 [2021-03-25 19:27:27,426 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22430 [2021-03-25 19:27:27,427 INFO L480 AbstractCegarLoop]: Abstraction has has 187 places, 592 transitions, 8914 flow [2021-03-25 19:27:27,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 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-25 19:27:27,427 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 19:27:27,427 INFO L263 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] [2021-03-25 19:27:27,427 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 19:27:27,427 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 19:27:27,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 19:27:27,428 INFO L82 PathProgramCache]: Analyzing trace with hash 188496307, now seen corresponding path program 1 times [2021-03-25 19:27:27,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 19:27:27,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254214532] [2021-03-25 19:27:27,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 19:27:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 19:27:27,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:27:27,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 19:27:27,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:27:27,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 19:27:27,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:27:27,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 19:27:27,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:27:27,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 19:27:27,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:27:27,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 19:27:27,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:27:27,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 19:27:27,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:27:27,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 19:27:27,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:27:27,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 19:27:27,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:27:27,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 19:27:27,555 INFO L142 QuantifierPusher]: treesize reduction 8, result has 66.7 percent of original size [2021-03-25 19:27:27,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 19:27:27,567 INFO L142 QuantifierPusher]: treesize reduction 1, result has 87.5 percent of original size [2021-03-25 19:27:27,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:27:27,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:27:27,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:27:27,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:27:27,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:27:27,579 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-25 19:27:27,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254214532] [2021-03-25 19:27:27,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 19:27:27,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 19:27:27,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462541467] [2021-03-25 19:27:27,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 19:27:27,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 19:27:27,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 19:27:27,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-03-25 19:27:27,582 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 120 [2021-03-25 19:27:27,582 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 592 transitions, 8914 flow. Second operand has 12 states, 12 states have (on average 37.583333333333336) internal successors, (451), 12 states have internal predecessors, (451), 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-25 19:27:27,582 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 19:27:27,582 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 120 [2021-03-25 19:27:27,582 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 19:27:31,542 INFO L129 PetriNetUnfolder]: 6306/16596 cut-off events. [2021-03-25 19:27:31,542 INFO L130 PetriNetUnfolder]: For 178819/181040 co-relation queries the response was YES. [2021-03-25 19:27:31,732 INFO L84 FinitePrefix]: Finished finitePrefix Result has 92589 conditions, 16596 events. 6306/16596 cut-off events. For 178819/181040 co-relation queries the response was YES. Maximal size of possible extension queue 1075. Compared 194648 event pairs, 2078 based on Foata normal form. 837/16537 useless extension candidates. Maximal degree in co-relation 92480. Up to 3533 conditions per place. [2021-03-25 19:27:31,790 INFO L132 encePairwiseOnDemand]: 89/120 looper letters, 511 selfloop transitions, 402 changer transitions 4/952 dead transitions. [2021-03-25 19:27:31,790 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 952 transitions, 15797 flow [2021-03-25 19:27:31,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-25 19:27:31,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-03-25 19:27:31,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 701 transitions. [2021-03-25 19:27:31,793 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4172619047619048 [2021-03-25 19:27:31,793 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 701 transitions. [2021-03-25 19:27:31,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 701 transitions. [2021-03-25 19:27:31,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 19:27:31,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 701 transitions. [2021-03-25 19:27:31,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 50.07142857142857) internal successors, (701), 14 states have internal predecessors, (701), 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-25 19:27:31,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 120.0) internal successors, (1800), 15 states have internal predecessors, (1800), 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-25 19:27:31,798 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 120.0) internal successors, (1800), 15 states have internal predecessors, (1800), 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-25 19:27:31,798 INFO L185 Difference]: Start difference. First operand has 187 places, 592 transitions, 8914 flow. Second operand 14 states and 701 transitions. [2021-03-25 19:27:31,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 952 transitions, 15797 flow [2021-03-25 19:27:33,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 952 transitions, 15611 flow, removed 41 selfloop flow, removed 4 redundant places. [2021-03-25 19:27:33,104 INFO L241 Difference]: Finished difference. Result has 204 places, 754 transitions, 13016 flow [2021-03-25 19:27:33,104 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=8275, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=237, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=13016, PETRI_PLACES=204, PETRI_TRANSITIONS=754} [2021-03-25 19:27:33,105 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 156 predicate places. [2021-03-25 19:27:33,105 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 19:27:33,105 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 754 transitions, 13016 flow [2021-03-25 19:27:33,105 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 754 transitions, 13016 flow [2021-03-25 19:27:33,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 204 places, 754 transitions, 13016 flow [2021-03-25 19:27:34,402 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([108] L31-->L32: Formula: (or (not (< v_n3_2 v_n1_8)) (= v_n3_2 0)) InVars {n3=v_n3_2, n1=v_n1_8} OutVars{n3=v_n3_2, n1=v_n1_8} AuxVars[] AssignedVars[][750], [Black: 116#(and (<= n1 n3) (<= n3 n2) (<= 0 n2)), Black: 117#(and (<= n1 n2) (<= n3 n2) (<= 0 n2)), Black: 118#(and (<= n3 n2) (<= 0 n2)), Black: 119#(and (<= 1 n2) (<= (+ n3 1) n2)), Black: 120#(and (= n3 n2) (<= 1 n2)), Black: 121#(and (<= (+ n2 1) n3) (<= 1 n2)), Black: 256#(and (or (<= 2 n2) (<= 2 n3)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 123#(and (<= n1 n3) (<= 1 n2) (<= (+ n3 1) n2)), Black: 258#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 3 n2)), Black: 260#(and (<= (+ n3 1) n1) (or (<= 2 n2) (<= 2 n3)) (<= 0 n3)), Black: 125#(and (<= n1 n2) (<= 1 n2) (<= (+ n3 1) n2)), Black: 232#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3)), Black: 236#(and (<= n1 n3) (<= 1 n1)), Black: 238#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 2 n2)), Black: 242#(and (<= n1 n3) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), Black: 139#e3, Black: 244#(and (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 246#(and (= n3 n1) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 248#(and (or (<= n1 n2) (<= 2 n3)) (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 250#(and (<= n1 n3) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 144#e1, Black: 252#(and (<= (+ n3 1) n1) (or (<= 1 n3) (<= 2 n2)) (<= 0 n3)), 147#true, 280#(<= 0 n3), Black: 151#(and (<= n3 n2) (<= 0 n3)), Black: 152#(and (<= 0 n3) (<= (+ n3 1) n2)), Black: 153#(and (<= 1 n3) (< n3 (+ n2 1))), Black: 154#(and (<= 1 n3) (< n3 (+ n2 1)) (not (= n3 n2))), 32#L77true, 164#(and (<= n2 n3) (<= 0 n2)), Black: 288#(and (<= n1 n3) (<= 1 n3) (<= n3 (+ n2 1))), 38#L64true, Black: 290#(and (<= n1 n3) (<= 1 n3) (<= n3 n2)), Black: 162#(and (<= n1 n2) (<= n3 n2) (<= n2 n3) (<= 0 n2)), 40#thread2EXITtrue, Black: 292#(and (<= n1 n3) (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 163#(and (= n3 n2) (<= 0 n2)), Black: 279#(and (<= n1 n3) (<= 0 n3)), Black: 281#(and (<= n3 n2) (<= 0 n3)), Black: 165#(and (<= n2 (+ n3 1)) (<= 1 n2)), Black: 166#(and (<= n2 n3) (<= 1 n2)), Black: 282#(and (<= 1 n3) (<= n3 (+ n2 1))), Black: 283#(and (<= 1 n3) (<= n3 n2)), Black: 284#(and (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 286#(and (<= n1 n3) (<= n3 n2) (<= 0 n3)), Black: 306#(and (<= n1 n2) (< n2 (+ n3 1)) (<= n3 n2) (<= 0 n2) (<= n2 0)), 55#L32true, Black: 307#(and (<= n2 n3) (<= n3 0) (<= 0 n2)), Black: 308#(and (<= 0 n2) (<= (+ n2 1) n3) (<= n3 1)), 185#(and (<= 0 n3) (<= n3 n1)), Black: 309#(and (< n2 (+ n3 1)) (<= n3 n2) (<= 1 n2)), 67#true, 323#(and (<= 1 n1) (or (<= n1 n3) (<= 0 n2))), Black: 178#(and (= n3 n1) (<= 1 n1)), Black: 195#(and (<= 1 n1) (<= 0 n3) (<= 2 n2)), Black: 197#(and (<= 1 n1) (<= 0 n3) (<= 3 n2)), Black: 201#(and (< n2 n1) (<= 0 n3) (<= 3 n2)), Black: 320#(and (<= n1 n2) (<= 0 n1)), Black: 187#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 336#(and (<= 1 n1) (or (<= n1 n3) (<= 1 n2)) (or (<= n1 n3) (< n2 n1))), Black: 189#(and (<= 1 n1) (<= 0 n3) (or (<= n1 n3) (<= 2 n2))), Black: 321#(and (<= 1 n1) (<= n1 (+ n2 1))), Black: 191#(and (<= 1 n1) (<= 0 n3) (or (<= (+ n1 1) n3) (<= 2 n2))), Black: 175#(<= 0 n3), Black: 328#(and (<= n1 n2) (<= 1 n1)), Black: 332#(and (<= n1 n3) (<= n1 n2) (<= 1 n1)), Black: 317#(and (<= n1 n3) (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 83#(and (<= i3 0) (<= 2 i) (<= i1 1) (<= i 2) (<= 0 i3) (<= 1 i1)), Black: 318#(and (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 69#(and (<= i 0) (<= 0 i)), Black: 334#(and (<= n1 n2) (<= 1 n1) (<= n3 n1)), Black: 319#(and (<= n1 n2) (<= 0 n1) (<= n3 n1)), Black: 79#(and (<= i3 0) (<= 1 i) (<= i 1) (<= 0 i3)), 95#true, 230#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 97#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 98#(and (<= (+ n3 1) n1) (<= 1 n1) (<= (+ n2 1) n1)), Black: 99#(and (<= (+ n3 1) n1) (<= 1 n1) (= n2 n1)), Black: 101#(and (<= 1 n1) (<= (+ n1 1) n2)), Black: 111#e2, 114#true]) [2021-03-25 19:27:34,402 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2021-03-25 19:27:34,402 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 19:27:34,402 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 19:27:34,402 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 19:27:34,729 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([108] L31-->L32: Formula: (or (not (< v_n3_2 v_n1_8)) (= v_n3_2 0)) InVars {n3=v_n3_2, n1=v_n1_8} OutVars{n3=v_n3_2, n1=v_n1_8} AuxVars[] AssignedVars[][750], [Black: 116#(and (<= n1 n3) (<= n3 n2) (<= 0 n2)), Black: 117#(and (<= n1 n2) (<= n3 n2) (<= 0 n2)), Black: 118#(and (<= n3 n2) (<= 0 n2)), Black: 119#(and (<= 1 n2) (<= (+ n3 1) n2)), Black: 120#(and (= n3 n2) (<= 1 n2)), Black: 256#(and (or (<= 2 n2) (<= 2 n3)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 121#(and (<= (+ n2 1) n3) (<= 1 n2)), Black: 258#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 3 n2)), Black: 123#(and (<= n1 n3) (<= 1 n2) (<= (+ n3 1) n2)), Black: 125#(and (<= n1 n2) (<= 1 n2) (<= (+ n3 1) n2)), Black: 260#(and (<= (+ n3 1) n1) (or (<= 2 n2) (<= 2 n3)) (<= 0 n3)), Black: 232#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3)), Black: 236#(and (<= n1 n3) (<= 1 n1)), Black: 238#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 2 n2)), Black: 139#e3, Black: 242#(and (<= n1 n3) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), Black: 244#(and (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 246#(and (= n3 n1) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 248#(and (or (<= n1 n2) (<= 2 n3)) (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 250#(and (<= n1 n3) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 252#(and (<= (+ n3 1) n1) (or (<= 1 n3) (<= 2 n2)) (<= 0 n3)), Black: 144#e1, 147#true, 280#(<= 0 n3), Black: 151#(and (<= n3 n2) (<= 0 n3)), Black: 152#(and (<= 0 n3) (<= (+ n3 1) n2)), Black: 153#(and (<= 1 n3) (< n3 (+ n2 1))), Black: 154#(and (<= 1 n3) (< n3 (+ n2 1)) (not (= n3 n2))), 160#true, 32#L77true, Black: 288#(and (<= n1 n3) (<= 1 n3) (<= n3 (+ n2 1))), Black: 290#(and (<= n1 n3) (<= 1 n3) (<= n3 n2)), Black: 162#(and (<= n1 n2) (<= n3 n2) (<= n2 n3) (<= 0 n2)), 40#thread2EXITtrue, Black: 292#(and (<= n1 n3) (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 163#(and (= n3 n2) (<= 0 n2)), Black: 279#(and (<= n1 n3) (<= 0 n3)), Black: 164#(and (<= n2 n3) (<= 0 n2)), Black: 165#(and (<= n2 (+ n3 1)) (<= 1 n2)), Black: 281#(and (<= n3 n2) (<= 0 n3)), Black: 282#(and (<= 1 n3) (<= n3 (+ n2 1))), Black: 166#(and (<= n2 n3) (<= 1 n2)), Black: 283#(and (<= 1 n3) (<= n3 n2)), Black: 284#(and (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 286#(and (<= n1 n3) (<= n3 n2) (<= 0 n3)), 50#thread3EXITtrue, Black: 306#(and (<= n1 n2) (< n2 (+ n3 1)) (<= n3 n2) (<= 0 n2) (<= n2 0)), 55#L32true, Black: 307#(and (<= n2 n3) (<= n3 0) (<= 0 n2)), 185#(and (<= 0 n3) (<= n3 n1)), Black: 308#(and (<= 0 n2) (<= (+ n2 1) n3) (<= n3 1)), Black: 309#(and (< n2 (+ n3 1)) (<= n3 n2) (<= 1 n2)), 315#true, 67#true, Black: 178#(and (= n3 n1) (<= 1 n1)), Black: 195#(and (<= 1 n1) (<= 0 n3) (<= 2 n2)), Black: 197#(and (<= 1 n1) (<= 0 n3) (<= 3 n2)), Black: 201#(and (< n2 n1) (<= 0 n3) (<= 3 n2)), Black: 320#(and (<= n1 n2) (<= 0 n1)), Black: 187#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 336#(and (<= 1 n1) (or (<= n1 n3) (<= 1 n2)) (or (<= n1 n3) (< n2 n1))), Black: 189#(and (<= 1 n1) (<= 0 n3) (or (<= n1 n3) (<= 2 n2))), Black: 321#(and (<= 1 n1) (<= n1 (+ n2 1))), Black: 191#(and (<= 1 n1) (<= 0 n3) (or (<= (+ n1 1) n3) (<= 2 n2))), Black: 323#(and (<= 1 n1) (or (<= n1 n3) (<= 0 n2))), Black: 175#(<= 0 n3), Black: 328#(and (<= n1 n2) (<= 1 n1)), Black: 332#(and (<= n1 n3) (<= n1 n2) (<= 1 n1)), Black: 317#(and (<= n1 n3) (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 83#(and (<= i3 0) (<= 2 i) (<= i1 1) (<= i 2) (<= 0 i3) (<= 1 i1)), Black: 318#(and (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 334#(and (<= n1 n2) (<= 1 n1) (<= n3 n1)), Black: 69#(and (<= i 0) (<= 0 i)), Black: 319#(and (<= n1 n2) (<= 0 n1) (<= n3 n1)), Black: 79#(and (<= i3 0) (<= 1 i) (<= i 1) (<= 0 i3)), 95#true, 230#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 97#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 98#(and (<= (+ n3 1) n1) (<= 1 n1) (<= (+ n2 1) n1)), Black: 99#(and (<= (+ n3 1) n1) (<= 1 n1) (= n2 n1)), Black: 101#(and (<= 1 n1) (<= (+ n1 1) n2)), Black: 111#e2, 114#true]) [2021-03-25 19:27:34,729 INFO L384 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2021-03-25 19:27:34,729 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-25 19:27:34,729 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-25 19:27:34,729 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-25 19:27:34,766 INFO L129 PetriNetUnfolder]: 3475/11399 cut-off events. [2021-03-25 19:27:34,766 INFO L130 PetriNetUnfolder]: For 134022/135717 co-relation queries the response was YES. [2021-03-25 19:27:34,852 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62455 conditions, 11399 events. 3475/11399 cut-off events. For 134022/135717 co-relation queries the response was YES. Maximal size of possible extension queue 869. Compared 141661 event pairs, 828 based on Foata normal form. 453/11056 useless extension candidates. Maximal degree in co-relation 61930. Up to 1965 conditions per place. [2021-03-25 19:27:34,953 INFO L142 LiptonReduction]: Number of co-enabled transitions 6188 [2021-03-25 19:28:09,024 INFO L154 LiptonReduction]: Checked pairs total: 3626 [2021-03-25 19:28:09,024 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-25 19:28:09,024 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 35919 [2021-03-25 19:28:09,024 INFO L480 AbstractCegarLoop]: Abstraction has has 204 places, 754 transitions, 13040 flow [2021-03-25 19:28:09,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 37.583333333333336) internal successors, (451), 12 states have internal predecessors, (451), 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-25 19:28:09,025 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 19:28:09,025 INFO L263 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] [2021-03-25 19:28:09,025 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 19:28:09,025 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 19:28:09,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 19:28:09,025 INFO L82 PathProgramCache]: Analyzing trace with hash 2093544197, now seen corresponding path program 1 times [2021-03-25 19:28:09,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 19:28:09,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748862298] [2021-03-25 19:28:09,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 19:28:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 19:28:09,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:28:09,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 19:28:09,073 INFO L142 QuantifierPusher]: treesize reduction 3, result has 76.9 percent of original size [2021-03-25 19:28:09,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 19:28:09,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:28:09,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 19:28:09,080 INFO L142 QuantifierPusher]: treesize reduction 7, result has 58.8 percent of original size [2021-03-25 19:28:09,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 19:28:09,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:28:09,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 19:28:09,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:28:09,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 19:28:09,097 INFO L142 QuantifierPusher]: treesize reduction 9, result has 57.1 percent of original size [2021-03-25 19:28:09,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 19:28:09,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:28:09,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:28:09,107 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-25 19:28:09,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748862298] [2021-03-25 19:28:09,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 19:28:09,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 19:28:09,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839432254] [2021-03-25 19:28:09,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 19:28:09,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 19:28:09,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 19:28:09,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 19:28:09,108 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 132 [2021-03-25 19:28:09,109 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 754 transitions, 13040 flow. Second operand has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 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-25 19:28:09,109 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 19:28:09,109 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 132 [2021-03-25 19:28:09,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 19:28:12,954 INFO L129 PetriNetUnfolder]: 5796/15460 cut-off events. [2021-03-25 19:28:12,954 INFO L130 PetriNetUnfolder]: For 227596/229469 co-relation queries the response was YES. [2021-03-25 19:28:13,099 INFO L84 FinitePrefix]: Finished finitePrefix Result has 96384 conditions, 15460 events. 5796/15460 cut-off events. For 227596/229469 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 180486 event pairs, 2271 based on Foata normal form. 488/15171 useless extension candidates. Maximal degree in co-relation 95921. Up to 8855 conditions per place. [2021-03-25 19:28:13,155 INFO L132 encePairwiseOnDemand]: 111/132 looper letters, 635 selfloop transitions, 152 changer transitions 2/824 dead transitions. [2021-03-25 19:28:13,155 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 824 transitions, 15688 flow [2021-03-25 19:28:13,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 19:28:13,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 19:28:13,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 370 transitions. [2021-03-25 19:28:13,158 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4004329004329004 [2021-03-25 19:28:13,158 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 370 transitions. [2021-03-25 19:28:13,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 370 transitions. [2021-03-25 19:28:13,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 19:28:13,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 370 transitions. [2021-03-25 19:28:13,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 52.857142857142854) internal successors, (370), 7 states have internal predecessors, (370), 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-25 19:28:13,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 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-25 19:28:13,160 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 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-25 19:28:13,160 INFO L185 Difference]: Start difference. First operand has 204 places, 754 transitions, 13040 flow. Second operand 7 states and 370 transitions. [2021-03-25 19:28:13,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 824 transitions, 15688 flow [2021-03-25 19:28:14,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 824 transitions, 15077 flow, removed 299 selfloop flow, removed 2 redundant places. [2021-03-25 19:28:14,894 INFO L241 Difference]: Finished difference. Result has 211 places, 755 transitions, 13173 flow [2021-03-25 19:28:14,894 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=11258, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=13173, PETRI_PLACES=211, PETRI_TRANSITIONS=755} [2021-03-25 19:28:14,894 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 163 predicate places. [2021-03-25 19:28:14,895 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 19:28:14,895 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 755 transitions, 13173 flow [2021-03-25 19:28:14,895 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 755 transitions, 13173 flow [2021-03-25 19:28:14,899 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 211 places, 755 transitions, 13173 flow [2021-03-25 19:28:16,124 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([108] L31-->L32: Formula: (or (not (< v_n3_2 v_n1_8)) (= v_n3_2 0)) InVars {n3=v_n3_2, n1=v_n1_8} OutVars{n3=v_n3_2, n1=v_n1_8} AuxVars[] AssignedVars[][752], [Black: 116#(and (<= n1 n3) (<= n3 n2) (<= 0 n2)), Black: 117#(and (<= n1 n2) (<= n3 n2) (<= 0 n2)), Black: 118#(and (<= n3 n2) (<= 0 n2)), Black: 119#(and (<= 1 n2) (<= (+ n3 1) n2)), Black: 120#(and (= n3 n2) (<= 1 n2)), Black: 121#(and (<= (+ n2 1) n3) (<= 1 n2)), Black: 123#(and (<= n1 n3) (<= 1 n2) (<= (+ n3 1) n2)), Black: 260#(and (<= (+ n3 1) n1) (or (<= 2 n2) (<= 2 n3)) (<= 0 n3)), Black: 125#(and (<= n1 n2) (<= 1 n2) (<= (+ n3 1) n2)), Black: 232#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3)), Black: 236#(and (<= n1 n3) (<= 1 n1)), Black: 238#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 2 n2)), Black: 139#e3, Black: 242#(and (<= n1 n3) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), Black: 244#(and (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 246#(and (= n3 n1) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 248#(and (or (<= n1 n2) (<= 2 n3)) (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 250#(and (<= n1 n3) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 144#e1, Black: 252#(and (<= (+ n3 1) n1) (or (<= 1 n3) (<= 2 n2)) (<= 0 n3)), 147#true, 280#(<= 0 n3), Black: 151#(and (<= n3 n2) (<= 0 n3)), Black: 152#(and (<= 0 n3) (<= (+ n3 1) n2)), Black: 153#(and (<= 1 n3) (< n3 (+ n2 1))), Black: 154#(and (<= 1 n3) (< n3 (+ n2 1)) (not (= n3 n2))), 32#L77true, 164#(and (<= n2 n3) (<= 0 n2)), 38#L64true, Black: 288#(and (<= n1 n3) (<= 1 n3) (<= n3 (+ n2 1))), Black: 290#(and (<= n1 n3) (<= 1 n3) (<= n3 n2)), Black: 292#(and (<= n1 n3) (<= 1 n3) (<= n3 n2) (not (= n3 n2))), 40#thread2EXITtrue, Black: 162#(and (<= n1 n2) (<= n3 n2) (<= n2 n3) (<= 0 n2)), Black: 163#(and (= n3 n2) (<= 0 n2)), Black: 279#(and (<= n1 n3) (<= 0 n3)), Black: 281#(and (<= n3 n2) (<= 0 n3)), Black: 165#(and (<= n2 (+ n3 1)) (<= 1 n2)), Black: 166#(and (<= n2 n3) (<= 1 n2)), Black: 282#(and (<= 1 n3) (<= n3 (+ n2 1))), Black: 283#(and (<= 1 n3) (<= n3 n2)), Black: 284#(and (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 286#(and (<= n1 n3) (<= n3 n2) (<= 0 n3)), 55#L32true, Black: 306#(and (<= n1 n2) (< n2 (+ n3 1)) (<= n3 n2) (<= 0 n2) (<= n2 0)), Black: 307#(and (<= n2 n3) (<= n3 0) (<= 0 n2)), Black: 308#(and (<= 0 n2) (<= (+ n2 1) n3) (<= n3 1)), 185#(and (<= 0 n3) (<= n3 n1)), Black: 309#(and (< n2 (+ n3 1)) (<= n3 n2) (<= 1 n2)), 67#true, 323#(and (<= 1 n1) (or (<= n1 n3) (<= 0 n2))), Black: 178#(and (= n3 n1) (<= 1 n1)), Black: 195#(and (<= 1 n1) (<= 0 n3) (<= 2 n2)), Black: 197#(and (<= 1 n1) (<= 0 n3) (<= 3 n2)), Black: 201#(and (< n2 n1) (<= 0 n3) (<= 3 n2)), Black: 187#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 320#(and (<= n1 n2) (<= 0 n1)), Black: 336#(and (<= 1 n1) (or (<= n1 n3) (<= 1 n2)) (or (<= n1 n3) (< n2 n1))), Black: 321#(and (<= 1 n1) (<= n1 (+ n2 1))), Black: 189#(and (<= 1 n1) (<= 0 n3) (or (<= n1 n3) (<= 2 n2))), Black: 191#(and (<= 1 n1) (<= 0 n3) (or (<= (+ n1 1) n3) (<= 2 n2))), Black: 175#(<= 0 n3), Black: 328#(and (<= n1 n2) (<= 1 n1)), Black: 332#(and (<= n1 n3) (<= n1 n2) (<= 1 n1)), Black: 317#(and (<= n1 n3) (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 318#(and (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 83#(and (<= i3 0) (<= 2 i) (<= i1 1) (<= i 2) (<= 0 i3) (<= 1 i1)), Black: 69#(and (<= i 0) (<= 0 i)), Black: 334#(and (<= n1 n2) (<= 1 n1) (<= n3 n1)), Black: 319#(and (<= n1 n2) (<= 0 n1) (<= n3 n1)), Black: 79#(and (<= i3 0) (<= 1 i) (<= i 1) (<= 0 i3)), 350#true, 95#true, 230#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 352#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 354#(and (<= n1 (+ n3 1)) (<= (+ n3 1) n1) (<= 1 n1)), Black: 355#(and (<= n1 n3) (<= 1 n1) (< n3 (+ n1 1))), Black: 97#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 357#(and (<= n1 n3) (<= 1 n1) (<= n2 n1) (< n3 (+ n1 1))), Black: 98#(and (<= (+ n3 1) n1) (<= 1 n1) (<= (+ n2 1) n1)), Black: 99#(and (<= (+ n3 1) n1) (<= 1 n1) (= n2 n1)), Black: 101#(and (<= 1 n1) (<= (+ n1 1) n2)), Black: 111#e2, 114#true]) [2021-03-25 19:28:16,124 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2021-03-25 19:28:16,124 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-25 19:28:16,124 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2021-03-25 19:28:16,125 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-25 19:28:16,272 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([134] L65-->L66: Formula: (or (= v_n2_14 0) (and (not (< v_n2_14 v_n3_13)) (not (= v_n2_14 v_n3_13)))) InVars {n2=v_n2_14, n3=v_n3_13} OutVars{n2=v_n2_14, n3=v_n3_13} AuxVars[] AssignedVars[][576], [Black: 116#(and (<= n1 n3) (<= n3 n2) (<= 0 n2)), Black: 117#(and (<= n1 n2) (<= n3 n2) (<= 0 n2)), Black: 118#(and (<= n3 n2) (<= 0 n2)), Black: 119#(and (<= 1 n2) (<= (+ n3 1) n2)), Black: 120#(and (= n3 n2) (<= 1 n2)), Black: 121#(and (<= (+ n2 1) n3) (<= 1 n2)), Black: 123#(and (<= n1 n3) (<= 1 n2) (<= (+ n3 1) n2)), Black: 260#(and (<= (+ n3 1) n1) (or (<= 2 n2) (<= 2 n3)) (<= 0 n3)), Black: 125#(and (<= n1 n2) (<= 1 n2) (<= (+ n3 1) n2)), Black: 230#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 232#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3)), Black: 236#(and (<= n1 n3) (<= 1 n1)), Black: 238#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 2 n2)), Black: 139#e3, Black: 242#(and (<= n1 n3) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), Black: 244#(and (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 246#(and (= n3 n1) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 248#(and (or (<= n1 n2) (<= 2 n3)) (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 250#(and (<= n1 n3) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), 17#L66true, Black: 144#e1, Black: 252#(and (<= (+ n3 1) n1) (or (<= 1 n3) (<= 2 n2)) (<= 0 n3)), 147#true, 280#(<= 0 n3), Black: 151#(and (<= n3 n2) (<= 0 n3)), Black: 152#(and (<= 0 n3) (<= (+ n3 1) n2)), Black: 153#(and (<= 1 n3) (< n3 (+ n2 1))), Black: 154#(and (<= 1 n3) (< n3 (+ n2 1)) (not (= n3 n2))), 32#L77true, 164#(and (<= n2 n3) (<= 0 n2)), Black: 288#(and (<= n1 n3) (<= 1 n3) (<= n3 (+ n2 1))), Black: 290#(and (<= n1 n3) (<= 1 n3) (<= n3 n2)), Black: 292#(and (<= n1 n3) (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 162#(and (<= n1 n2) (<= n3 n2) (<= n2 n3) (<= 0 n2)), 40#thread2EXITtrue, Black: 279#(and (<= n1 n3) (<= 0 n3)), Black: 163#(and (= n3 n2) (<= 0 n2)), Black: 281#(and (<= n3 n2) (<= 0 n3)), Black: 165#(and (<= n2 (+ n3 1)) (<= 1 n2)), Black: 166#(and (<= n2 n3) (<= 1 n2)), Black: 282#(and (<= 1 n3) (<= n3 (+ n2 1))), Black: 283#(and (<= 1 n3) (<= n3 n2)), Black: 284#(and (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 286#(and (<= n1 n3) (<= n3 n2) (<= 0 n3)), 175#(<= 0 n3), Black: 306#(and (<= n1 n2) (< n2 (+ n3 1)) (<= n3 n2) (<= 0 n2) (<= n2 0)), 55#L32true, Black: 307#(and (<= n2 n3) (<= n3 0) (<= 0 n2)), Black: 308#(and (<= 0 n2) (<= (+ n2 1) n3) (<= n3 1)), Black: 309#(and (< n2 (+ n3 1)) (<= n3 n2) (<= 1 n2)), 323#(and (<= 1 n1) (or (<= n1 n3) (<= 0 n2))), 67#true, Black: 178#(and (= n3 n1) (<= 1 n1)), Black: 195#(and (<= 1 n1) (<= 0 n3) (<= 2 n2)), Black: 197#(and (<= 1 n1) (<= 0 n3) (<= 3 n2)), Black: 185#(and (<= 0 n3) (<= n3 n1)), Black: 201#(and (< n2 n1) (<= 0 n3) (<= 3 n2)), Black: 320#(and (<= n1 n2) (<= 0 n1)), Black: 187#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 336#(and (<= 1 n1) (or (<= n1 n3) (<= 1 n2)) (or (<= n1 n3) (< n2 n1))), Black: 189#(and (<= 1 n1) (<= 0 n3) (or (<= n1 n3) (<= 2 n2))), Black: 321#(and (<= 1 n1) (<= n1 (+ n2 1))), Black: 191#(and (<= 1 n1) (<= 0 n3) (or (<= (+ n1 1) n3) (<= 2 n2))), Black: 328#(and (<= n1 n2) (<= 1 n1)), Black: 332#(and (<= n1 n3) (<= n1 n2) (<= 1 n1)), Black: 317#(and (<= n1 n3) (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 318#(and (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 83#(and (<= i3 0) (<= 2 i) (<= i1 1) (<= i 2) (<= 0 i3) (<= 1 i1)), 219#(<= 0 n3), Black: 334#(and (<= n1 n2) (<= 1 n1) (<= n3 n1)), Black: 69#(and (<= i 0) (<= 0 i)), Black: 319#(and (<= n1 n2) (<= 0 n1) (<= n3 n1)), Black: 79#(and (<= i3 0) (<= 1 i) (<= i 1) (<= 0 i3)), 350#true, 95#true, Black: 352#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 354#(and (<= n1 (+ n3 1)) (<= (+ n3 1) n1) (<= 1 n1)), Black: 355#(and (<= n1 n3) (<= 1 n1) (< n3 (+ n1 1))), Black: 97#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 357#(and (<= n1 n3) (<= 1 n1) (<= n2 n1) (< n3 (+ n1 1))), Black: 98#(and (<= (+ n3 1) n1) (<= 1 n1) (<= (+ n2 1) n1)), Black: 99#(and (<= (+ n3 1) n1) (<= 1 n1) (= n2 n1)), Black: 101#(and (<= 1 n1) (<= (+ n1 1) n2)), Black: 111#e2, 114#true]) [2021-03-25 19:28:16,273 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2021-03-25 19:28:16,273 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-25 19:28:16,273 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-25 19:28:16,273 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-25 19:28:16,481 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([108] L31-->L32: Formula: (or (not (< v_n3_2 v_n1_8)) (= v_n3_2 0)) InVars {n3=v_n3_2, n1=v_n1_8} OutVars{n3=v_n3_2, n1=v_n1_8} AuxVars[] AssignedVars[][752], [Black: 116#(and (<= n1 n3) (<= n3 n2) (<= 0 n2)), Black: 117#(and (<= n1 n2) (<= n3 n2) (<= 0 n2)), Black: 118#(and (<= n3 n2) (<= 0 n2)), Black: 119#(and (<= 1 n2) (<= (+ n3 1) n2)), Black: 120#(and (= n3 n2) (<= 1 n2)), Black: 121#(and (<= (+ n2 1) n3) (<= 1 n2)), Black: 123#(and (<= n1 n3) (<= 1 n2) (<= (+ n3 1) n2)), Black: 125#(and (<= n1 n2) (<= 1 n2) (<= (+ n3 1) n2)), Black: 260#(and (<= (+ n3 1) n1) (or (<= 2 n2) (<= 2 n3)) (<= 0 n3)), Black: 232#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3)), Black: 236#(and (<= n1 n3) (<= 1 n1)), Black: 238#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 2 n2)), Black: 139#e3, Black: 242#(and (<= n1 n3) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), Black: 244#(and (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 246#(and (= n3 n1) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 248#(and (or (<= n1 n2) (<= 2 n3)) (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 250#(and (<= n1 n3) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 144#e1, Black: 252#(and (<= (+ n3 1) n1) (or (<= 1 n3) (<= 2 n2)) (<= 0 n3)), 147#true, 280#(<= 0 n3), Black: 151#(and (<= n3 n2) (<= 0 n3)), Black: 152#(and (<= 0 n3) (<= (+ n3 1) n2)), Black: 153#(and (<= 1 n3) (< n3 (+ n2 1))), Black: 154#(and (<= 1 n3) (< n3 (+ n2 1)) (not (= n3 n2))), 32#L77true, 160#true, Black: 288#(and (<= n1 n3) (<= 1 n3) (<= n3 (+ n2 1))), Black: 290#(and (<= n1 n3) (<= 1 n3) (<= n3 n2)), Black: 292#(and (<= n1 n3) (<= 1 n3) (<= n3 n2) (not (= n3 n2))), 40#thread2EXITtrue, Black: 162#(and (<= n1 n2) (<= n3 n2) (<= n2 n3) (<= 0 n2)), Black: 163#(and (= n3 n2) (<= 0 n2)), Black: 279#(and (<= n1 n3) (<= 0 n3)), Black: 164#(and (<= n2 n3) (<= 0 n2)), Black: 281#(and (<= n3 n2) (<= 0 n3)), Black: 165#(and (<= n2 (+ n3 1)) (<= 1 n2)), Black: 166#(and (<= n2 n3) (<= 1 n2)), Black: 282#(and (<= 1 n3) (<= n3 (+ n2 1))), Black: 283#(and (<= 1 n3) (<= n3 n2)), Black: 284#(and (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 286#(and (<= n1 n3) (<= n3 n2) (<= 0 n3)), 50#thread3EXITtrue, 55#L32true, Black: 306#(and (<= n1 n2) (< n2 (+ n3 1)) (<= n3 n2) (<= 0 n2) (<= n2 0)), Black: 307#(and (<= n2 n3) (<= n3 0) (<= 0 n2)), Black: 308#(and (<= 0 n2) (<= (+ n2 1) n3) (<= n3 1)), 185#(and (<= 0 n3) (<= n3 n1)), Black: 309#(and (< n2 (+ n3 1)) (<= n3 n2) (<= 1 n2)), 315#true, 67#true, Black: 178#(and (= n3 n1) (<= 1 n1)), Black: 195#(and (<= 1 n1) (<= 0 n3) (<= 2 n2)), Black: 197#(and (<= 1 n1) (<= 0 n3) (<= 3 n2)), Black: 201#(and (< n2 n1) (<= 0 n3) (<= 3 n2)), Black: 187#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 320#(and (<= n1 n2) (<= 0 n1)), Black: 336#(and (<= 1 n1) (or (<= n1 n3) (<= 1 n2)) (or (<= n1 n3) (< n2 n1))), Black: 321#(and (<= 1 n1) (<= n1 (+ n2 1))), Black: 189#(and (<= 1 n1) (<= 0 n3) (or (<= n1 n3) (<= 2 n2))), Black: 191#(and (<= 1 n1) (<= 0 n3) (or (<= (+ n1 1) n3) (<= 2 n2))), Black: 323#(and (<= 1 n1) (or (<= n1 n3) (<= 0 n2))), Black: 175#(<= 0 n3), Black: 328#(and (<= n1 n2) (<= 1 n1)), Black: 332#(and (<= n1 n3) (<= n1 n2) (<= 1 n1)), Black: 317#(and (<= n1 n3) (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 318#(and (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 83#(and (<= i3 0) (<= 2 i) (<= i1 1) (<= i 2) (<= 0 i3) (<= 1 i1)), Black: 69#(and (<= i 0) (<= 0 i)), Black: 334#(and (<= n1 n2) (<= 1 n1) (<= n3 n1)), Black: 319#(and (<= n1 n2) (<= 0 n1) (<= n3 n1)), Black: 79#(and (<= i3 0) (<= 1 i) (<= i 1) (<= 0 i3)), 350#true, 95#true, 230#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 352#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 354#(and (<= n1 (+ n3 1)) (<= (+ n3 1) n1) (<= 1 n1)), Black: 355#(and (<= n1 n3) (<= 1 n1) (< n3 (+ n1 1))), Black: 97#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 357#(and (<= n1 n3) (<= 1 n1) (<= n2 n1) (< n3 (+ n1 1))), Black: 98#(and (<= (+ n3 1) n1) (<= 1 n1) (<= (+ n2 1) n1)), Black: 99#(and (<= (+ n3 1) n1) (<= 1 n1) (= n2 n1)), Black: 101#(and (<= 1 n1) (<= (+ n1 1) n2)), Black: 111#e2, 114#true]) [2021-03-25 19:28:16,481 INFO L384 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2021-03-25 19:28:16,481 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-25 19:28:16,481 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-25 19:28:16,481 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-25 19:28:16,561 INFO L129 PetriNetUnfolder]: 3207/10761 cut-off events. [2021-03-25 19:28:16,562 INFO L130 PetriNetUnfolder]: For 124168/125687 co-relation queries the response was YES. [2021-03-25 19:28:16,663 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59140 conditions, 10761 events. 3207/10761 cut-off events. For 124168/125687 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 133212 event pairs, 874 based on Foata normal form. 338/10310 useless extension candidates. Maximal degree in co-relation 58609. Up to 1622 conditions per place. [2021-03-25 19:28:16,772 INFO L142 LiptonReduction]: Number of co-enabled transitions 5822 [2021-03-25 19:28:46,802 INFO L154 LiptonReduction]: Checked pairs total: 2807 [2021-03-25 19:28:46,802 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-25 19:28:46,802 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 31907 [2021-03-25 19:28:46,803 INFO L480 AbstractCegarLoop]: Abstraction has has 211 places, 755 transitions, 13195 flow [2021-03-25 19:28:46,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 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-25 19:28:46,803 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 19:28:46,803 INFO L263 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] [2021-03-25 19:28:46,803 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 19:28:46,803 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 19:28:46,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 19:28:46,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1321934957, now seen corresponding path program 1 times [2021-03-25 19:28:46,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 19:28:46,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957340280] [2021-03-25 19:28:46,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 19:28:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 19:28:46,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:28:46,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 19:28:46,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:28:46,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 19:28:46,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:28:46,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 19:28:46,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:28:46,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:28:46,873 INFO L142 QuantifierPusher]: treesize reduction 7, result has 68.2 percent of original size [2021-03-25 19:28:46,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 19:28:46,878 INFO L142 QuantifierPusher]: treesize reduction 4, result has 63.6 percent of original size [2021-03-25 19:28:46,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:28:46,886 INFO L142 QuantifierPusher]: treesize reduction 4, result has 63.6 percent of original size [2021-03-25 19:28:46,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:28:46,894 INFO L142 QuantifierPusher]: treesize reduction 4, result has 69.2 percent of original size [2021-03-25 19:28:46,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 19:28:46,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:28:46,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:28:46,904 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-25 19:28:46,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957340280] [2021-03-25 19:28:46,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 19:28:46,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 19:28:46,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749820485] [2021-03-25 19:28:46,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 19:28:46,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 19:28:46,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 19:28:46,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-03-25 19:28:46,906 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 143 [2021-03-25 19:28:46,906 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 755 transitions, 13195 flow. Second operand has 9 states, 9 states have (on average 38.111111111111114) internal successors, (343), 9 states have internal predecessors, (343), 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-25 19:28:46,906 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 19:28:46,906 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 143 [2021-03-25 19:28:46,906 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 19:28:52,194 INFO L129 PetriNetUnfolder]: 6611/17869 cut-off events. [2021-03-25 19:28:52,195 INFO L130 PetriNetUnfolder]: For 256461/258353 co-relation queries the response was YES. [2021-03-25 19:28:52,615 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110734 conditions, 17869 events. 6611/17869 cut-off events. For 256461/258353 co-relation queries the response was YES. Maximal size of possible extension queue 1204. Compared 214652 event pairs, 1477 based on Foata normal form. 727/17816 useless extension candidates. Maximal degree in co-relation 110329. Up to 2995 conditions per place. [2021-03-25 19:28:52,683 INFO L132 encePairwiseOnDemand]: 94/143 looper letters, 506 selfloop transitions, 637 changer transitions 7/1185 dead transitions. [2021-03-25 19:28:52,683 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 1185 transitions, 22852 flow [2021-03-25 19:28:52,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-03-25 19:28:52,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-03-25 19:28:52,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 827 transitions. [2021-03-25 19:28:52,685 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.3401892225421637 [2021-03-25 19:28:52,685 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 827 transitions. [2021-03-25 19:28:52,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 827 transitions. [2021-03-25 19:28:52,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 19:28:52,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 827 transitions. [2021-03-25 19:28:52,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 48.64705882352941) internal successors, (827), 17 states have internal predecessors, (827), 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-25 19:28:52,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 143.0) internal successors, (2574), 18 states have internal predecessors, (2574), 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-25 19:28:52,691 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 143.0) internal successors, (2574), 18 states have internal predecessors, (2574), 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-25 19:28:52,691 INFO L185 Difference]: Start difference. First operand has 211 places, 755 transitions, 13195 flow. Second operand 17 states and 827 transitions. [2021-03-25 19:28:52,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 1185 transitions, 22852 flow [2021-03-25 19:28:54,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 1185 transitions, 22702 flow, removed 75 selfloop flow, removed 0 redundant places. [2021-03-25 19:28:54,595 INFO L241 Difference]: Finished difference. Result has 241 places, 1005 transitions, 20164 flow [2021-03-25 19:28:54,595 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=12905, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=746, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=401, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=20164, PETRI_PLACES=241, PETRI_TRANSITIONS=1005} [2021-03-25 19:28:54,596 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 193 predicate places. [2021-03-25 19:28:54,596 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 19:28:54,596 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 241 places, 1005 transitions, 20164 flow [2021-03-25 19:28:54,596 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 241 places, 1005 transitions, 20164 flow [2021-03-25 19:28:54,605 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 241 places, 1005 transitions, 20164 flow [2021-03-25 19:28:57,191 INFO L129 PetriNetUnfolder]: 4416/14195 cut-off events. [2021-03-25 19:28:57,191 INFO L130 PetriNetUnfolder]: For 240915/242918 co-relation queries the response was YES. [2021-03-25 19:28:57,519 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88386 conditions, 14195 events. 4416/14195 cut-off events. For 240915/242918 co-relation queries the response was YES. Maximal size of possible extension queue 915. Compared 180045 event pairs, 1121 based on Foata normal form. 445/13658 useless extension candidates. Maximal degree in co-relation 87847. Up to 2091 conditions per place. [2021-03-25 19:28:57,715 INFO L142 LiptonReduction]: Number of co-enabled transitions 7064 [2021-03-25 19:30:31,882 INFO L154 LiptonReduction]: Checked pairs total: 6037 [2021-03-25 19:30:31,882 INFO L156 LiptonReduction]: Total number of compositions: 23 [2021-03-25 19:30:31,883 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 97287 [2021-03-25 19:30:31,883 INFO L480 AbstractCegarLoop]: Abstraction has has 241 places, 1005 transitions, 20210 flow [2021-03-25 19:30:31,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 38.111111111111114) internal successors, (343), 9 states have internal predecessors, (343), 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-25 19:30:31,884 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 19:30:31,884 INFO L263 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] [2021-03-25 19:30:31,884 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 19:30:31,884 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 19:30:31,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 19:30:31,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1897109481, now seen corresponding path program 2 times [2021-03-25 19:30:31,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 19:30:31,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350031604] [2021-03-25 19:30:31,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 19:30:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 19:30:31,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:30:31,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 19:30:32,002 INFO L142 QuantifierPusher]: treesize reduction 5, result has 81.5 percent of original size [2021-03-25 19:30:32,003 INFO L147 QuantifierPusher]: treesize reduction 3, result has 86.4 percent of original size 19 [2021-03-25 19:30:32,006 INFO L142 QuantifierPusher]: treesize reduction 7, result has 65.0 percent of original size [2021-03-25 19:30:32,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 19:30:32,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:30:32,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 19:30:32,023 INFO L142 QuantifierPusher]: treesize reduction 8, result has 57.9 percent of original size [2021-03-25 19:30:32,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 19:30:32,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:30:32,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 19:30:32,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:30:32,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 19:30:32,049 INFO L142 QuantifierPusher]: treesize reduction 15, result has 53.1 percent of original size [2021-03-25 19:30:32,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 19:30:32,061 INFO L142 QuantifierPusher]: treesize reduction 14, result has 63.2 percent of original size [2021-03-25 19:30:32,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 19:30:32,095 INFO L142 QuantifierPusher]: treesize reduction 9, result has 52.6 percent of original size [2021-03-25 19:30:32,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 19:30:32,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:30:32,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:30:32,107 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-25 19:30:32,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350031604] [2021-03-25 19:30:32,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 19:30:32,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 19:30:32,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599521742] [2021-03-25 19:30:32,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 19:30:32,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 19:30:32,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 19:30:32,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-03-25 19:30:32,109 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 166 [2021-03-25 19:30:32,109 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 1005 transitions, 20210 flow. Second operand has 11 states, 11 states have (on average 37.72727272727273) internal successors, (415), 11 states have internal predecessors, (415), 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-25 19:30:32,109 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 19:30:32,109 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 166 [2021-03-25 19:30:32,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 19:30:39,925 INFO L129 PetriNetUnfolder]: 7674/21844 cut-off events. [2021-03-25 19:30:39,926 INFO L130 PetriNetUnfolder]: For 459823/463232 co-relation queries the response was YES. [2021-03-25 19:30:40,211 INFO L84 FinitePrefix]: Finished finitePrefix Result has 152565 conditions, 21844 events. 7674/21844 cut-off events. For 459823/463232 co-relation queries the response was YES. Maximal size of possible extension queue 1543. Compared 278367 event pairs, 2036 based on Foata normal form. 1102/21954 useless extension candidates. Maximal degree in co-relation 151932. Up to 6490 conditions per place. [2021-03-25 19:30:40,298 INFO L132 encePairwiseOnDemand]: 122/166 looper letters, 1026 selfloop transitions, 468 changer transitions 13/1542 dead transitions. [2021-03-25 19:30:40,299 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 1542 transitions, 33489 flow [2021-03-25 19:30:40,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-03-25 19:30:40,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-03-25 19:30:40,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 854 transitions. [2021-03-25 19:30:40,301 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.3026222537207654 [2021-03-25 19:30:40,301 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 854 transitions. [2021-03-25 19:30:40,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 854 transitions. [2021-03-25 19:30:40,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 19:30:40,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 854 transitions. [2021-03-25 19:30:40,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 50.23529411764706) internal successors, (854), 17 states have internal predecessors, (854), 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-25 19:30:40,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 166.0) internal successors, (2988), 18 states have internal predecessors, (2988), 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-25 19:30:40,306 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 166.0) internal successors, (2988), 18 states have internal predecessors, (2988), 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-25 19:30:40,306 INFO L185 Difference]: Start difference. First operand has 241 places, 1005 transitions, 20210 flow. Second operand 17 states and 854 transitions. [2021-03-25 19:30:40,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 1542 transitions, 33489 flow [2021-03-25 19:30:44,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 1542 transitions, 32624 flow, removed 426 selfloop flow, removed 2 redundant places. [2021-03-25 19:30:44,051 INFO L241 Difference]: Finished difference. Result has 269 places, 1282 transitions, 26981 flow [2021-03-25 19:30:44,055 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=19570, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=996, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=233, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=26981, PETRI_PLACES=269, PETRI_TRANSITIONS=1282} [2021-03-25 19:30:44,055 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 221 predicate places. [2021-03-25 19:30:44,055 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 19:30:44,055 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 269 places, 1282 transitions, 26981 flow [2021-03-25 19:30:44,055 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 269 places, 1282 transitions, 26981 flow [2021-03-25 19:30:44,069 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 269 places, 1282 transitions, 26981 flow [2021-03-25 19:30:48,486 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([108] L31-->L32: Formula: (or (not (< v_n3_2 v_n1_8)) (= v_n3_2 0)) InVars {n3=v_n3_2, n1=v_n1_8} OutVars{n3=v_n3_2, n1=v_n1_8} AuxVars[] AssignedVars[][198], [Black: 260#(and (<= (+ n3 1) n1) (or (<= 2 n2) (<= 2 n3)) (<= 0 n3)), Black: 232#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3)), Black: 236#(and (<= n1 n3) (<= 1 n1)), Black: 238#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 2 n2)), Black: 242#(and (<= n1 n3) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), Black: 244#(and (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 248#(and (or (<= n1 n2) (<= 2 n3)) (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 250#(and (<= n1 n3) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 252#(and (<= (+ n3 1) n1) (or (<= 1 n3) (<= 2 n2)) (<= 0 n3)), 280#(<= 0 n3), 32#L77true, Black: 288#(and (<= n1 n3) (<= 1 n3) (<= n3 (+ n2 1))), Black: 290#(and (<= n1 n3) (<= 1 n3) (<= n3 n2)), 40#thread2EXITtrue, Black: 292#(and (<= n1 n3) (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 279#(and (<= n1 n3) (<= 0 n3)), Black: 281#(and (<= n3 n2) (<= 0 n3)), Black: 282#(and (<= 1 n3) (<= n3 (+ n2 1))), Black: 283#(and (<= 1 n3) (<= n3 n2)), Black: 284#(and (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 286#(and (<= n1 n3) (<= n3 n2) (<= 0 n3)), 50#thread3EXITtrue, Black: 306#(and (<= n1 n2) (< n2 (+ n3 1)) (<= n3 n2) (<= 0 n2) (<= n2 0)), 55#L32true, Black: 307#(and (<= n2 n3) (<= n3 0) (<= 0 n2)), Black: 308#(and (<= 0 n2) (<= (+ n2 1) n3) (<= n3 1)), Black: 309#(and (< n2 (+ n3 1)) (<= n3 n2) (<= 1 n2)), 315#true, 67#true, Black: 320#(and (<= n1 n2) (<= 0 n1)), Black: 336#(and (<= 1 n1) (or (<= n1 n3) (<= 1 n2)) (or (<= n1 n3) (< n2 n1))), Black: 321#(and (<= 1 n1) (<= n1 (+ n2 1))), Black: 323#(and (<= 1 n1) (or (<= n1 n3) (<= 0 n2))), Black: 328#(and (<= n1 n2) (<= 1 n1)), Black: 332#(and (<= n1 n3) (<= n1 n2) (<= 1 n1)), Black: 317#(and (<= n1 n3) (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 318#(and (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 83#(and (<= i3 0) (<= 2 i) (<= i1 1) (<= i 2) (<= 0 i3) (<= 1 i1)), Black: 69#(and (<= i 0) (<= 0 i)), Black: 334#(and (<= n1 n2) (<= 1 n1) (<= n3 n1)), Black: 319#(and (<= n1 n2) (<= 0 n1) (<= n3 n1)), Black: 79#(and (<= i3 0) (<= 1 i) (<= i 1) (<= 0 i3)), 350#true, 95#true, Black: 352#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 354#(and (<= n1 (+ n3 1)) (<= (+ n3 1) n1) (<= 1 n1)), Black: 97#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 355#(and (<= n1 n3) (<= 1 n1) (< n3 (+ n1 1))), Black: 357#(and (<= n1 n3) (<= 1 n1) (<= n2 n1) (< n3 (+ n1 1))), Black: 98#(and (<= (+ n3 1) n1) (<= 1 n1) (<= (+ n2 1) n1)), Black: 99#(and (<= (+ n3 1) n1) (<= 1 n1) (= n2 n1)), Black: 101#(and (<= 1 n1) (<= (+ n1 1) n2)), 366#(and (<= n3 n2) (<= 0 n3) (<= n3 n1)), Black: 111#e2, 114#true, Black: 116#(and (<= n1 n3) (<= n3 n2) (<= 0 n2)), Black: 117#(and (<= n1 n2) (<= n3 n2) (<= 0 n2)), Black: 118#(and (<= n3 n2) (<= 0 n2)), Black: 119#(and (<= 1 n2) (<= (+ n3 1) n2)), Black: 120#(and (= n3 n2) (<= 1 n2)), Black: 385#(and (<= (+ n2 1) n1) (<= n3 n2) (<= 0 n3) (<= 1 n2)), Black: 121#(and (<= (+ n2 1) n3) (<= 1 n2)), Black: 387#(and (<= (+ n2 1) n1) (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 365#(and (<= n1 n2) (<= 0 n3) (<= n3 n1)), Black: 123#(and (<= n1 n3) (<= 1 n2) (<= (+ n3 1) n2)), Black: 125#(and (<= n1 n2) (<= 1 n2) (<= (+ n3 1) n2)), Black: 367#(and (<= 0 n3) (<= n3 n1) (<= 0 n2)), Black: 369#(and (<= 0 n1) (<= 1 n2)), Black: 370#(and (<= 1 n1) (<= 1 n2)), Black: 371#(and (<= (+ n2 1) n1) (<= 1 n2)), Black: 373#(and (<= n1 n2) (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 139#e3, Black: 375#(and (<= n1 n2) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 377#(and (<= n3 n2) (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 379#(and (<= 1 n1) (<= n3 n2) (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 381#(and (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 144#e1, Black: 383#(and (<= 1 n1) (<= 0 n3) (<= n3 n1) (<= 1 n2)), 147#true, 403#true, Black: 151#(and (<= n3 n2) (<= 0 n3)), Black: 152#(and (<= 0 n3) (<= (+ n3 1) n2)), Black: 153#(and (<= 1 n3) (< n3 (+ n2 1))), Black: 154#(and (<= 1 n3) (< n3 (+ n2 1)) (not (= n3 n2))), 160#true, Black: 162#(and (<= n1 n2) (<= n3 n2) (<= n2 n3) (<= 0 n2)), Black: 163#(and (= n3 n2) (<= 0 n2)), Black: 164#(and (<= n2 n3) (<= 0 n2)), Black: 165#(and (<= n2 (+ n3 1)) (<= 1 n2)), Black: 166#(and (<= n2 n3) (<= 1 n2)), Black: 417#(and (<= 1 n3) (<= 1 n1)), Black: 419#(and (<= 1 n3) (<= 0 n1)), Black: 421#(and (<= 1 n3) (< n1 (+ n2 1)) (<= 1 n1)), Black: 423#(and (<= 1 n3) (or (<= (+ n3 1) n1) (< n1 (+ n2 1))) (<= 1 n1)), Black: 425#(and (<= 1 n3) (<= (+ n3 1) n1)), Black: 427#(and (<= 1 n3) (<= (+ n3 1) n1) (< n1 (+ n2 1))), Black: 429#(and (<= (+ n3 1) n1) (<= 1 n1) (or (<= n1 n2) (<= 1 n3))), 185#(and (<= 0 n3) (<= n3 n1)), Black: 431#(and (<= (+ n3 1) n1) (< n1 (+ n2 1)) (<= 1 n1)), Black: 433#(and (<= (+ n3 1) n1) (< n1 (+ n2 1)) (<= 1 n1) (or (<= 1 n3) (<= (+ n1 1) n2))), Black: 406#(and (<= 0 n3) (<= n3 n1) (= n2 n1)), Black: 408#(and (or (<= 1 n3) (= n2 n1)) (<= 0 n1)), Black: 409#(and (<= 0 n1) (or (<= 1 n3) (<= (+ n1 1) n2))), Black: 410#(and (<= 1 n1) (or (<= n1 n2) (<= 1 n3))), Black: 415#(and (<= 1 n3) (<= 0 n2) (= n2 n1)), Black: 178#(and (= n3 n1) (<= 1 n1)), Black: 195#(and (<= 1 n1) (<= 0 n3) (<= 2 n2)), Black: 197#(and (<= 1 n1) (<= 0 n3) (<= 3 n2)), Black: 201#(and (< n2 n1) (<= 0 n3) (<= 3 n2)), Black: 187#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 189#(and (<= 1 n1) (<= 0 n3) (or (<= n1 n3) (<= 2 n2))), Black: 191#(and (<= 1 n1) (<= 0 n3) (or (<= (+ n1 1) n3) (<= 2 n2))), Black: 175#(<= 0 n3), 230#(and (<= (+ n3 1) n1) (<= 0 n3))]) [2021-03-25 19:30:48,486 INFO L384 tUnfolder$Statistics]: this new event has 30 ancestors and is not cut-off event [2021-03-25 19:30:48,486 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2021-03-25 19:30:48,486 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2021-03-25 19:30:48,486 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2021-03-25 19:30:48,565 INFO L129 PetriNetUnfolder]: 5291/17851 cut-off events. [2021-03-25 19:30:48,565 INFO L130 PetriNetUnfolder]: For 371371/374111 co-relation queries the response was YES. [2021-03-25 19:30:48,742 INFO L84 FinitePrefix]: Finished finitePrefix Result has 120135 conditions, 17851 events. 5291/17851 cut-off events. For 371371/374111 co-relation queries the response was YES. Maximal size of possible extension queue 1254. Compared 240656 event pairs, 1282 based on Foata normal form. 750/17513 useless extension candidates. Maximal degree in co-relation 119417. Up to 2559 conditions per place. [2021-03-25 19:30:49,030 INFO L142 LiptonReduction]: Number of co-enabled transitions 8610 [2021-03-25 19:33:46,230 INFO L154 LiptonReduction]: Checked pairs total: 4721 [2021-03-25 19:33:46,231 INFO L156 LiptonReduction]: Total number of compositions: 13 [2021-03-25 19:33:46,231 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 182176 [2021-03-25 19:33:46,231 INFO L480 AbstractCegarLoop]: Abstraction has has 269 places, 1282 transitions, 27007 flow [2021-03-25 19:33:46,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 37.72727272727273) internal successors, (415), 11 states have internal predecessors, (415), 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-25 19:33:46,232 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 19:33:46,232 INFO L263 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] [2021-03-25 19:33:46,232 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 19:33:46,232 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 19:33:46,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 19:33:46,232 INFO L82 PathProgramCache]: Analyzing trace with hash -146919033, now seen corresponding path program 3 times [2021-03-25 19:33:46,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 19:33:46,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569164633] [2021-03-25 19:33:46,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 19:33:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 19:33:46,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:33:46,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 19:33:46,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:33:46,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 19:33:46,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:33:46,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 19:33:46,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:33:46,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:33:46,290 INFO L142 QuantifierPusher]: treesize reduction 7, result has 68.2 percent of original size [2021-03-25 19:33:46,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 19:33:46,296 INFO L142 QuantifierPusher]: treesize reduction 4, result has 63.6 percent of original size [2021-03-25 19:33:46,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:33:46,303 INFO L142 QuantifierPusher]: treesize reduction 4, result has 63.6 percent of original size [2021-03-25 19:33:46,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:33:46,311 INFO L142 QuantifierPusher]: treesize reduction 1, result has 90.0 percent of original size [2021-03-25 19:33:46,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 19:33:46,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:33:46,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:33:46,321 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-25 19:33:46,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569164633] [2021-03-25 19:33:46,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 19:33:46,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 19:33:46,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648035172] [2021-03-25 19:33:46,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 19:33:46,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 19:33:46,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 19:33:46,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-03-25 19:33:46,323 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 179 [2021-03-25 19:33:46,323 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 1282 transitions, 27007 flow. Second operand has 9 states, 9 states have (on average 38.111111111111114) internal successors, (343), 9 states have internal predecessors, (343), 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-25 19:33:46,323 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 19:33:46,323 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 179 [2021-03-25 19:33:46,323 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 19:33:54,574 INFO L129 PetriNetUnfolder]: 6171/18494 cut-off events. [2021-03-25 19:33:54,574 INFO L130 PetriNetUnfolder]: For 463238/466535 co-relation queries the response was YES. [2021-03-25 19:33:54,774 INFO L84 FinitePrefix]: Finished finitePrefix Result has 139701 conditions, 18494 events. 6171/18494 cut-off events. For 463238/466535 co-relation queries the response was YES. Maximal size of possible extension queue 1344. Compared 235056 event pairs, 1513 based on Foata normal form. 903/18646 useless extension candidates. Maximal degree in co-relation 139173. Up to 3461 conditions per place. [2021-03-25 19:33:54,848 INFO L132 encePairwiseOnDemand]: 116/179 looper letters, 578 selfloop transitions, 752 changer transitions 1/1366 dead transitions. [2021-03-25 19:33:54,848 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 1366 transitions, 30455 flow [2021-03-25 19:33:54,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-25 19:33:54,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-03-25 19:33:54,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 758 transitions. [2021-03-25 19:33:54,850 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.2823091247672253 [2021-03-25 19:33:54,850 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 758 transitions. [2021-03-25 19:33:54,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 758 transitions. [2021-03-25 19:33:54,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 19:33:54,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 758 transitions. [2021-03-25 19:33:54,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 50.53333333333333) internal successors, (758), 15 states have internal predecessors, (758), 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-25 19:33:54,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 179.0) internal successors, (2864), 16 states have internal predecessors, (2864), 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-25 19:33:54,855 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 179.0) internal successors, (2864), 16 states have internal predecessors, (2864), 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-25 19:33:54,855 INFO L185 Difference]: Start difference. First operand has 269 places, 1282 transitions, 27007 flow. Second operand 15 states and 758 transitions. [2021-03-25 19:33:54,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 1366 transitions, 30455 flow [2021-03-25 19:33:58,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 1366 transitions, 29722 flow, removed 359 selfloop flow, removed 1 redundant places. [2021-03-25 19:33:58,702 INFO L241 Difference]: Finished difference. Result has 286 places, 1221 transitions, 26575 flow [2021-03-25 19:33:58,702 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=23970, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=720, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=26575, PETRI_PLACES=286, PETRI_TRANSITIONS=1221} [2021-03-25 19:33:58,703 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 238 predicate places. [2021-03-25 19:33:58,703 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 19:33:58,703 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 286 places, 1221 transitions, 26575 flow [2021-03-25 19:33:58,703 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 286 places, 1221 transitions, 26575 flow [2021-03-25 19:33:58,712 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 286 places, 1221 transitions, 26575 flow [2021-03-25 19:34:01,836 INFO L129 PetriNetUnfolder]: 4191/14981 cut-off events. [2021-03-25 19:34:01,836 INFO L130 PetriNetUnfolder]: For 317978/320293 co-relation queries the response was YES. [2021-03-25 19:34:02,165 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103704 conditions, 14981 events. 4191/14981 cut-off events. For 317978/320293 co-relation queries the response was YES. Maximal size of possible extension queue 1068. Compared 200019 event pairs, 956 based on Foata normal form. 608/14699 useless extension candidates. Maximal degree in co-relation 103148. Up to 2000 conditions per place. [2021-03-25 19:34:02,313 INFO L142 LiptonReduction]: Number of co-enabled transitions 7462 [2021-03-25 19:35:21,028 INFO L154 LiptonReduction]: Checked pairs total: 1473 [2021-03-25 19:35:21,029 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 19:35:21,029 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 82326 [2021-03-25 19:35:21,029 INFO L480 AbstractCegarLoop]: Abstraction has has 286 places, 1221 transitions, 26581 flow [2021-03-25 19:35:21,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 38.111111111111114) internal successors, (343), 9 states have internal predecessors, (343), 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-25 19:35:21,030 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 19:35:21,030 INFO L263 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] [2021-03-25 19:35:21,030 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 19:35:21,030 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 19:35:21,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 19:35:21,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1733494138, now seen corresponding path program 1 times [2021-03-25 19:35:21,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 19:35:21,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965482915] [2021-03-25 19:35:21,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 19:35:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 19:35:21,115 INFO L142 QuantifierPusher]: treesize reduction 19, result has 52.5 percent of original size [2021-03-25 19:35:21,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 19:35:21,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:35:21,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 19:35:21,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:35:21,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 19:35:21,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:35:21,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 19:35:21,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:35:21,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 19:35:21,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:35:21,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 19:35:21,170 INFO L142 QuantifierPusher]: treesize reduction 5, result has 70.6 percent of original size [2021-03-25 19:35:21,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 19:35:21,180 INFO L142 QuantifierPusher]: treesize reduction 11, result has 52.2 percent of original size [2021-03-25 19:35:21,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 19:35:21,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:35:21,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:35:21,189 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-25 19:35:21,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965482915] [2021-03-25 19:35:21,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 19:35:21,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 19:35:21,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625468893] [2021-03-25 19:35:21,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 19:35:21,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 19:35:21,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 19:35:21,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 19:35:21,191 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 182 [2021-03-25 19:35:21,192 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 1221 transitions, 26581 flow. Second operand has 8 states, 8 states have (on average 38.375) internal successors, (307), 8 states have internal predecessors, (307), 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-25 19:35:21,192 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 19:35:21,192 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 182 [2021-03-25 19:35:21,192 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 19:35:21,699 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2021-03-25 19:35:30,028 INFO L129 PetriNetUnfolder]: 5928/18088 cut-off events. [2021-03-25 19:35:30,029 INFO L130 PetriNetUnfolder]: For 467712/470879 co-relation queries the response was YES. [2021-03-25 19:35:30,211 INFO L84 FinitePrefix]: Finished finitePrefix Result has 139892 conditions, 18088 events. 5928/18088 cut-off events. For 467712/470879 co-relation queries the response was YES. Maximal size of possible extension queue 1306. Compared 230853 event pairs, 2136 based on Foata normal form. 381/17659 useless extension candidates. Maximal degree in co-relation 139395. Up to 10012 conditions per place. [2021-03-25 19:35:30,281 INFO L132 encePairwiseOnDemand]: 163/182 looper letters, 1057 selfloop transitions, 159 changer transitions 53/1304 dead transitions. [2021-03-25 19:35:30,281 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 1304 transitions, 30726 flow [2021-03-25 19:35:30,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 19:35:30,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 19:35:30,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 570 transitions. [2021-03-25 19:35:30,282 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.28471528471528473 [2021-03-25 19:35:30,282 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 570 transitions. [2021-03-25 19:35:30,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 570 transitions. [2021-03-25 19:35:30,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 19:35:30,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 570 transitions. [2021-03-25 19:35:30,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 51.81818181818182) internal successors, (570), 11 states have internal predecessors, (570), 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-25 19:35:30,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 182.0) internal successors, (2184), 12 states have internal predecessors, (2184), 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-25 19:35:30,286 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 182.0) internal successors, (2184), 12 states have internal predecessors, (2184), 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-25 19:35:30,286 INFO L185 Difference]: Start difference. First operand has 286 places, 1221 transitions, 26581 flow. Second operand 11 states and 570 transitions. [2021-03-25 19:35:30,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 1304 transitions, 30726 flow [2021-03-25 19:35:34,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 1304 transitions, 30123 flow, removed 43 selfloop flow, removed 5 redundant places. [2021-03-25 19:35:34,261 INFO L241 Difference]: Finished difference. Result has 297 places, 1206 transitions, 26336 flow [2021-03-25 19:35:34,262 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=25641, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1052, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=26336, PETRI_PLACES=297, PETRI_TRANSITIONS=1206} [2021-03-25 19:35:34,263 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 249 predicate places. [2021-03-25 19:35:34,263 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 19:35:34,263 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 297 places, 1206 transitions, 26336 flow [2021-03-25 19:35:34,263 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 297 places, 1206 transitions, 26336 flow [2021-03-25 19:35:34,277 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 295 places, 1206 transitions, 26336 flow [2021-03-25 19:35:37,964 INFO L129 PetriNetUnfolder]: 3828/14057 cut-off events. [2021-03-25 19:35:37,964 INFO L130 PetriNetUnfolder]: For 301717/303505 co-relation queries the response was YES. [2021-03-25 19:35:38,249 INFO L84 FinitePrefix]: Finished finitePrefix Result has 97666 conditions, 14057 events. 3828/14057 cut-off events. For 301717/303505 co-relation queries the response was YES. Maximal size of possible extension queue 1030. Compared 187622 event pairs, 903 based on Foata normal form. 529/13824 useless extension candidates. Maximal degree in co-relation 97071. Up to 1854 conditions per place. [2021-03-25 19:35:38,434 INFO L142 LiptonReduction]: Number of co-enabled transitions 7102 [2021-03-25 19:36:53,995 INFO L154 LiptonReduction]: Checked pairs total: 2774 [2021-03-25 19:36:53,995 INFO L156 LiptonReduction]: Total number of compositions: 9 [2021-03-25 19:36:53,995 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 79732 [2021-03-25 19:36:53,996 INFO L480 AbstractCegarLoop]: Abstraction has has 295 places, 1206 transitions, 26354 flow [2021-03-25 19:36:53,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 38.375) internal successors, (307), 8 states have internal predecessors, (307), 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-25 19:36:53,996 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 19:36:53,997 INFO L263 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] [2021-03-25 19:36:53,997 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-25 19:36:53,997 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 19:36:53,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 19:36:53,997 INFO L82 PathProgramCache]: Analyzing trace with hash 777553884, now seen corresponding path program 1 times [2021-03-25 19:36:53,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 19:36:53,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995340620] [2021-03-25 19:36:53,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 19:36:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 19:36:54,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:36:54,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:36:54,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:36:54,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:36:54,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:36:54,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:36:54,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:36:54,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:36:54,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:36:54,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:36:54,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:36:54,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:36:54,052 INFO L142 QuantifierPusher]: treesize reduction 9, result has 43.8 percent of original size [2021-03-25 19:36:54,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:36:54,061 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-25 19:36:54,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995340620] [2021-03-25 19:36:54,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 19:36:54,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 19:36:54,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464204797] [2021-03-25 19:36:54,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 19:36:54,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 19:36:54,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 19:36:54,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-03-25 19:36:54,064 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 191 [2021-03-25 19:36:54,065 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 1206 transitions, 26354 flow. Second operand has 9 states, 9 states have (on average 179.88888888888889) internal successors, (1619), 9 states have internal predecessors, (1619), 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-25 19:36:54,065 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 19:36:54,065 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 191 [2021-03-25 19:36:54,065 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 19:37:00,540 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([108] L31-->L32: Formula: (or (not (< v_n3_2 v_n1_8)) (= v_n3_2 0)) InVars {n3=v_n3_2, n1=v_n1_8} OutVars{n3=v_n3_2, n1=v_n1_8} AuxVars[] AssignedVars[][50], [Black: 260#(and (<= (+ n3 1) n1) (or (<= 2 n2) (<= 2 n3)) (<= 0 n3)), Black: 232#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3)), Black: 236#(and (<= n1 n3) (<= 1 n1)), Black: 238#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 2 n2)), Black: 242#(and (<= n1 n3) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), Black: 244#(and (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 248#(and (or (<= n1 n2) (<= 2 n3)) (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), Black: 250#(and (<= n1 n3) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 252#(and (<= (+ n3 1) n1) (or (<= 1 n3) (<= 2 n2)) (<= 0 n3)), 280#(<= 0 n3), 32#L77true, Black: 288#(and (<= n1 n3) (<= 1 n3) (<= n3 (+ n2 1))), Black: 290#(and (<= n1 n3) (<= 1 n3) (<= n3 n2)), 40#thread2EXITtrue, Black: 292#(and (<= n1 n3) (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 279#(and (<= n1 n3) (<= 0 n3)), Black: 281#(and (<= n3 n2) (<= 0 n3)), Black: 282#(and (<= 1 n3) (<= n3 (+ n2 1))), Black: 283#(and (<= 1 n3) (<= n3 n2)), Black: 284#(and (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 286#(and (<= n1 n3) (<= n3 n2) (<= 0 n3)), 50#thread3EXITtrue, 55#L32true, Black: 306#(and (<= n1 n2) (< n2 (+ n3 1)) (<= n3 n2) (<= 0 n2) (<= n2 0)), Black: 307#(and (<= n2 n3) (<= n3 0) (<= 0 n2)), Black: 308#(and (<= 0 n2) (<= (+ n2 1) n3) (<= n3 1)), Black: 309#(and (< n2 (+ n3 1)) (<= n3 n2) (<= 1 n2)), 315#true, 67#true, Black: 320#(and (<= n1 n2) (<= 0 n1)), Black: 336#(and (<= 1 n1) (or (<= n1 n3) (<= 1 n2)) (or (<= n1 n3) (< n2 n1))), Black: 321#(and (<= 1 n1) (<= n1 (+ n2 1))), Black: 323#(and (<= 1 n1) (or (<= n1 n3) (<= 0 n2))), Black: 328#(and (<= n1 n2) (<= 1 n1)), Black: 332#(and (<= n1 n3) (<= n1 n2) (<= 1 n1)), Black: 317#(and (<= n1 n3) (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 318#(and (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 83#(and (<= i3 0) (<= 2 i) (<= i1 1) (<= i 2) (<= 0 i3) (<= 1 i1)), Black: 69#(and (<= i 0) (<= 0 i)), Black: 334#(and (<= n1 n2) (<= 1 n1) (<= n3 n1)), Black: 319#(and (<= n1 n2) (<= 0 n1) (<= n3 n1)), Black: 79#(and (<= i3 0) (<= 1 i) (<= i 1) (<= 0 i3)), 350#true, 95#true, Black: 352#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 354#(and (<= n1 (+ n3 1)) (<= (+ n3 1) n1) (<= 1 n1)), Black: 355#(and (<= n1 n3) (<= 1 n1) (< n3 (+ n1 1))), Black: 97#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 357#(and (<= n1 n3) (<= 1 n1) (<= n2 n1) (< n3 (+ n1 1))), Black: 98#(and (<= (+ n3 1) n1) (<= 1 n1) (<= (+ n2 1) n1)), Black: 99#(and (<= (+ n3 1) n1) (<= 1 n1) (= n2 n1)), Black: 101#(and (<= 1 n1) (<= (+ n1 1) n2)), 366#(and (<= n3 n2) (<= 0 n3) (<= n3 n1)), Black: 111#e2, 114#true, Black: 116#(and (<= n1 n3) (<= n3 n2) (<= 0 n2)), Black: 117#(and (<= n1 n2) (<= n3 n2) (<= 0 n2)), Black: 118#(and (<= n3 n2) (<= 0 n2)), Black: 119#(and (<= 1 n2) (<= (+ n3 1) n2)), Black: 120#(and (= n3 n2) (<= 1 n2)), Black: 385#(and (<= (+ n2 1) n1) (<= n3 n2) (<= 0 n3) (<= 1 n2)), Black: 387#(and (<= (+ n2 1) n1) (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 121#(and (<= (+ n2 1) n3) (<= 1 n2)), Black: 123#(and (<= n1 n3) (<= 1 n2) (<= (+ n3 1) n2)), Black: 365#(and (<= n1 n2) (<= 0 n3) (<= n3 n1)), Black: 125#(and (<= n1 n2) (<= 1 n2) (<= (+ n3 1) n2)), Black: 367#(and (<= 0 n3) (<= n3 n1) (<= 0 n2)), Black: 369#(and (<= 0 n1) (<= 1 n2)), Black: 370#(and (<= 1 n1) (<= 1 n2)), Black: 371#(and (<= (+ n2 1) n1) (<= 1 n2)), Black: 139#e3, Black: 373#(and (<= n1 n2) (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 375#(and (<= n1 n2) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 377#(and (<= n3 n2) (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 379#(and (<= 1 n1) (<= n3 n2) (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 381#(and (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 144#e1, Black: 383#(and (<= 1 n1) (<= 0 n3) (<= n3 n1) (<= 1 n2)), 147#true, 403#true, Black: 151#(and (<= n3 n2) (<= 0 n3)), Black: 152#(and (<= 0 n3) (<= (+ n3 1) n2)), Black: 153#(and (<= 1 n3) (< n3 (+ n2 1))), Black: 154#(and (<= 1 n3) (< n3 (+ n2 1)) (not (= n3 n2))), 160#true, Black: 162#(and (<= n1 n2) (<= n3 n2) (<= n2 n3) (<= 0 n2)), Black: 163#(and (= n3 n2) (<= 0 n2)), Black: 164#(and (<= n2 n3) (<= 0 n2)), Black: 165#(and (<= n2 (+ n3 1)) (<= 1 n2)), Black: 166#(and (<= n2 n3) (<= 1 n2)), Black: 417#(and (<= 1 n3) (<= 1 n1)), Black: 419#(and (<= 1 n3) (<= 0 n1)), Black: 421#(and (<= 1 n3) (< n1 (+ n2 1)) (<= 1 n1)), Black: 423#(and (<= 1 n3) (or (<= (+ n3 1) n1) (< n1 (+ n2 1))) (<= 1 n1)), Black: 425#(and (<= 1 n3) (<= (+ n3 1) n1)), Black: 427#(and (<= 1 n3) (<= (+ n3 1) n1) (< n1 (+ n2 1))), Black: 429#(and (<= (+ n3 1) n1) (<= 1 n1) (or (<= n1 n2) (<= 1 n3))), Black: 431#(and (<= (+ n3 1) n1) (< n1 (+ n2 1)) (<= 1 n1)), Black: 433#(and (<= (+ n3 1) n1) (< n1 (+ n2 1)) (<= 1 n1) (or (<= 1 n3) (<= (+ n1 1) n2))), 187#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 406#(and (<= 0 n3) (<= n3 n1) (= n2 n1)), Black: 408#(and (or (<= 1 n3) (= n2 n1)) (<= 0 n1)), Black: 409#(and (<= 0 n1) (or (<= 1 n3) (<= (+ n1 1) n2))), Black: 410#(and (<= 1 n1) (or (<= n1 n2) (<= 1 n3))), Black: 415#(and (<= 1 n3) (<= 0 n2) (= n2 n1)), Black: 178#(and (= n3 n1) (<= 1 n1)), Black: 195#(and (<= 1 n1) (<= 0 n3) (<= 2 n2)), Black: 197#(and (<= 1 n1) (<= 0 n3) (<= 3 n2)), Black: 185#(and (<= 0 n3) (<= n3 n1)), Black: 201#(and (< n2 n1) (<= 0 n3) (<= 3 n2)), Black: 189#(and (<= 1 n1) (<= 0 n3) (or (<= n1 n3) (<= 2 n2))), Black: 191#(and (<= 1 n1) (<= 0 n3) (or (<= (+ n1 1) n3) (<= 2 n2))), Black: 453#(and (<= 0 n3) (<= n3 n1) (<= 0 n2)), Black: 175#(<= 0 n3), Black: 456#(and (<= 1 n1) (<= 1 n2)), Black: 457#(and (< n1 (+ n2 1)) (<= 1 n1)), Black: 461#(and (< n1 (+ n2 1)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), 475#true, 230#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 480#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 481#(and (<= 1 n3) (< n3 (+ n1 1))), Black: 484#(and (<= n1 n3) (<= 1 n1) (<= n2 n1) (< n3 (+ n1 1))), Black: 486#(and (<= 1 n3) (<= n2 n3) (< n3 (+ n1 1))), Black: 488#(and (<= 1 n3) (<= (+ n3 1) n1) (<= n2 n3)), Black: 490#(and (<= 1 n3) (<= (+ n3 1) n1)), 498#true]) [2021-03-25 19:37:00,540 INFO L384 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2021-03-25 19:37:00,540 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-25 19:37:00,540 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 19:37:00,541 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2021-03-25 19:37:01,147 INFO L129 PetriNetUnfolder]: 4510/15820 cut-off events. [2021-03-25 19:37:01,147 INFO L130 PetriNetUnfolder]: For 333175/335936 co-relation queries the response was YES. [2021-03-25 19:37:01,470 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111677 conditions, 15820 events. 4510/15820 cut-off events. For 333175/335936 co-relation queries the response was YES. Maximal size of possible extension queue 1000. Compared 207495 event pairs, 1002 based on Foata normal form. 809/15809 useless extension candidates. Maximal degree in co-relation 111104. Up to 2186 conditions per place. [2021-03-25 19:37:01,525 INFO L132 encePairwiseOnDemand]: 181/191 looper letters, 29 selfloop transitions, 29 changer transitions 3/1240 dead transitions. [2021-03-25 19:37:01,525 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 1240 transitions, 26611 flow [2021-03-25 19:37:01,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-25 19:37:01,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-25 19:37:01,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2371 transitions. [2021-03-25 19:37:01,528 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.954893274265002 [2021-03-25 19:37:01,528 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2371 transitions. [2021-03-25 19:37:01,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2371 transitions. [2021-03-25 19:37:01,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 19:37:01,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2371 transitions. [2021-03-25 19:37:01,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 182.3846153846154) internal successors, (2371), 13 states have internal predecessors, (2371), 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-25 19:37:01,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 191.0) internal successors, (2674), 14 states have internal predecessors, (2674), 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-25 19:37:01,535 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 191.0) internal successors, (2674), 14 states have internal predecessors, (2674), 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-25 19:37:01,535 INFO L185 Difference]: Start difference. First operand has 295 places, 1206 transitions, 26354 flow. Second operand 13 states and 2371 transitions. [2021-03-25 19:37:01,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 1240 transitions, 26611 flow [2021-03-25 19:37:04,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 1240 transitions, 26295 flow, removed 95 selfloop flow, removed 5 redundant places. [2021-03-25 19:37:04,552 INFO L241 Difference]: Finished difference. Result has 308 places, 1223 transitions, 26182 flow [2021-03-25 19:37:04,553 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=26038, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=26182, PETRI_PLACES=308, PETRI_TRANSITIONS=1223} [2021-03-25 19:37:04,553 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 260 predicate places. [2021-03-25 19:37:04,553 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 19:37:04,554 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 308 places, 1223 transitions, 26182 flow [2021-03-25 19:37:04,554 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 308 places, 1223 transitions, 26182 flow [2021-03-25 19:37:04,566 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 308 places, 1223 transitions, 26182 flow [2021-03-25 19:37:07,841 INFO L129 PetriNetUnfolder]: 4207/15373 cut-off events. [2021-03-25 19:37:07,841 INFO L130 PetriNetUnfolder]: For 319796/321909 co-relation queries the response was YES. [2021-03-25 19:37:07,997 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110337 conditions, 15373 events. 4207/15373 cut-off events. For 319796/321909 co-relation queries the response was YES. Maximal size of possible extension queue 1015. Compared 205030 event pairs, 897 based on Foata normal form. 663/15325 useless extension candidates. Maximal degree in co-relation 109624. Up to 2175 conditions per place. [2021-03-25 19:37:08,350 INFO L142 LiptonReduction]: Number of co-enabled transitions 7618 [2021-03-25 19:38:35,021 INFO L154 LiptonReduction]: Checked pairs total: 1899 [2021-03-25 19:38:35,021 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 19:38:35,022 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 90469 [2021-03-25 19:38:35,022 INFO L480 AbstractCegarLoop]: Abstraction has has 307 places, 1222 transitions, 26189 flow [2021-03-25 19:38:35,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 179.88888888888889) internal successors, (1619), 9 states have internal predecessors, (1619), 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-25 19:38:35,023 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 19:38:35,023 INFO L263 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] [2021-03-25 19:38:35,023 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-25 19:38:35,023 INFO L428 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 19:38:35,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 19:38:35,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1242840150, now seen corresponding path program 1 times [2021-03-25 19:38:35,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 19:38:35,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070823139] [2021-03-25 19:38:35,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 19:38:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 19:38:35,047 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:38:35,047 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:38:35,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:38:35,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:38:35,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:38:35,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:38:35,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:38:35,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:38:35,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:38:35,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:38:35,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:38:35,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:38:35,085 INFO L142 QuantifierPusher]: treesize reduction 9, result has 43.8 percent of original size [2021-03-25 19:38:35,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:38:35,093 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-25 19:38:35,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070823139] [2021-03-25 19:38:35,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 19:38:35,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 19:38:35,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514399388] [2021-03-25 19:38:35,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 19:38:35,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 19:38:35,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 19:38:35,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-03-25 19:38:35,095 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 196 [2021-03-25 19:38:35,096 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 1222 transitions, 26189 flow. Second operand has 9 states, 9 states have (on average 180.88888888888889) internal successors, (1628), 9 states have internal predecessors, (1628), 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-25 19:38:35,097 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 19:38:35,097 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 196 [2021-03-25 19:38:35,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 19:38:42,603 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([108] L31-->L32: Formula: (or (not (< v_n3_2 v_n1_8)) (= v_n3_2 0)) InVars {n3=v_n3_2, n1=v_n1_8} OutVars{n3=v_n3_2, n1=v_n1_8} AuxVars[] AssignedVars[][50], [Black: 260#(and (<= (+ n3 1) n1) (or (<= 2 n2) (<= 2 n3)) (<= 0 n3)), Black: 232#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3)), Black: 514#(and (<= 2 i) (<= i 2) (<= 1 i3) (<= i3 1) (<= i1 0) (<= 0 i1)), Black: 236#(and (<= n1 n3) (<= 1 n1)), Black: 500#(and (<= i 0) (<= 0 i)), Black: 501#(and (<= i1 0) (<= 0 i1)), Black: 238#(and (<= n1 n2) (<= (+ n3 1) n1) (<= 0 n3) (<= 2 n2)), Black: 502#(and (<= 1 i) (<= i 1)), Black: 242#(and (<= n1 n3) (or (<= 3 n2) (<= 2 n3)) (<= 1 n1)), Black: 520#(and (<= 2 i2) (<= i2 2) (< 2 i) (<= i 3) (<= 1 i3) (<= i3 1) (<= i1 0) (<= 0 i1)), Black: 244#(and (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 510#(and (<= 1 i) (<= i1 0) (<= 0 i1) (<= i 1)), Black: 248#(and (or (<= n1 n2) (<= 2 n3)) (or (<= 1 n3) (<= 2 n2)) (<= 1 n1) (<= 0 n3) (<= n3 n1) (or (<= n1 n3) (<= n1 n2))), 528#true, Black: 250#(and (<= n1 n3) (or (<= 2 n2) (<= 2 n3)) (<= 1 n1)), Black: 252#(and (<= (+ n3 1) n1) (or (<= 1 n3) (<= 2 n2)) (<= 0 n3)), 280#(<= 0 n3), 32#L77true, Black: 288#(and (<= n1 n3) (<= 1 n3) (<= n3 (+ n2 1))), Black: 290#(and (<= n1 n3) (<= 1 n3) (<= n3 n2)), Black: 292#(and (<= n1 n3) (<= 1 n3) (<= n3 n2) (not (= n3 n2))), 40#thread2EXITtrue, Black: 279#(and (<= n1 n3) (<= 0 n3)), Black: 281#(and (<= n3 n2) (<= 0 n3)), Black: 282#(and (<= 1 n3) (<= n3 (+ n2 1))), Black: 283#(and (<= 1 n3) (<= n3 n2)), Black: 284#(and (<= 1 n3) (<= n3 n2) (not (= n3 n2))), Black: 286#(and (<= n1 n3) (<= n3 n2) (<= 0 n3)), 50#thread3EXITtrue, Black: 306#(and (<= n1 n2) (< n2 (+ n3 1)) (<= n3 n2) (<= 0 n2) (<= n2 0)), 55#L32true, Black: 307#(and (<= n2 n3) (<= n3 0) (<= 0 n2)), Black: 308#(and (<= 0 n2) (<= (+ n2 1) n3) (<= n3 1)), Black: 309#(and (< n2 (+ n3 1)) (<= n3 n2) (<= 1 n2)), 315#true, 67#true, Black: 320#(and (<= n1 n2) (<= 0 n1)), Black: 336#(and (<= 1 n1) (or (<= n1 n3) (<= 1 n2)) (or (<= n1 n3) (< n2 n1))), Black: 321#(and (<= 1 n1) (<= n1 (+ n2 1))), Black: 323#(and (<= 1 n1) (or (<= n1 n3) (<= 0 n2))), Black: 328#(and (<= n1 n2) (<= 1 n1)), Black: 332#(and (<= n1 n3) (<= n1 n2) (<= 1 n1)), Black: 317#(and (<= n1 n3) (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 318#(and (<= n1 n2) (<= n2 n1) (<= n3 n1) (<= 0 n2)), Black: 83#(and (<= i3 0) (<= 2 i) (<= i1 1) (<= i 2) (<= 0 i3) (<= 1 i1)), Black: 69#(and (<= i 0) (<= 0 i)), Black: 334#(and (<= n1 n2) (<= 1 n1) (<= n3 n1)), Black: 79#(and (<= i3 0) (<= 1 i) (<= i 1) (<= 0 i3)), 350#true, 95#true, Black: 352#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 354#(and (<= n1 (+ n3 1)) (<= (+ n3 1) n1) (<= 1 n1)), Black: 355#(and (<= n1 n3) (<= 1 n1) (< n3 (+ n1 1))), Black: 97#(and (<= n1 n3) (<= 0 n3) (<= n2 n1) (<= n3 n1)), Black: 357#(and (<= n1 n3) (<= 1 n1) (<= n2 n1) (< n3 (+ n1 1))), Black: 98#(and (<= (+ n3 1) n1) (<= 1 n1) (<= (+ n2 1) n1)), Black: 99#(and (<= (+ n3 1) n1) (<= 1 n1) (= n2 n1)), Black: 101#(and (<= 1 n1) (<= (+ n1 1) n2)), 366#(and (<= n3 n2) (<= 0 n3) (<= n3 n1)), Black: 111#e2, 114#true, Black: 116#(and (<= n1 n3) (<= n3 n2) (<= 0 n2)), Black: 117#(and (<= n1 n2) (<= n3 n2) (<= 0 n2)), Black: 118#(and (<= n3 n2) (<= 0 n2)), Black: 119#(and (<= 1 n2) (<= (+ n3 1) n2)), Black: 120#(and (= n3 n2) (<= 1 n2)), Black: 385#(and (<= (+ n2 1) n1) (<= n3 n2) (<= 0 n3) (<= 1 n2)), Black: 121#(and (<= (+ n2 1) n3) (<= 1 n2)), Black: 387#(and (<= (+ n2 1) n1) (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 123#(and (<= n1 n3) (<= 1 n2) (<= (+ n3 1) n2)), Black: 365#(and (<= n1 n2) (<= 0 n3) (<= n3 n1)), Black: 125#(and (<= n1 n2) (<= 1 n2) (<= (+ n3 1) n2)), Black: 367#(and (<= 0 n3) (<= n3 n1) (<= 0 n2)), Black: 369#(and (<= 0 n1) (<= 1 n2)), Black: 370#(and (<= 1 n1) (<= 1 n2)), Black: 371#(and (<= (+ n2 1) n1) (<= 1 n2)), Black: 373#(and (<= n1 n2) (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 139#e3, Black: 375#(and (<= n1 n2) (<= 1 n1) (<= 0 n3) (<= n3 n1)), Black: 377#(and (<= n3 n2) (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 379#(and (<= 1 n1) (<= n3 n2) (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 381#(and (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 383#(and (<= 1 n1) (<= 0 n3) (<= n3 n1) (<= 1 n2)), Black: 144#e1, 147#true, 403#true, Black: 151#(and (<= n3 n2) (<= 0 n3)), Black: 152#(and (<= 0 n3) (<= (+ n3 1) n2)), Black: 153#(and (<= 1 n3) (< n3 (+ n2 1))), Black: 154#(and (<= 1 n3) (< n3 (+ n2 1)) (not (= n3 n2))), 160#true, Black: 162#(and (<= n1 n2) (<= n3 n2) (<= n2 n3) (<= 0 n2)), Black: 163#(and (= n3 n2) (<= 0 n2)), Black: 164#(and (<= n2 n3) (<= 0 n2)), Black: 165#(and (<= n2 (+ n3 1)) (<= 1 n2)), Black: 166#(and (<= n2 n3) (<= 1 n2)), Black: 417#(and (<= 1 n3) (<= 1 n1)), Black: 419#(and (<= 1 n3) (<= 0 n1)), Black: 421#(and (<= 1 n3) (< n1 (+ n2 1)) (<= 1 n1)), Black: 423#(and (<= 1 n3) (or (<= (+ n3 1) n1) (< n1 (+ n2 1))) (<= 1 n1)), Black: 425#(and (<= 1 n3) (<= (+ n3 1) n1)), Black: 427#(and (<= 1 n3) (<= (+ n3 1) n1) (< n1 (+ n2 1))), Black: 429#(and (<= (+ n3 1) n1) (<= 1 n1) (or (<= n1 n2) (<= 1 n3))), Black: 431#(and (<= (+ n3 1) n1) (< n1 (+ n2 1)) (<= 1 n1)), Black: 433#(and (<= (+ n3 1) n1) (< n1 (+ n2 1)) (<= 1 n1) (or (<= 1 n3) (<= (+ n1 1) n2))), 187#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 406#(and (<= 0 n3) (<= n3 n1) (= n2 n1)), Black: 408#(and (or (<= 1 n3) (= n2 n1)) (<= 0 n1)), Black: 409#(and (<= 0 n1) (or (<= 1 n3) (<= (+ n1 1) n2))), Black: 410#(and (<= 1 n1) (or (<= n1 n2) (<= 1 n3))), Black: 415#(and (<= 1 n3) (<= 0 n2) (= n2 n1)), Black: 178#(and (= n3 n1) (<= 1 n1)), Black: 195#(and (<= 1 n1) (<= 0 n3) (<= 2 n2)), Black: 197#(and (<= 1 n1) (<= 0 n3) (<= 3 n2)), Black: 185#(and (<= 0 n3) (<= n3 n1)), Black: 201#(and (< n2 n1) (<= 0 n3) (<= 3 n2)), Black: 189#(and (<= 1 n1) (<= 0 n3) (or (<= n1 n3) (<= 2 n2))), Black: 453#(and (<= 0 n3) (<= n3 n1) (<= 0 n2)), Black: 191#(and (<= 1 n1) (<= 0 n3) (or (<= (+ n1 1) n3) (<= 2 n2))), Black: 456#(and (<= 1 n1) (<= 1 n2)), Black: 175#(<= 0 n3), Black: 457#(and (< n1 (+ n2 1)) (<= 1 n1)), Black: 461#(and (< n1 (+ n2 1)) (<= 1 n1) (<= 0 n3) (<= n3 n1)), 475#true, 230#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 480#(and (<= (+ n3 1) n1) (<= 0 n3)), Black: 481#(and (<= 1 n3) (< n3 (+ n1 1))), Black: 484#(and (<= n1 n3) (<= 1 n1) (<= n2 n1) (< n3 (+ n1 1))), Black: 486#(and (<= 1 n3) (<= n2 n3) (< n3 (+ n1 1))), 498#true]) [2021-03-25 19:38:42,604 INFO L384 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2021-03-25 19:38:42,604 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2021-03-25 19:38:42,604 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-25 19:38:42,604 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 19:38:43,095 INFO L129 PetriNetUnfolder]: 4616/16529 cut-off events. [2021-03-25 19:38:43,096 INFO L130 PetriNetUnfolder]: For 340432/344214 co-relation queries the response was YES. [2021-03-25 19:38:43,441 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121797 conditions, 16529 events. 4616/16529 cut-off events. For 340432/344214 co-relation queries the response was YES. Maximal size of possible extension queue 1097. Compared 219325 event pairs, 1011 based on Foata normal form. 1470/17183 useless extension candidates. Maximal degree in co-relation 121220. Up to 2343 conditions per place. [2021-03-25 19:38:43,493 INFO L132 encePairwiseOnDemand]: 182/196 looper letters, 38 selfloop transitions, 45 changer transitions 51/1262 dead transitions. [2021-03-25 19:38:43,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 1262 transitions, 26606 flow [2021-03-25 19:38:43,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-03-25 19:38:43,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-03-25 19:38:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3302 transitions. [2021-03-25 19:38:43,496 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9359410430839002 [2021-03-25 19:38:43,496 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3302 transitions. [2021-03-25 19:38:43,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3302 transitions. [2021-03-25 19:38:43,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 19:38:43,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3302 transitions. [2021-03-25 19:38:43,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 183.44444444444446) internal successors, (3302), 18 states have internal predecessors, (3302), 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-25 19:38:43,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 196.0) internal successors, (3724), 19 states have internal predecessors, (3724), 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-25 19:38:43,505 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 196.0) internal successors, (3724), 19 states have internal predecessors, (3724), 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-25 19:38:43,505 INFO L185 Difference]: Start difference. First operand has 307 places, 1222 transitions, 26189 flow. Second operand 18 states and 3302 transitions. [2021-03-25 19:38:43,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 1262 transitions, 26606 flow [2021-03-25 19:38:46,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 1262 transitions, 26531 flow, removed 34 selfloop flow, removed 1 redundant places. [2021-03-25 19:38:46,458 INFO L241 Difference]: Finished difference. Result has 332 places, 1192 transitions, 25131 flow [2021-03-25 19:38:46,459 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=26127, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=25131, PETRI_PLACES=332, PETRI_TRANSITIONS=1192} [2021-03-25 19:38:46,459 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 284 predicate places. [2021-03-25 19:38:46,459 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 19:38:46,459 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 332 places, 1192 transitions, 25131 flow [2021-03-25 19:38:46,459 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 332 places, 1192 transitions, 25131 flow [2021-03-25 19:38:46,467 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 332 places, 1192 transitions, 25131 flow [2021-03-25 19:38:50,240 INFO L129 PetriNetUnfolder]: 4335/15842 cut-off events. [2021-03-25 19:38:50,240 INFO L130 PetriNetUnfolder]: For 339577/341972 co-relation queries the response was YES. [2021-03-25 19:38:50,434 INFO L84 FinitePrefix]: Finished finitePrefix Result has 117431 conditions, 15842 events. 4335/15842 cut-off events. For 339577/341972 co-relation queries the response was YES. Maximal size of possible extension queue 1057. Compared 211154 event pairs, 872 based on Foata normal form. 718/15796 useless extension candidates. Maximal degree in co-relation 116682. Up to 2327 conditions per place. [2021-03-25 19:38:50,623 INFO L142 LiptonReduction]: Number of co-enabled transitions 7780 [2021-03-25 19:39:31,863 INFO L154 LiptonReduction]: Checked pairs total: 396 [2021-03-25 19:39:31,863 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 19:39:31,864 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 45405 [2021-03-25 19:39:31,864 INFO L480 AbstractCegarLoop]: Abstraction has has 331 places, 1191 transitions, 25162 flow [2021-03-25 19:39:31,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 180.88888888888889) internal successors, (1628), 9 states have internal predecessors, (1628), 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-25 19:39:31,865 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 19:39:31,865 INFO L263 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] [2021-03-25 19:39:31,865 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-25 19:39:31,865 INFO L428 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 19:39:31,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 19:39:31,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1796354838, now seen corresponding path program 1 times [2021-03-25 19:39:31,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 19:39:31,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897450023] [2021-03-25 19:39:31,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 19:39:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 19:39:31,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:39:31,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 19:39:31,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:39:31,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 19:39:31,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:39:31,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:39:31,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:39:31,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 19:39:31,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:39:31,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 19:39:31,912 INFO L142 QuantifierPusher]: treesize reduction 21, result has 34.4 percent of original size [2021-03-25 19:39:31,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 19:39:31,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:39:31,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 19:39:31,930 INFO L142 QuantifierPusher]: treesize reduction 1, result has 90.0 percent of original size [2021-03-25 19:39:31,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 19:39:31,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 19:39:31,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 19:39:31,940 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-25 19:39:31,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897450023] [2021-03-25 19:39:31,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 19:39:31,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 19:39:31,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202952913] [2021-03-25 19:39:31,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 19:39:31,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 19:39:31,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 19:39:31,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-03-25 19:39:31,942 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 201 [2021-03-25 19:39:31,943 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 1191 transitions, 25162 flow. Second operand has 10 states, 10 states have (on average 44.9) internal successors, (449), 10 states have internal predecessors, (449), 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-25 19:39:31,943 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 19:39:31,943 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 201 [2021-03-25 19:39:31,943 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 19:39:40,449 INFO L129 PetriNetUnfolder]: 6704/21014 cut-off events. [2021-03-25 19:39:40,449 INFO L130 PetriNetUnfolder]: For 525373/528297 co-relation queries the response was YES. [2021-03-25 19:39:40,757 INFO L84 FinitePrefix]: Finished finitePrefix Result has 170171 conditions, 21014 events. 6704/21014 cut-off events. For 525373/528297 co-relation queries the response was YES. Maximal size of possible extension queue 1299. Compared 270257 event pairs, 1281 based on Foata normal form. 1029/21353 useless extension candidates. Maximal degree in co-relation 169601. Up to 3051 conditions per place. [2021-03-25 19:39:40,834 INFO L132 encePairwiseOnDemand]: 144/201 looper letters, 850 selfloop transitions, 648 changer transitions 98/1668 dead transitions. [2021-03-25 19:39:40,834 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 1668 transitions, 37851 flow [2021-03-25 19:39:40,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-03-25 19:39:40,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-03-25 19:39:40,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1004 transitions. [2021-03-25 19:39:40,836 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.2938249926836406 [2021-03-25 19:39:40,837 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1004 transitions. [2021-03-25 19:39:40,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1004 transitions. [2021-03-25 19:39:40,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 19:39:40,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1004 transitions. [2021-03-25 19:39:40,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 59.05882352941177) internal successors, (1004), 17 states have internal predecessors, (1004), 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-25 19:39:40,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 201.0) internal successors, (3618), 18 states have internal predecessors, (3618), 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-25 19:39:40,841 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 201.0) internal successors, (3618), 18 states have internal predecessors, (3618), 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-25 19:39:40,841 INFO L185 Difference]: Start difference. First operand has 331 places, 1191 transitions, 25162 flow. Second operand 17 states and 1004 transitions. [2021-03-25 19:39:40,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 1668 transitions, 37851 flow [2021-03-25 19:39:45,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 1668 transitions, 37735 flow, removed 46 selfloop flow, removed 5 redundant places. [2021-03-25 19:39:45,520 INFO L241 Difference]: Finished difference. Result has 357 places, 1349 transitions, 31041 flow [2021-03-25 19:39:45,520 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=24909, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=450, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=31041, PETRI_PLACES=357, PETRI_TRANSITIONS=1349} [2021-03-25 19:39:45,520 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 309 predicate places. [2021-03-25 19:39:45,520 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 19:39:45,521 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 357 places, 1349 transitions, 31041 flow [2021-03-25 19:39:45,521 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 357 places, 1349 transitions, 31041 flow [2021-03-25 19:39:45,531 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 353 places, 1349 transitions, 31041 flow [2021-03-25 19:39:49,938 INFO L129 PetriNetUnfolder]: 4774/17395 cut-off events. [2021-03-25 19:39:49,938 INFO L130 PetriNetUnfolder]: For 475109/477683 co-relation queries the response was YES. [2021-03-25 19:39:50,172 INFO L84 FinitePrefix]: Finished finitePrefix Result has 140253 conditions, 17395 events. 4774/17395 cut-off events. For 475109/477683 co-relation queries the response was YES. Maximal size of possible extension queue 1184. Compared 233308 event pairs, 970 based on Foata normal form. 836/17389 useless extension candidates. Maximal degree in co-relation 139782. Up to 2614 conditions per place. [2021-03-25 19:39:50,396 INFO L142 LiptonReduction]: Number of co-enabled transitions 8334 [2021-03-25 19:40:09,091 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 10 Received shutdown request... [2021-03-25 19:40:22,050 WARN L222 SmtUtils]: Removed 1 from assertion stack [2021-03-25 19:40:22,051 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-25 19:40:22,051 WARN L545 AbstractCegarLoop]: Verification canceled [2021-03-25 19:40:22,053 WARN L224 ceAbstractionStarter]: Timeout [2021-03-25 19:40:22,053 INFO L202 PluginConnector]: Adding new model bakery-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 07:40:22 BasicIcfg [2021-03-25 19:40:22,054 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 19:40:22,054 INFO L168 Benchmark]: Toolchain (without parser) took 857382.98 ms. Allocated memory was 255.9 MB in the beginning and 10.3 GB in the end (delta: 10.0 GB). Free memory was 236.7 MB in the beginning and 8.4 GB in the end (delta: -8.2 GB). Peak memory consumption was 2.5 GB. Max. memory is 16.0 GB. [2021-03-25 19:40:22,054 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.12 ms. Allocated memory is still 255.9 MB. Free memory was 237.9 MB in the beginning and 237.8 MB in the end (delta: 92.6 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 19:40:22,054 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.24 ms. Allocated memory is still 255.9 MB. Free memory was 236.6 MB in the beginning and 235.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 19:40:22,055 INFO L168 Benchmark]: Boogie Preprocessor took 29.79 ms. Allocated memory is still 255.9 MB. Free memory was 235.1 MB in the beginning and 234.1 MB in the end (delta: 982.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 19:40:22,055 INFO L168 Benchmark]: RCFGBuilder took 249.99 ms. Allocated memory is still 255.9 MB. Free memory was 234.0 MB in the beginning and 236.9 MB in the end (delta: -2.9 MB). Peak memory consumption was 21.7 MB. Max. memory is 16.0 GB. [2021-03-25 19:40:22,055 INFO L168 Benchmark]: TraceAbstraction took 857066.65 ms. Allocated memory was 255.9 MB in the beginning and 10.3 GB in the end (delta: 10.0 GB). Free memory was 236.4 MB in the beginning and 8.4 GB in the end (delta: -8.2 GB). Peak memory consumption was 2.5 GB. Max. memory is 16.0 GB. [2021-03-25 19:40:22,055 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.12 ms. Allocated memory is still 255.9 MB. Free memory was 237.9 MB in the beginning and 237.8 MB in the end (delta: 92.6 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 32.24 ms. Allocated memory is still 255.9 MB. Free memory was 236.6 MB in the beginning and 235.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 29.79 ms. Allocated memory is still 255.9 MB. Free memory was 235.1 MB in the beginning and 234.1 MB in the end (delta: 982.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 249.99 ms. Allocated memory is still 255.9 MB. Free memory was 234.0 MB in the beginning and 236.9 MB in the end (delta: -2.9 MB). Peak memory consumption was 21.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 857066.65 ms. Allocated memory was 255.9 MB in the beginning and 10.3 GB in the end (delta: 10.0 GB). Free memory was 236.4 MB in the beginning and 8.4 GB in the end (delta: -8.2 GB). Peak memory consumption was 2.5 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 596.8ms, 58 PlacesBefore, 48 PlacesAfterwards, 48 TransitionsBefore, 38 TransitionsAfterwards, 1170 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 2728 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 973, positive: 873, positive conditional: 0, positive unconditional: 873, negative: 100, negative conditional: 0, negative unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 688, positive: 615, positive conditional: 0, positive unconditional: 615, negative: 73, negative conditional: 0, negative unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 688, positive: 615, positive conditional: 0, positive unconditional: 615, negative: 73, negative conditional: 0, negative unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 688, positive: 590, positive conditional: 0, positive unconditional: 590, negative: 98, negative conditional: 0, negative unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 98, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 73, negative conditional: 0, negative unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 336, positive: 77, positive conditional: 0, positive unconditional: 77, negative: 259, negative conditional: 0, negative unconditional: 259, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 973, positive: 258, positive conditional: 0, positive unconditional: 258, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 688, unknown conditional: 0, unknown unconditional: 688] , Statistics on independence cache: Total cache size (in pairs): 373, Positive cache size: 321, Positive conditional cache size: 0, Positive unconditional cache size: 321, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 64.9ms, 56 PlacesBefore, 54 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 978 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 3129 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1044, positive: 927, positive conditional: 0, positive unconditional: 927, negative: 117, negative conditional: 0, negative unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 121, positive: 117, positive conditional: 0, positive unconditional: 117, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 121, positive: 117, positive conditional: 0, positive unconditional: 117, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 121, positive: 117, positive conditional: 0, positive unconditional: 117, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1044, positive: 810, positive conditional: 0, positive unconditional: 810, negative: 113, negative conditional: 0, negative unconditional: 113, unknown: 121, unknown conditional: 0, unknown unconditional: 121] , Statistics on independence cache: Total cache size (in pairs): 468, Positive cache size: 423, Positive conditional cache size: 0, Positive unconditional cache size: 423, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 122.8ms, 64 PlacesBefore, 64 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 1276 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1563 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 576, positive: 527, positive conditional: 0, positive unconditional: 527, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 576, positive: 511, positive conditional: 0, positive unconditional: 511, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 486, Positive cache size: 439, Positive conditional cache size: 0, Positive unconditional cache size: 439, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 66.2ms, 67 PlacesBefore, 67 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 1194 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1237 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 432, positive: 392, positive conditional: 0, positive unconditional: 392, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 432, positive: 392, positive conditional: 0, positive unconditional: 392, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 486, Positive cache size: 439, Positive conditional cache size: 0, Positive unconditional cache size: 439, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 516.6ms, 83 PlacesBefore, 83 PlacesAfterwards, 126 TransitionsBefore, 126 TransitionsAfterwards, 2104 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 4334 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 880, positive: 791, positive conditional: 0, positive unconditional: 791, negative: 89, negative conditional: 0, negative unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 880, positive: 774, positive conditional: 0, positive unconditional: 774, negative: 82, negative conditional: 0, negative unconditional: 82, unknown: 24, unknown conditional: 0, unknown unconditional: 24] , Statistics on independence cache: Total cache size (in pairs): 505, Positive cache size: 455, Positive conditional cache size: 0, Positive unconditional cache size: 455, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 424.7ms, 86 PlacesBefore, 86 PlacesAfterwards, 126 TransitionsBefore, 126 TransitionsAfterwards, 1868 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 3396 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 622, positive: 551, positive conditional: 0, positive unconditional: 551, negative: 71, negative conditional: 0, negative unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 622, positive: 536, positive conditional: 0, positive unconditional: 536, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 519, Positive cache size: 469, Positive conditional cache size: 0, Positive unconditional cache size: 469, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 654.6ms, 87 PlacesBefore, 87 PlacesAfterwards, 125 TransitionsBefore, 125 TransitionsAfterwards, 1794 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1941 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 280, positive: 240, positive conditional: 0, positive unconditional: 240, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 280, positive: 235, positive conditional: 0, positive unconditional: 235, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 529, Positive cache size: 487, Positive conditional cache size: 0, Positive unconditional cache size: 487, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 744.1ms, 95 PlacesBefore, 95 PlacesAfterwards, 153 TransitionsBefore, 153 TransitionsAfterwards, 2052 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1905 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 182, positive: 147, positive conditional: 0, positive unconditional: 147, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 182, positive: 139, positive conditional: 0, positive unconditional: 139, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 536, Positive cache size: 495, Positive conditional cache size: 0, Positive unconditional cache size: 495, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 775.8ms, 106 PlacesBefore, 106 PlacesAfterwards, 181 TransitionsBefore, 181 TransitionsAfterwards, 2156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1535 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 253, positive: 229, positive conditional: 0, positive unconditional: 229, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 253, positive: 226, positive conditional: 0, positive unconditional: 226, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 537, Positive cache size: 498, Positive conditional cache size: 0, Positive unconditional cache size: 498, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6801.3ms, 131 PlacesBefore, 131 PlacesAfterwards, 285 TransitionsBefore, 285 TransitionsAfterwards, 3220 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 1322 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 679, positive: 671, positive conditional: 0, positive unconditional: 671, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 679, positive: 668, positive conditional: 0, positive unconditional: 668, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 557, Positive cache size: 522, Positive conditional cache size: 0, Positive unconditional cache size: 522, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4132.0ms, 159 PlacesBefore, 159 PlacesAfterwards, 347 TransitionsBefore, 347 TransitionsAfterwards, 3688 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 807 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 291, positive: 285, positive conditional: 0, positive unconditional: 285, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 291, positive: 283, positive conditional: 0, positive unconditional: 283, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 559, Positive cache size: 525, Positive conditional cache size: 0, Positive unconditional cache size: 525, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28269.1ms, 179 PlacesBefore, 179 PlacesAfterwards, 586 TransitionsBefore, 586 TransitionsAfterwards, 6014 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 16 TrivialYvCompositions, 9 ConcurrentYvCompositions, 0 ChoiceCompositions, 25 TotalNumberOfCompositions, 4916 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4124, positive: 4118, positive conditional: 0, positive unconditional: 4118, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4124, positive: 4113, positive conditional: 0, positive unconditional: 4113, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 571, Positive cache size: 537, Positive conditional cache size: 0, Positive unconditional cache size: 537, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22429.7ms, 187 PlacesBefore, 187 PlacesAfterwards, 592 TransitionsBefore, 592 TransitionsAfterwards, 5590 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 2351 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1619, positive: 1613, positive conditional: 0, positive unconditional: 1613, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1619, positive: 1611, positive conditional: 0, positive unconditional: 1611, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 573, Positive cache size: 539, Positive conditional cache size: 0, Positive unconditional cache size: 539, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 35918.9ms, 204 PlacesBefore, 204 PlacesAfterwards, 754 TransitionsBefore, 754 TransitionsAfterwards, 6188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 3626 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1916, positive: 1904, positive conditional: 0, positive unconditional: 1904, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1916, positive: 1896, positive conditional: 0, positive unconditional: 1896, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 650, Positive cache size: 618, Positive conditional cache size: 0, Positive unconditional cache size: 618, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31907.3ms, 211 PlacesBefore, 211 PlacesAfterwards, 755 TransitionsBefore, 755 TransitionsAfterwards, 5822 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 2807 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1964, positive: 1958, positive conditional: 0, positive unconditional: 1958, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1964, positive: 1955, positive conditional: 0, positive unconditional: 1955, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 657, Positive cache size: 626, Positive conditional cache size: 0, Positive unconditional cache size: 626, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 97286.4ms, 241 PlacesBefore, 241 PlacesAfterwards, 1005 TransitionsBefore, 1005 TransitionsAfterwards, 7064 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 14 TrivialYvCompositions, 9 ConcurrentYvCompositions, 0 ChoiceCompositions, 23 TotalNumberOfCompositions, 6037 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4987, positive: 4981, positive conditional: 0, positive unconditional: 4981, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4987, positive: 4972, positive conditional: 0, positive unconditional: 4972, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 679, Positive cache size: 652, Positive conditional cache size: 0, Positive unconditional cache size: 652, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 182175.3ms, 269 PlacesBefore, 269 PlacesAfterwards, 1282 TransitionsBefore, 1282 TransitionsAfterwards, 8610 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 4721 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3205, positive: 3197, positive conditional: 0, positive unconditional: 3197, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3205, positive: 3182, positive conditional: 0, positive unconditional: 3182, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 710, Positive cache size: 683, Positive conditional cache size: 0, Positive unconditional cache size: 683, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 82325.6ms, 286 PlacesBefore, 286 PlacesAfterwards, 1221 TransitionsBefore, 1221 TransitionsAfterwards, 7462 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1473 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 513, positive: 507, positive conditional: 0, positive unconditional: 507, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 513, positive: 503, positive conditional: 0, positive unconditional: 503, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 716, Positive cache size: 689, Positive conditional cache size: 0, Positive unconditional cache size: 689, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 79732.2ms, 297 PlacesBefore, 295 PlacesAfterwards, 1206 TransitionsBefore, 1206 TransitionsAfterwards, 7102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 2774 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1817, positive: 1811, positive conditional: 0, positive unconditional: 1811, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1817, positive: 1801, positive conditional: 0, positive unconditional: 1801, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 742, Positive cache size: 717, Positive conditional cache size: 0, Positive unconditional cache size: 717, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 90467.7ms, 308 PlacesBefore, 307 PlacesAfterwards, 1223 TransitionsBefore, 1222 TransitionsAfterwards, 7618 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 1899 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 829, positive: 819, positive conditional: 0, positive unconditional: 819, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 45, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 45, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 829, positive: 775, positive conditional: 0, positive unconditional: 775, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 45, unknown conditional: 0, unknown unconditional: 45] , Statistics on independence cache: Total cache size (in pairs): 734, Positive cache size: 711, Positive conditional cache size: 0, Positive unconditional cache size: 711, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 45404.4ms, 332 PlacesBefore, 331 PlacesAfterwards, 1192 TransitionsBefore, 1191 TransitionsAfterwards, 7780 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 396 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 396, positive: 396, positive conditional: 0, positive unconditional: 396, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 396, positive: 388, positive conditional: 0, positive unconditional: 388, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 685, Positive cache size: 665, Positive conditional cache size: 0, Positive unconditional cache size: 665, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 82). Cancelled while PetriNetLargeBlockEncoding was applying PetriNetLargeBlockEncoding to Petri net that has 357 places, 1349 transitions, 31041 flow,while LiptonReduction was applying LiptonReduction to Petri net that has 357 places, 1349 transitions, 31041 flow and 8334 co-enabled transitions pairs.,while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 22.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: TIMEOUT, OverallTime: 856931.6ms, OverallIterations: 21, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 107107.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 675.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 574 SDtfs, 1169 SDslu, 447 SDs, 0 SdLazy, 7160 SolverSat, 1351 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3504.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 273 GetRequests, 32 SyntacticMatches, 14 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 2534.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=31041occurred in iteration=21, InterpolantAutomatonStates: 235, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 22.0ms SsaConstructionTime, 167.9ms SatisfiabilityAnalysisTime, 1958.0ms InterpolantComputationTime, 741 NumberOfCodeBlocks, 741 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 720 ConstructedInterpolants, 0 QuantifiedInterpolants, 3958 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown