/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-6f4246e9f5583d222ebb38ff8175c901f3a528f0-6f4246e [2021-04-29 03:55:27,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-29 03:55:27,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-29 03:55:27,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-29 03:55:27,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-29 03:55:27,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-29 03:55:27,972 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-29 03:55:27,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-29 03:55:27,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-29 03:55:27,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-29 03:55:27,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-29 03:55:27,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-29 03:55:27,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-29 03:55:27,982 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-29 03:55:27,983 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-29 03:55:27,984 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-29 03:55:27,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-29 03:55:27,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-29 03:55:27,988 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-29 03:55:27,990 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-29 03:55:27,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-29 03:55:27,995 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-29 03:55:27,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-29 03:55:27,998 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-29 03:55:28,001 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-29 03:55:28,001 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-29 03:55:28,001 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-29 03:55:28,002 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-29 03:55:28,003 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-29 03:55:28,004 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-29 03:55:28,004 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-29 03:55:28,005 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-29 03:55:28,006 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-29 03:55:28,007 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-29 03:55:28,008 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-29 03:55:28,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-29 03:55:28,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-29 03:55:28,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-29 03:55:28,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-29 03:55:28,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-29 03:55:28,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-29 03:55:28,013 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-RepeatedSemanticLbeWithPredicates.epf [2021-04-29 03:55:28,042 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-29 03:55:28,042 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-29 03:55:28,044 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-04-29 03:55:28,044 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-04-29 03:55:28,044 INFO L138 SettingsManager]: * Use SBE=true [2021-04-29 03:55:28,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-29 03:55:28,045 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-29 03:55:28,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-29 03:55:28,046 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-29 03:55:28,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-29 03:55:28,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-29 03:55:28,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-29 03:55:28,047 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-29 03:55:28,047 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-29 03:55:28,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-29 03:55:28,048 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-29 03:55:28,048 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-29 03:55:28,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-29 03:55:28,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-29 03:55:28,049 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-29 03:55:28,049 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-29 03:55:28,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-29 03:55:28,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-29 03:55:28,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-04-29 03:55:28,050 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-04-29 03:55:28,050 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-04-29 03:55:28,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-04-29 03:55:28,051 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-04-29 03:55:28,051 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-04-29 03:55:28,052 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-04-29 03:55:28,052 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-04-29 03:55:28,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-29 03:55:28,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-29 03:55:28,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-29 03:55:28,473 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-04-29 03:55:28,474 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-04-29 03:55:28,476 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl [2021-04-29 03:55:28,477 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl' [2021-04-29 03:55:28,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-29 03:55:28,570 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-04-29 03:55:28,572 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-04-29 03:55:28,572 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-04-29 03:55:28,572 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-04-29 03:55:28,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 03:55:28" (1/1) ... [2021-04-29 03:55:28,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 03:55:28" (1/1) ... [2021-04-29 03:55:28,615 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-04-29 03:55:28,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-29 03:55:28,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-29 03:55:28,618 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-29 03:55:28,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 03:55:28" (1/1) ... [2021-04-29 03:55:28,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 03:55:28" (1/1) ... [2021-04-29 03:55:28,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 03:55:28" (1/1) ... [2021-04-29 03:55:28,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 03:55:28" (1/1) ... [2021-04-29 03:55:28,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 03:55:28" (1/1) ... [2021-04-29 03:55:28,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 03:55:28" (1/1) ... [2021-04-29 03:55:28,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 03:55:28" (1/1) ... [2021-04-29 03:55:28,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-29 03:55:28,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-29 03:55:28,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-29 03:55:28,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-29 03:55:28,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 03:55:28" (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-04-29 03:55:28,738 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process2 given in one single declaration [2021-04-29 03:55:28,739 INFO L130 BoogieDeclarations]: Found specification of procedure Process2 [2021-04-29 03:55:28,739 INFO L138 BoogieDeclarations]: Found implementation of procedure Process2 [2021-04-29 03:55:28,739 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process1 given in one single declaration [2021-04-29 03:55:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure Process1 [2021-04-29 03:55:28,740 INFO L138 BoogieDeclarations]: Found implementation of procedure Process1 [2021-04-29 03:55:28,740 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-04-29 03:55:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-29 03:55:28,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-29 03:55:28,741 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Clock given in one single declaration [2021-04-29 03:55:28,741 INFO L130 BoogieDeclarations]: Found specification of procedure Clock [2021-04-29 03:55:28,741 INFO L138 BoogieDeclarations]: Found implementation of procedure Clock [2021-04-29 03:55:28,744 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-04-29 03:55:28,977 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-29 03:55:28,977 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-04-29 03:55:28,979 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 03:55:28 BoogieIcfgContainer [2021-04-29 03:55:28,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-29 03:55:28,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-29 03:55:28,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-29 03:55:28,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-29 03:55:28,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 03:55:28" (1/2) ... [2021-04-29 03:55:28,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171f78f0 and model type FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 03:55:28, skipping insertion in model container [2021-04-29 03:55:28,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 03:55:28" (2/2) ... [2021-04-29 03:55:28,988 INFO L111 eAbstractionObserver]: Analyzing ICFG FischerWithBug.bpl [2021-04-29 03:55:28,995 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-04-29 03:55:29,000 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-04-29 03:55:29,001 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-04-29 03:55:29,034 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:29,034 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:29,036 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:29,036 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:29,036 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:29,037 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:29,037 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:29,038 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:29,040 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:29,040 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:29,041 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:29,042 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:29,042 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:29,042 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:29,043 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:29,043 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:29,051 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:29,054 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:29,056 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-04-29 03:55:29,084 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-04-29 03:55:29,115 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-29 03:55:29,115 INFO L377 AbstractCegarLoop]: Hoare is false [2021-04-29 03:55:29,115 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-29 03:55:29,115 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-29 03:55:29,116 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-29 03:55:29,116 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-29 03:55:29,116 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-29 03:55:29,116 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-29 03:55:29,131 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 46 transitions, 107 flow [2021-04-29 03:55:29,168 INFO L129 PetriNetUnfolder]: 5/43 cut-off events. [2021-04-29 03:55:29,169 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 03:55:29,175 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 43 events. 5/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 109 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2021-04-29 03:55:29,175 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 46 transitions, 107 flow [2021-04-29 03:55:29,183 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 43 transitions, 95 flow [2021-04-29 03:55:29,185 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 03:55:29,207 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 43 transitions, 95 flow [2021-04-29 03:55:29,218 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 43 transitions, 95 flow [2021-04-29 03:55:29,225 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 43 transitions, 95 flow [2021-04-29 03:55:29,263 INFO L129 PetriNetUnfolder]: 5/43 cut-off events. [2021-04-29 03:55:29,264 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 03:55:29,266 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 43 events. 5/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 110 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2021-04-29 03:55:29,269 INFO L146 LiptonReduction]: Number of co-enabled transitions 818 [2021-04-29 03:55:29,857 INFO L158 LiptonReduction]: Checked pairs total: 2126 [2021-04-29 03:55:29,858 INFO L160 LiptonReduction]: Total number of compositions: 13 [2021-04-29 03:55:29,861 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 678 [2021-04-29 03:55:29,874 INFO L129 PetriNetUnfolder]: 1/17 cut-off events. [2021-04-29 03:55:29,875 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 03:55:29,875 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 03:55:29,876 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-04-29 03:55:29,876 INFO L428 AbstractCegarLoop]: === Iteration 1 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-04-29 03:55:29,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 03:55:29,883 INFO L82 PathProgramCache]: Analyzing trace with hash 176978752, now seen corresponding path program 1 times [2021-04-29 03:55:29,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 03:55:29,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955637535] [2021-04-29 03:55:29,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 03:55:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 03:55:30,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:30,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 03:55:30,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 03:55:30,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955637535] [2021-04-29 03:55:30,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 03:55:30,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-29 03:55:30,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173983928] [2021-04-29 03:55:30,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 03:55:30,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 03:55:30,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 03:55:30,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 03:55:30,070 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 59 [2021-04-29 03:55:30,072 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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-04-29 03:55:30,073 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 03:55:30,073 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 59 [2021-04-29 03:55:30,074 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 03:55:30,142 INFO L129 PetriNetUnfolder]: 31/134 cut-off events. [2021-04-29 03:55:30,143 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 03:55:30,145 INFO L84 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 134 events. 31/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 532 event pairs, 4 based on Foata normal form. 41/137 useless extension candidates. Maximal degree in co-relation 177. Up to 33 conditions per place. [2021-04-29 03:55:30,147 INFO L132 encePairwiseOnDemand]: 41/59 looper letters, 8 selfloop transitions, 7 changer transitions 3/43 dead transitions. [2021-04-29 03:55:30,147 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 131 flow [2021-04-29 03:55:30,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 03:55:30,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 03:55:30,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2021-04-29 03:55:30,162 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8757062146892656 [2021-04-29 03:55:30,162 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 155 transitions. [2021-04-29 03:55:30,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 155 transitions. [2021-04-29 03:55:30,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 03:55:30,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 155 transitions. [2021-04-29 03:55:30,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-04-29 03:55:30,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 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-04-29 03:55:30,176 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 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-04-29 03:55:30,178 INFO L185 Difference]: Start difference. First operand has 48 places, 43 transitions, 95 flow. Second operand 3 states and 155 transitions. [2021-04-29 03:55:30,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 131 flow [2021-04-29 03:55:30,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 128 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-04-29 03:55:30,185 INFO L241 Difference]: Finished difference. Result has 43 places, 40 transitions, 130 flow [2021-04-29 03:55:30,187 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=43, PETRI_TRANSITIONS=40} [2021-04-29 03:55:30,188 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2021-04-29 03:55:30,188 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 03:55:30,188 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 40 transitions, 130 flow [2021-04-29 03:55:30,189 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 40 transitions, 130 flow [2021-04-29 03:55:30,190 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 40 transitions, 130 flow [2021-04-29 03:55:30,210 INFO L129 PetriNetUnfolder]: 32/132 cut-off events. [2021-04-29 03:55:30,210 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-04-29 03:55:30,212 INFO L84 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 132 events. 32/132 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 532 event pairs, 2 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 202. Up to 31 conditions per place. [2021-04-29 03:55:30,214 INFO L146 LiptonReduction]: Number of co-enabled transitions 528 [2021-04-29 03:55:30,224 INFO L158 LiptonReduction]: Checked pairs total: 396 [2021-04-29 03:55:30,224 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 03:55:30,224 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 36 [2021-04-29 03:55:30,226 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 40 transitions, 130 flow [2021-04-29 03:55:30,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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-04-29 03:55:30,227 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 03:55:30,227 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 03:55:30,227 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-29 03:55:30,228 INFO L428 AbstractCegarLoop]: === Iteration 2 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-04-29 03:55:30,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 03:55:30,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1381575724, now seen corresponding path program 1 times [2021-04-29 03:55:30,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 03:55:30,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252466610] [2021-04-29 03:55:30,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 03:55:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 03:55:30,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:30,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 03:55:30,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:30,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 03:55:30,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:30,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 03:55:30,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 03:55:30,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252466610] [2021-04-29 03:55:30,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 03:55:30,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 03:55:30,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274470456] [2021-04-29 03:55:30,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 03:55:30,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 03:55:30,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 03:55:30,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 03:55:30,260 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 59 [2021-04-29 03:55:30,260 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-04-29 03:55:30,260 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 03:55:30,260 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 59 [2021-04-29 03:55:30,260 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 03:55:30,379 INFO L129 PetriNetUnfolder]: 148/382 cut-off events. [2021-04-29 03:55:30,379 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-04-29 03:55:30,382 INFO L84 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 382 events. 148/382 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2016 event pairs, 22 based on Foata normal form. 7/290 useless extension candidates. Maximal degree in co-relation 779. Up to 191 conditions per place. [2021-04-29 03:55:30,388 INFO L132 encePairwiseOnDemand]: 47/59 looper letters, 18 selfloop transitions, 10 changer transitions 0/52 dead transitions. [2021-04-29 03:55:30,388 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 210 flow [2021-04-29 03:55:30,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 03:55:30,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 03:55:30,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2021-04-29 03:55:30,396 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7627118644067796 [2021-04-29 03:55:30,397 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 135 transitions. [2021-04-29 03:55:30,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 135 transitions. [2021-04-29 03:55:30,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 03:55:30,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 135 transitions. [2021-04-29 03:55:30,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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-04-29 03:55:30,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 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-04-29 03:55:30,405 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 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-04-29 03:55:30,405 INFO L185 Difference]: Start difference. First operand has 40 places, 40 transitions, 130 flow. Second operand 3 states and 135 transitions. [2021-04-29 03:55:30,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 210 flow [2021-04-29 03:55:30,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 52 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-29 03:55:30,415 INFO L241 Difference]: Finished difference. Result has 42 places, 48 transitions, 192 flow [2021-04-29 03:55:30,415 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=42, PETRI_TRANSITIONS=48} [2021-04-29 03:55:30,417 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -6 predicate places. [2021-04-29 03:55:30,417 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 03:55:30,418 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 48 transitions, 192 flow [2021-04-29 03:55:30,418 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 48 transitions, 192 flow [2021-04-29 03:55:30,419 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 48 transitions, 192 flow [2021-04-29 03:55:30,452 INFO L129 PetriNetUnfolder]: 96/299 cut-off events. [2021-04-29 03:55:30,452 INFO L130 PetriNetUnfolder]: For 23/25 co-relation queries the response was YES. [2021-04-29 03:55:30,454 INFO L84 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 299 events. 96/299 cut-off events. For 23/25 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1681 event pairs, 10 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 581. Up to 114 conditions per place. [2021-04-29 03:55:30,461 INFO L146 LiptonReduction]: Number of co-enabled transitions 570 [2021-04-29 03:55:30,489 INFO L158 LiptonReduction]: Checked pairs total: 208 [2021-04-29 03:55:30,489 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 03:55:30,490 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 73 [2021-04-29 03:55:30,492 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 48 transitions, 192 flow [2021-04-29 03:55:30,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-04-29 03:55:30,492 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 03:55:30,492 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 03:55:30,492 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-29 03:55:30,493 INFO L428 AbstractCegarLoop]: === Iteration 3 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-04-29 03:55:30,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 03:55:30,493 INFO L82 PathProgramCache]: Analyzing trace with hash -770400184, now seen corresponding path program 2 times [2021-04-29 03:55:30,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 03:55:30,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435472996] [2021-04-29 03:55:30,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 03:55:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 03:55:30,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:30,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 03:55:30,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:30,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 03:55:30,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:30,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 03:55:30,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 03:55:30,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435472996] [2021-04-29 03:55:30,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 03:55:30,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 03:55:30,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286637882] [2021-04-29 03:55:30,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 03:55:30,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 03:55:30,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 03:55:30,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 03:55:30,518 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 59 [2021-04-29 03:55:30,518 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 48 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-04-29 03:55:30,518 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 03:55:30,518 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 59 [2021-04-29 03:55:30,519 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 03:55:30,597 INFO L129 PetriNetUnfolder]: 133/374 cut-off events. [2021-04-29 03:55:30,597 INFO L130 PetriNetUnfolder]: For 116/143 co-relation queries the response was YES. [2021-04-29 03:55:30,600 INFO L84 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 374 events. 133/374 cut-off events. For 116/143 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1909 event pairs, 32 based on Foata normal form. 15/309 useless extension candidates. Maximal degree in co-relation 906. Up to 187 conditions per place. [2021-04-29 03:55:30,603 INFO L132 encePairwiseOnDemand]: 49/59 looper letters, 18 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2021-04-29 03:55:30,603 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 240 flow [2021-04-29 03:55:30,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 03:55:30,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 03:55:30,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2021-04-29 03:55:30,605 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7344632768361582 [2021-04-29 03:55:30,605 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 130 transitions. [2021-04-29 03:55:30,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 130 transitions. [2021-04-29 03:55:30,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 03:55:30,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 130 transitions. [2021-04-29 03:55:30,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-04-29 03:55:30,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 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-04-29 03:55:30,608 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 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-04-29 03:55:30,608 INFO L185 Difference]: Start difference. First operand has 42 places, 48 transitions, 192 flow. Second operand 3 states and 130 transitions. [2021-04-29 03:55:30,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 240 flow [2021-04-29 03:55:30,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-29 03:55:30,612 INFO L241 Difference]: Finished difference. Result has 43 places, 47 transitions, 193 flow [2021-04-29 03:55:30,613 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=43, PETRI_TRANSITIONS=47} [2021-04-29 03:55:30,613 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2021-04-29 03:55:30,613 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 03:55:30,613 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 47 transitions, 193 flow [2021-04-29 03:55:30,614 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 47 transitions, 193 flow [2021-04-29 03:55:30,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 47 transitions, 193 flow [2021-04-29 03:55:30,642 INFO L129 PetriNetUnfolder]: 85/285 cut-off events. [2021-04-29 03:55:30,642 INFO L130 PetriNetUnfolder]: For 36/38 co-relation queries the response was YES. [2021-04-29 03:55:30,644 INFO L84 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 285 events. 85/285 cut-off events. For 36/38 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1443 event pairs, 6 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 569. Up to 102 conditions per place. [2021-04-29 03:55:30,648 INFO L146 LiptonReduction]: Number of co-enabled transitions 536 [2021-04-29 03:55:30,671 INFO L158 LiptonReduction]: Checked pairs total: 182 [2021-04-29 03:55:30,671 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 03:55:30,671 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 58 [2021-04-29 03:55:30,673 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 47 transitions, 193 flow [2021-04-29 03:55:30,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-04-29 03:55:30,674 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 03:55:30,674 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 03:55:30,674 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-29 03:55:30,675 INFO L428 AbstractCegarLoop]: === Iteration 4 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-04-29 03:55:30,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 03:55:30,675 INFO L82 PathProgramCache]: Analyzing trace with hash 974274502, now seen corresponding path program 1 times [2021-04-29 03:55:30,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 03:55:30,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149896146] [2021-04-29 03:55:30,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 03:55:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 03:55:30,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:30,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 03:55:30,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:30,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 03:55:30,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:30,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 03:55:30,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 03:55:30,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149896146] [2021-04-29 03:55:30,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 03:55:30,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 03:55:30,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758111760] [2021-04-29 03:55:30,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 03:55:30,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 03:55:30,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 03:55:30,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 03:55:30,706 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 59 [2021-04-29 03:55:30,707 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 47 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-04-29 03:55:30,707 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 03:55:30,707 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 59 [2021-04-29 03:55:30,707 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 03:55:30,793 INFO L129 PetriNetUnfolder]: 147/423 cut-off events. [2021-04-29 03:55:30,793 INFO L130 PetriNetUnfolder]: For 152/176 co-relation queries the response was YES. [2021-04-29 03:55:30,796 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 423 events. 147/423 cut-off events. For 152/176 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2224 event pairs, 24 based on Foata normal form. 4/340 useless extension candidates. Maximal degree in co-relation 1063. Up to 142 conditions per place. [2021-04-29 03:55:30,799 INFO L132 encePairwiseOnDemand]: 49/59 looper letters, 20 selfloop transitions, 12 changer transitions 0/56 dead transitions. [2021-04-29 03:55:30,799 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 291 flow [2021-04-29 03:55:30,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 03:55:30,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 03:55:30,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2021-04-29 03:55:30,801 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.751412429378531 [2021-04-29 03:55:30,801 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 133 transitions. [2021-04-29 03:55:30,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 133 transitions. [2021-04-29 03:55:30,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 03:55:30,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 133 transitions. [2021-04-29 03:55:30,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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-04-29 03:55:30,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 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-04-29 03:55:30,804 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 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-04-29 03:55:30,804 INFO L185 Difference]: Start difference. First operand has 43 places, 47 transitions, 193 flow. Second operand 3 states and 133 transitions. [2021-04-29 03:55:30,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 291 flow [2021-04-29 03:55:30,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 56 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-04-29 03:55:30,808 INFO L241 Difference]: Finished difference. Result has 46 places, 52 transitions, 270 flow [2021-04-29 03:55:30,809 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=46, PETRI_TRANSITIONS=52} [2021-04-29 03:55:30,809 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2021-04-29 03:55:30,809 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 03:55:30,809 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 52 transitions, 270 flow [2021-04-29 03:55:30,810 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 52 transitions, 270 flow [2021-04-29 03:55:30,810 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 52 transitions, 270 flow [2021-04-29 03:55:30,838 INFO L129 PetriNetUnfolder]: 91/321 cut-off events. [2021-04-29 03:55:30,839 INFO L130 PetriNetUnfolder]: For 210/221 co-relation queries the response was YES. [2021-04-29 03:55:30,840 INFO L84 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 321 events. 91/321 cut-off events. For 210/221 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1706 event pairs, 6 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 821. Up to 108 conditions per place. [2021-04-29 03:55:30,844 INFO L146 LiptonReduction]: Number of co-enabled transitions 584 [2021-04-29 03:55:30,862 INFO L158 LiptonReduction]: Checked pairs total: 211 [2021-04-29 03:55:30,862 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 03:55:30,862 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 53 [2021-04-29 03:55:30,864 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 52 transitions, 270 flow [2021-04-29 03:55:30,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-04-29 03:55:30,864 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 03:55:30,864 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 03:55:30,865 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-29 03:55:30,865 INFO L428 AbstractCegarLoop]: === Iteration 5 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-04-29 03:55:30,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 03:55:30,865 INFO L82 PathProgramCache]: Analyzing trace with hash -313375872, now seen corresponding path program 2 times [2021-04-29 03:55:30,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 03:55:30,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120710702] [2021-04-29 03:55:30,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 03:55:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 03:55:30,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:30,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 03:55:30,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:30,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 03:55:30,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:30,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 03:55:30,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 03:55:30,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120710702] [2021-04-29 03:55:30,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 03:55:30,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 03:55:30,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449585133] [2021-04-29 03:55:30,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 03:55:30,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 03:55:30,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 03:55:30,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 03:55:30,893 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 59 [2021-04-29 03:55:30,893 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 52 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-04-29 03:55:30,893 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 03:55:30,893 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 59 [2021-04-29 03:55:30,893 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 03:55:30,996 INFO L129 PetriNetUnfolder]: 131/401 cut-off events. [2021-04-29 03:55:30,997 INFO L130 PetriNetUnfolder]: For 459/491 co-relation queries the response was YES. [2021-04-29 03:55:31,000 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1205 conditions, 401 events. 131/401 cut-off events. For 459/491 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1986 event pairs, 24 based on Foata normal form. 19/329 useless extension candidates. Maximal degree in co-relation 1193. Up to 128 conditions per place. [2021-04-29 03:55:31,003 INFO L132 encePairwiseOnDemand]: 49/59 looper letters, 20 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2021-04-29 03:55:31,003 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 54 transitions, 322 flow [2021-04-29 03:55:31,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 03:55:31,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 03:55:31,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2021-04-29 03:55:31,004 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7627118644067796 [2021-04-29 03:55:31,004 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 135 transitions. [2021-04-29 03:55:31,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 135 transitions. [2021-04-29 03:55:31,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 03:55:31,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 135 transitions. [2021-04-29 03:55:31,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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-04-29 03:55:31,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 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-04-29 03:55:31,008 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 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-04-29 03:55:31,008 INFO L185 Difference]: Start difference. First operand has 46 places, 52 transitions, 270 flow. Second operand 3 states and 135 transitions. [2021-04-29 03:55:31,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 54 transitions, 322 flow [2021-04-29 03:55:31,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 302 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-29 03:55:31,014 INFO L241 Difference]: Finished difference. Result has 46 places, 50 transitions, 254 flow [2021-04-29 03:55:31,015 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=46, PETRI_TRANSITIONS=50} [2021-04-29 03:55:31,015 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2021-04-29 03:55:31,015 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 03:55:31,015 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 50 transitions, 254 flow [2021-04-29 03:55:31,016 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 50 transitions, 254 flow [2021-04-29 03:55:31,016 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 50 transitions, 254 flow [2021-04-29 03:55:31,056 INFO L129 PetriNetUnfolder]: 80/310 cut-off events. [2021-04-29 03:55:31,056 INFO L130 PetriNetUnfolder]: For 200/213 co-relation queries the response was YES. [2021-04-29 03:55:31,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 310 events. 80/310 cut-off events. For 200/213 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1542 event pairs, 6 based on Foata normal form. 1/257 useless extension candidates. Maximal degree in co-relation 777. Up to 97 conditions per place. [2021-04-29 03:55:31,062 INFO L146 LiptonReduction]: Number of co-enabled transitions 554 [2021-04-29 03:55:31,087 INFO L158 LiptonReduction]: Checked pairs total: 185 [2021-04-29 03:55:31,088 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 03:55:31,088 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 73 [2021-04-29 03:55:31,094 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 50 transitions, 254 flow [2021-04-29 03:55:31,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-04-29 03:55:31,095 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 03:55:31,095 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 03:55:31,095 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-29 03:55:31,095 INFO L428 AbstractCegarLoop]: === Iteration 6 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-04-29 03:55:31,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 03:55:31,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1596025141, now seen corresponding path program 1 times [2021-04-29 03:55:31,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 03:55:31,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756129465] [2021-04-29 03:55:31,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 03:55:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 03:55:31,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:31,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 03:55:31,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:31,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-04-29 03:55:31,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:31,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 03:55:31,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 03:55:31,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756129465] [2021-04-29 03:55:31,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 03:55:31,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 03:55:31,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639422164] [2021-04-29 03:55:31,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-29 03:55:31,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 03:55:31,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-29 03:55:31,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-29 03:55:31,154 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 59 [2021-04-29 03:55:31,155 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 50 transitions, 254 flow. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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-04-29 03:55:31,155 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 03:55:31,155 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 59 [2021-04-29 03:55:31,155 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 03:55:31,256 INFO L129 PetriNetUnfolder]: 251/564 cut-off events. [2021-04-29 03:55:31,257 INFO L130 PetriNetUnfolder]: For 380/396 co-relation queries the response was YES. [2021-04-29 03:55:31,260 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1470 conditions, 564 events. 251/564 cut-off events. For 380/396 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2495 event pairs, 36 based on Foata normal form. 31/576 useless extension candidates. Maximal degree in co-relation 1457. Up to 288 conditions per place. [2021-04-29 03:55:31,264 INFO L132 encePairwiseOnDemand]: 54/59 looper letters, 19 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2021-04-29 03:55:31,264 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 57 transitions, 328 flow [2021-04-29 03:55:31,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-29 03:55:31,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-04-29 03:55:31,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2021-04-29 03:55:31,266 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.597457627118644 [2021-04-29 03:55:31,266 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 141 transitions. [2021-04-29 03:55:31,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 141 transitions. [2021-04-29 03:55:31,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 03:55:31,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 141 transitions. [2021-04-29 03:55:31,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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-04-29 03:55:31,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 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-04-29 03:55:31,269 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 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-04-29 03:55:31,269 INFO L185 Difference]: Start difference. First operand has 46 places, 50 transitions, 254 flow. Second operand 4 states and 141 transitions. [2021-04-29 03:55:31,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 57 transitions, 328 flow [2021-04-29 03:55:31,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 57 transitions, 317 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-04-29 03:55:31,274 INFO L241 Difference]: Finished difference. Result has 49 places, 51 transitions, 260 flow [2021-04-29 03:55:31,275 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=260, PETRI_PLACES=49, PETRI_TRANSITIONS=51} [2021-04-29 03:55:31,275 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2021-04-29 03:55:31,275 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 03:55:31,275 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 51 transitions, 260 flow [2021-04-29 03:55:31,276 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 51 transitions, 260 flow [2021-04-29 03:55:31,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 51 transitions, 260 flow [2021-04-29 03:55:31,316 INFO L129 PetriNetUnfolder]: 106/345 cut-off events. [2021-04-29 03:55:31,316 INFO L130 PetriNetUnfolder]: For 138/150 co-relation queries the response was YES. [2021-04-29 03:55:31,319 INFO L84 FinitePrefix]: Finished finitePrefix Result has 861 conditions, 345 events. 106/345 cut-off events. For 138/150 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1595 event pairs, 6 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 848. Up to 97 conditions per place. [2021-04-29 03:55:31,324 INFO L146 LiptonReduction]: Number of co-enabled transitions 584 [2021-04-29 03:55:31,377 INFO L158 LiptonReduction]: Checked pairs total: 133 [2021-04-29 03:55:31,377 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 03:55:31,378 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 103 [2021-04-29 03:55:31,379 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 51 transitions, 260 flow [2021-04-29 03:55:31,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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-04-29 03:55:31,380 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 03:55:31,380 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 03:55:31,380 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-29 03:55:31,380 INFO L428 AbstractCegarLoop]: === Iteration 7 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-04-29 03:55:31,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 03:55:31,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1149688330, now seen corresponding path program 1 times [2021-04-29 03:55:31,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 03:55:31,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541115322] [2021-04-29 03:55:31,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 03:55:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 03:55:31,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:31,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 03:55:31,411 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:31,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-04-29 03:55:31,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:31,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 03:55:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 03:55:31,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541115322] [2021-04-29 03:55:31,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 03:55:31,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 03:55:31,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692662409] [2021-04-29 03:55:31,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-29 03:55:31,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 03:55:31,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-29 03:55:31,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-29 03:55:31,419 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 59 [2021-04-29 03:55:31,420 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 260 flow. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-04-29 03:55:31,420 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 03:55:31,420 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 59 [2021-04-29 03:55:31,420 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 03:55:31,542 INFO L129 PetriNetUnfolder]: 264/606 cut-off events. [2021-04-29 03:55:31,542 INFO L130 PetriNetUnfolder]: For 456/472 co-relation queries the response was YES. [2021-04-29 03:55:31,545 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1754 conditions, 606 events. 264/606 cut-off events. For 456/472 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2670 event pairs, 39 based on Foata normal form. 34/621 useless extension candidates. Maximal degree in co-relation 1739. Up to 321 conditions per place. [2021-04-29 03:55:31,550 INFO L132 encePairwiseOnDemand]: 54/59 looper letters, 16 selfloop transitions, 3 changer transitions 5/59 dead transitions. [2021-04-29 03:55:31,550 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 349 flow [2021-04-29 03:55:31,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-29 03:55:31,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-04-29 03:55:31,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2021-04-29 03:55:31,552 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.597457627118644 [2021-04-29 03:55:31,552 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 141 transitions. [2021-04-29 03:55:31,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 141 transitions. [2021-04-29 03:55:31,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 03:55:31,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 141 transitions. [2021-04-29 03:55:31,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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-04-29 03:55:31,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 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-04-29 03:55:31,555 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 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-04-29 03:55:31,555 INFO L185 Difference]: Start difference. First operand has 49 places, 51 transitions, 260 flow. Second operand 4 states and 141 transitions. [2021-04-29 03:55:31,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 349 flow [2021-04-29 03:55:31,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 59 transitions, 339 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-04-29 03:55:31,560 INFO L241 Difference]: Finished difference. Result has 51 places, 52 transitions, 274 flow [2021-04-29 03:55:31,560 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=274, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2021-04-29 03:55:31,561 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2021-04-29 03:55:31,561 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 03:55:31,561 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 52 transitions, 274 flow [2021-04-29 03:55:31,561 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 52 transitions, 274 flow [2021-04-29 03:55:31,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 52 transitions, 274 flow [2021-04-29 03:55:31,620 INFO L129 PetriNetUnfolder]: 156/440 cut-off events. [2021-04-29 03:55:31,621 INFO L130 PetriNetUnfolder]: For 222/234 co-relation queries the response was YES. [2021-04-29 03:55:31,624 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1180 conditions, 440 events. 156/440 cut-off events. For 222/234 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2084 event pairs, 14 based on Foata normal form. 0/373 useless extension candidates. Maximal degree in co-relation 1166. Up to 121 conditions per place. [2021-04-29 03:55:31,631 INFO L146 LiptonReduction]: Number of co-enabled transitions 600 [2021-04-29 03:55:31,655 INFO L158 LiptonReduction]: Checked pairs total: 78 [2021-04-29 03:55:31,655 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 03:55:31,656 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 95 [2021-04-29 03:55:31,657 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 274 flow [2021-04-29 03:55:31,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-04-29 03:55:31,658 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 03:55:31,658 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 03:55:31,658 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-04-29 03:55:31,658 INFO L428 AbstractCegarLoop]: === Iteration 8 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-04-29 03:55:31,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 03:55:31,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1597515181, now seen corresponding path program 2 times [2021-04-29 03:55:31,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 03:55:31,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652199396] [2021-04-29 03:55:31,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 03:55:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-29 03:55:31,670 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-29 03:55:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-29 03:55:31,678 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-29 03:55:31,698 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-29 03:55:31,698 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-04-29 03:55:31,699 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-04-29 03:55:31,724 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 03:55:31 BasicIcfg [2021-04-29 03:55:31,724 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-29 03:55:31,725 INFO L168 Benchmark]: Toolchain (without parser) took 3208.11 ms. Allocated memory was 310.4 MB in the beginning and 373.3 MB in the end (delta: 62.9 MB). Free memory was 279.1 MB in the beginning and 141.8 MB in the end (delta: 137.2 MB). Peak memory consumption was 200.1 MB. Max. memory is 16.0 GB. [2021-04-29 03:55:31,726 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.66 ms. Allocated memory is still 310.4 MB. Free memory was 280.3 MB in the beginning and 280.1 MB in the end (delta: 153.8 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-04-29 03:55:31,727 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.71 ms. Allocated memory is still 310.4 MB. Free memory was 293.4 MB in the beginning and 292.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-29 03:55:31,727 INFO L168 Benchmark]: Boogie Preprocessor took 20.00 ms. Allocated memory is still 310.4 MB. Free memory was 291.9 MB in the beginning and 290.9 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-04-29 03:55:31,728 INFO L168 Benchmark]: RCFGBuilder took 341.24 ms. Allocated memory is still 310.4 MB. Free memory was 290.9 MB in the beginning and 284.9 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.0 GB. [2021-04-29 03:55:31,728 INFO L168 Benchmark]: TraceAbstraction took 2742.81 ms. Allocated memory was 310.4 MB in the beginning and 373.3 MB in the end (delta: 62.9 MB). Free memory was 284.2 MB in the beginning and 141.8 MB in the end (delta: 142.4 MB). Peak memory consumption was 205.8 MB. Max. memory is 16.0 GB. [2021-04-29 03:55:31,731 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.66 ms. Allocated memory is still 310.4 MB. Free memory was 280.3 MB in the beginning and 280.1 MB in the end (delta: 153.8 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 44.71 ms. Allocated memory is still 310.4 MB. Free memory was 293.4 MB in the beginning and 292.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 20.00 ms. Allocated memory is still 310.4 MB. Free memory was 291.9 MB in the beginning and 290.9 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 341.24 ms. Allocated memory is still 310.4 MB. Free memory was 290.9 MB in the beginning and 284.9 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 2742.81 ms. Allocated memory was 310.4 MB in the beginning and 373.3 MB in the end (delta: 62.9 MB). Free memory was 284.2 MB in the beginning and 141.8 MB in the end (delta: 142.4 MB). Peak memory consumption was 205.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 640.3ms, 48 PlacesBefore, 48 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 818 CoEnabledTransitionPairs, 3 FixpointIterations, 4 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 2126 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 960, positive: 866, positive conditional: 866, positive unconditional: 0, negative: 94, negative conditional: 94, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 455, positive: 421, positive conditional: 0, positive unconditional: 421, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 455, positive: 421, positive conditional: 0, positive unconditional: 421, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 455, positive: 400, positive conditional: 0, positive unconditional: 400, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 55, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 232, positive: 76, positive conditional: 0, positive unconditional: 76, negative: 156, negative conditional: 0, negative unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 960, positive: 445, positive conditional: 445, positive unconditional: 0, negative: 60, negative conditional: 60, negative unconditional: 0, unknown: 455, unknown conditional: 455, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 455, Positive cache size: 421, Positive conditional cache size: 421, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.9ms, 43 PlacesBefore, 40 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 528 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 396 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 154, positive: 130, positive conditional: 130, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, positive: 33, positive conditional: 1, positive unconditional: 32, 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: 33, positive: 33, positive conditional: 1, positive unconditional: 32, 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: 33, positive: 33, positive conditional: 0, positive unconditional: 33, 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: 154, positive: 97, positive conditional: 97, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 33, unknown conditional: 33, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 488, Positive cache size: 454, Positive conditional cache size: 454, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 71.1ms, 42 PlacesBefore, 42 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 570 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 208 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 89, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 21, positive conditional: 3, positive unconditional: 18, 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: 21, positive: 21, positive conditional: 3, positive unconditional: 18, 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: 21, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 1, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, positive: 19, positive conditional: 6, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 89, positive: 57, positive conditional: 57, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 21, unknown conditional: 21, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 509, Positive cache size: 475, Positive conditional cache size: 475, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 57.6ms, 43 PlacesBefore, 43 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 536 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 182 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 89, positive: 79, positive conditional: 79, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 5, positive unconditional: 6, 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: 11, positive: 11, positive conditional: 5, positive unconditional: 6, 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: 11, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 1, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, positive: 11, positive conditional: 5, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 89, positive: 68, positive conditional: 68, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 520, Positive cache size: 486, Positive conditional cache size: 486, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 52.5ms, 46 PlacesBefore, 46 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 584 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 211 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 101, positive: 90, positive conditional: 90, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, positive: 19, positive conditional: 4, 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: 19, positive: 19, positive conditional: 4, 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: 19, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ 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] ], Cache Queries: [ total: 101, positive: 71, positive conditional: 71, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 539, Positive cache size: 505, Positive conditional cache size: 505, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 72.1ms, 46 PlacesBefore, 46 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 554 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 185 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 89, positive: 79, positive conditional: 79, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 3, 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: 6, positive: 6, positive conditional: 3, 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: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 89, positive: 73, positive conditional: 73, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 545, Positive cache size: 511, Positive conditional cache size: 511, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 101.8ms, 49 PlacesBefore, 49 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 584 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 133 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 60, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 11, positive conditional: 10, positive unconditional: 1, negative: 4, negative conditional: 3, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 11, positive conditional: 10, positive unconditional: 1, negative: 4, negative conditional: 3, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 4, negative conditional: 3, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 22, negative conditional: 18, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, positive: 42, positive conditional: 42, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 560, Positive cache size: 522, Positive conditional cache size: 522, Positive unconditional cache size: 0, Negative cache size: 38, Negative conditional cache size: 38, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 94.1ms, 51 PlacesBefore, 51 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 600 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 78 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 2, negative unconditional: 0, 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: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, positive: 19, positive conditional: 19, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 563, Positive cache size: 523, Positive conditional cache size: 523, Positive unconditional cache size: 0, Negative cache size: 40, Negative conditional cache size: 40, Negative unconditional cache size: 0 - CounterExampleResult [Line: 87]: assertion can be violated assertion can be violated We found a FailurePath: [L28] 0 critical := 0; [L29] 0 clk := 0; [L30] 0 assume wait >= 1; [L33] 0 assume wait >= delay; VAL [clk=0, critical=0, delay=1, wait=1] [L34] FORK 0 fork 0 Clock(); VAL [clk=0, critical=0, delay=1, wait=1] [L35] FORK 0 fork 1 Process1(); VAL [clk=0, critical=0, delay=1, wait=1] [L57] COND TRUE 2 lock != 1 [L58] 2 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L36] FORK 0 fork 2 Process2(); VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 [L79] 3 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L60] 2 lock := 1; [L61] 2 assume clk <= deadline; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; [L64] 2 assume lock == 1; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=1, critical=1, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L81] 3 lock := 2; [L82] 3 assume clk <= deadline; VAL [clk=1, critical=1, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=1, critical=1, deadline=2, deadline=1, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=2, critical=1, deadline=2, deadline=1, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; [L85] 3 assume lock == 2; VAL [clk=2, critical=1, deadline=2, deadline=1, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=2, critical=1, deadline=2, deadline=1, delay=1, lock=2, wait=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 42 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 2591.0ms, OverallIterations: 8, TraceHistogramMax: 2, EmptinessCheckTime: 0.0ms, AutomataDifference: 873.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 753.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 104 SDtfs, 42 SDslu, 0 SDs, 0 SdLazy, 114 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 149.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=274occurred in iteration=7, InterpolantAutomatonStates: 23, 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: 13.7ms SsaConstructionTime, 82.0ms SatisfiabilityAnalysisTime, 158.4ms InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 proved your program to be incorrect! Received shutdown request...