/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 13:22:30,174 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 13:22:30,177 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 13:22:30,213 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 13:22:30,213 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 13:22:30,216 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 13:22:30,218 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 13:22:30,224 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 13:22:30,226 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 13:22:30,230 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 13:22:30,231 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 13:22:30,232 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 13:22:30,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 13:22:30,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 13:22:30,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 13:22:30,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 13:22:30,238 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 13:22:30,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 13:22:30,241 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 13:22:30,249 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 13:22:30,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 13:22:30,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 13:22:30,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 13:22:30,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 13:22:30,259 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 13:22:30,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 13:22:30,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 13:22:30,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 13:22:30,262 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 13:22:30,263 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 13:22:30,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 13:22:30,264 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 13:22:30,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 13:22:30,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 13:22:30,267 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 13:22:30,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 13:22:30,267 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 13:22:30,267 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 13:22:30,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 13:22:30,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 13:22:30,269 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 13:22:30,273 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 13:22:30,302 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 13:22:30,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 13:22:30,306 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 13:22:30,306 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 13:22:30,306 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 13:22:30,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 13:22:30,306 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 13:22:30,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 13:22:30,307 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 13:22:30,307 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 13:22:30,308 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 13:22:30,308 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 13:22:30,308 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 13:22:30,308 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 13:22:30,308 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 13:22:30,309 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 13:22:30,309 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 13:22:30,309 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 13:22:30,309 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 13:22:30,309 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 13:22:30,310 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 13:22:30,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 13:22:30,310 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 13:22:30,310 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 13:22:30,310 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 13:22:30,310 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 13:22:30,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 13:22:30,311 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 13:22:30,311 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 13:22:30,311 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 13:22:30,311 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 13:22:30,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 13:22:30,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 13:22:30,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 13:22:30,647 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-03-26 13:22:30,650 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-03-26 13:22:30,651 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-03-26 13:22:30,651 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl' [2021-03-26 13:22:30,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 13:22:30,681 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-03-26 13:22:30,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 13:22:30,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 13:22:30,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 13:22:30,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 01:22:30" (1/1) ... [2021-03-26 13:22:30,698 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 01:22:30" (1/1) ... [2021-03-26 13:22:30,704 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 13:22:30,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 13:22:30,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 13:22:30,705 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 13:22:30,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 01:22:30" (1/1) ... [2021-03-26 13:22:30,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 01:22:30" (1/1) ... [2021-03-26 13:22:30,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 01:22:30" (1/1) ... [2021-03-26 13:22:30,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 01:22:30" (1/1) ... [2021-03-26 13:22:30,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 01:22:30" (1/1) ... [2021-03-26 13:22:30,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 01:22:30" (1/1) ... [2021-03-26 13:22:30,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 01:22:30" (1/1) ... [2021-03-26 13:22:30,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 13:22:30,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 13:22:30,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 13:22:30,723 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 13:22:30,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 01:22:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 13:22:30,779 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process2 given in one single declaration [2021-03-26 13:22:30,780 INFO L130 BoogieDeclarations]: Found specification of procedure Process2 [2021-03-26 13:22:30,781 INFO L138 BoogieDeclarations]: Found implementation of procedure Process2 [2021-03-26 13:22:30,781 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process1 given in one single declaration [2021-03-26 13:22:30,781 INFO L130 BoogieDeclarations]: Found specification of procedure Process1 [2021-03-26 13:22:30,781 INFO L138 BoogieDeclarations]: Found implementation of procedure Process1 [2021-03-26 13:22:30,781 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-03-26 13:22:30,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 13:22:30,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 13:22:30,782 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Clock given in one single declaration [2021-03-26 13:22:30,782 INFO L130 BoogieDeclarations]: Found specification of procedure Clock [2021-03-26 13:22:30,782 INFO L138 BoogieDeclarations]: Found implementation of procedure Clock [2021-03-26 13:22:30,783 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 13:22:30,980 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 13:22:30,980 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-03-26 13:22:30,982 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 01:22:30 BoogieIcfgContainer [2021-03-26 13:22:30,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 13:22:30,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 13:22:30,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 13:22:30,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 13:22:30,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 01:22:30" (1/2) ... [2021-03-26 13:22:30,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5904d1ea and model type FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 01:22:30, skipping insertion in model container [2021-03-26 13:22:30,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 01:22:30" (2/2) ... [2021-03-26 13:22:30,987 INFO L111 eAbstractionObserver]: Analyzing ICFG FischerWithBug.bpl [2021-03-26 13:22:31,004 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 13:22:31,007 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 13:22:31,008 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 13:22:31,052 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 13:22:31,052 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 13:22:31,053 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 13:22:31,053 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 13:22:31,054 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 13:22:31,054 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 13:22:31,054 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 13:22:31,054 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 13:22:31,055 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 13:22:31,055 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 13:22:31,056 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 13:22:31,056 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 13:22:31,056 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 13:22:31,057 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 13:22:31,057 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 13:22:31,057 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 13:22:31,081 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 13:22:31,082 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 13:22:31,083 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 13:22:31,113 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 13:22:31,144 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 13:22:31,144 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 13:22:31,144 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 13:22:31,144 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 13:22:31,145 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 13:22:31,145 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 13:22:31,145 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 13:22:31,145 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 13:22:31,154 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 46 transitions, 107 flow [2021-03-26 13:22:31,199 INFO L129 PetriNetUnfolder]: 5/43 cut-off events. [2021-03-26 13:22:31,199 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 13:22:31,203 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-03-26 13:22:31,203 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 46 transitions, 107 flow [2021-03-26 13:22:31,209 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 43 transitions, 95 flow [2021-03-26 13:22:31,210 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 13:22:31,225 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 43 transitions, 95 flow [2021-03-26 13:22:31,229 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 43 transitions, 95 flow [2021-03-26 13:22:31,231 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 43 transitions, 95 flow [2021-03-26 13:22:31,250 INFO L129 PetriNetUnfolder]: 5/43 cut-off events. [2021-03-26 13:22:31,251 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 13:22:31,251 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-03-26 13:22:31,254 INFO L142 LiptonReduction]: Number of co-enabled transitions 818 [2021-03-26 13:22:31,675 INFO L154 LiptonReduction]: Checked pairs total: 1106 [2021-03-26 13:22:31,675 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 13:22:31,681 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 472 [2021-03-26 13:22:31,699 INFO L129 PetriNetUnfolder]: 1/11 cut-off events. [2021-03-26 13:22:31,699 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 13:22:31,699 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 13:22:31,700 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-03-26 13:22:31,700 INFO L428 AbstractCegarLoop]: === Iteration 1 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-26 13:22:31,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 13:22:31,706 INFO L82 PathProgramCache]: Analyzing trace with hash 176055231, now seen corresponding path program 1 times [2021-03-26 13:22:31,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 13:22:31,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779225319] [2021-03-26 13:22:31,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 13:22:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 13:22:31,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:22:31,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 13:22:31,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 13:22:31,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779225319] [2021-03-26 13:22:31,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 13:22:31,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 13:22:31,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119622444] [2021-03-26 13:22:31,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 13:22:31,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 13:22:31,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 13:22:31,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 13:22:31,848 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 58 [2021-03-26 13:22:31,850 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 71 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-03-26 13:22:31,851 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 13:22:31,851 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 58 [2021-03-26 13:22:31,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 13:22:31,916 INFO L129 PetriNetUnfolder]: 31/107 cut-off events. [2021-03-26 13:22:31,916 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 13:22:31,918 INFO L84 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 107 events. 31/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 369 event pairs, 4 based on Foata normal form. 41/137 useless extension candidates. Maximal degree in co-relation 153. Up to 30 conditions per place. [2021-03-26 13:22:31,920 INFO L132 encePairwiseOnDemand]: 46/58 looper letters, 8 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2021-03-26 13:22:31,920 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 34 transitions, 107 flow [2021-03-26 13:22:31,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 13:22:31,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 13:22:31,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2021-03-26 13:22:31,932 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8390804597701149 [2021-03-26 13:22:31,933 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2021-03-26 13:22:31,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2021-03-26 13:22:31,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 13:22:31,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2021-03-26 13:22:31,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:22:31,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:22:31,949 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:22:31,951 INFO L185 Difference]: Start difference. First operand has 36 places, 31 transitions, 71 flow. Second operand 3 states and 146 transitions. [2021-03-26 13:22:31,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 34 transitions, 107 flow [2021-03-26 13:22:31,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 13:22:31,958 INFO L241 Difference]: Finished difference. Result has 34 places, 34 transitions, 118 flow [2021-03-26 13:22:31,960 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=34, PETRI_TRANSITIONS=34} [2021-03-26 13:22:31,960 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2021-03-26 13:22:31,961 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 13:22:31,961 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 34 transitions, 118 flow [2021-03-26 13:22:31,962 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 34 transitions, 118 flow [2021-03-26 13:22:31,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 34 transitions, 118 flow [2021-03-26 13:22:31,976 INFO L129 PetriNetUnfolder]: 31/101 cut-off events. [2021-03-26 13:22:31,976 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-26 13:22:31,977 INFO L84 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 101 events. 31/101 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 333 event pairs, 4 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 170. Up to 30 conditions per place. [2021-03-26 13:22:31,978 INFO L142 LiptonReduction]: Number of co-enabled transitions 348 [2021-03-26 13:22:31,982 INFO L154 LiptonReduction]: Checked pairs total: 81 [2021-03-26 13:22:31,983 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 13:22:31,983 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22 [2021-03-26 13:22:31,984 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 34 transitions, 118 flow [2021-03-26 13:22:31,984 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-03-26 13:22:31,985 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 13:22:31,985 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 13:22:31,985 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 13:22:31,985 INFO L428 AbstractCegarLoop]: === Iteration 2 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-26 13:22:31,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 13:22:31,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1037054279, now seen corresponding path program 1 times [2021-03-26 13:22:31,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 13:22:31,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585388620] [2021-03-26 13:22:31,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 13:22:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 13:22:31,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:22:32,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 13:22:32,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:22:32,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 13:22:32,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:22:32,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 13:22:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 13:22:32,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585388620] [2021-03-26 13:22:32,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 13:22:32,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 13:22:32,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169257481] [2021-03-26 13:22:32,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 13:22:32,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 13:22:32,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 13:22:32,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 13:22:32,007 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 58 [2021-03-26 13:22:32,008 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 34 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:22:32,008 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 13:22:32,008 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 58 [2021-03-26 13:22:32,008 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 13:22:32,062 INFO L129 PetriNetUnfolder]: 101/251 cut-off events. [2021-03-26 13:22:32,062 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2021-03-26 13:22:32,064 INFO L84 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 251 events. 101/251 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1135 event pairs, 18 based on Foata normal form. 4/225 useless extension candidates. Maximal degree in co-relation 537. Up to 100 conditions per place. [2021-03-26 13:22:32,069 INFO L132 encePairwiseOnDemand]: 49/58 looper letters, 11 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2021-03-26 13:22:32,069 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 162 flow [2021-03-26 13:22:32,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 13:22:32,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 13:22:32,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2021-03-26 13:22:32,077 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7011494252873564 [2021-03-26 13:22:32,077 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 122 transitions. [2021-03-26 13:22:32,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 122 transitions. [2021-03-26 13:22:32,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 13:22:32,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 122 transitions. [2021-03-26 13:22:32,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:22:32,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:22:32,079 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:22:32,079 INFO L185 Difference]: Start difference. First operand has 34 places, 34 transitions, 118 flow. Second operand 3 states and 122 transitions. [2021-03-26 13:22:32,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 162 flow [2021-03-26 13:22:32,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 13:22:32,082 INFO L241 Difference]: Finished difference. Result has 36 places, 38 transitions, 150 flow [2021-03-26 13:22:32,082 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=36, PETRI_TRANSITIONS=38} [2021-03-26 13:22:32,082 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2021-03-26 13:22:32,083 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 13:22:32,083 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 38 transitions, 150 flow [2021-03-26 13:22:32,083 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 38 transitions, 150 flow [2021-03-26 13:22:32,083 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 38 transitions, 150 flow [2021-03-26 13:22:32,106 INFO L129 PetriNetUnfolder]: 83/227 cut-off events. [2021-03-26 13:22:32,106 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-03-26 13:22:32,108 INFO L84 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 227 events. 83/227 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1070 event pairs, 7 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 457. Up to 61 conditions per place. [2021-03-26 13:22:32,110 INFO L142 LiptonReduction]: Number of co-enabled transitions 364 [2021-03-26 13:22:32,118 INFO L154 LiptonReduction]: Checked pairs total: 15 [2021-03-26 13:22:32,118 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 13:22:32,118 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 35 [2021-03-26 13:22:32,119 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 38 transitions, 150 flow [2021-03-26 13:22:32,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:22:32,120 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 13:22:32,120 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 13:22:32,120 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 13:22:32,120 INFO L428 AbstractCegarLoop]: === Iteration 3 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-26 13:22:32,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 13:22:32,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1051353959, now seen corresponding path program 2 times [2021-03-26 13:22:32,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 13:22:32,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664235971] [2021-03-26 13:22:32,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 13:22:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 13:22:32,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:22:32,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 13:22:32,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:22:32,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 13:22:32,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:22:32,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 13:22:32,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 13:22:32,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664235971] [2021-03-26 13:22:32,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 13:22:32,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 13:22:32,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351005447] [2021-03-26 13:22:32,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 13:22:32,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 13:22:32,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 13:22:32,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 13:22:32,149 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 58 [2021-03-26 13:22:32,149 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 38 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:22:32,149 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 13:22:32,150 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 58 [2021-03-26 13:22:32,150 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 13:22:32,216 INFO L129 PetriNetUnfolder]: 90/241 cut-off events. [2021-03-26 13:22:32,216 INFO L130 PetriNetUnfolder]: For 108/118 co-relation queries the response was YES. [2021-03-26 13:22:32,218 INFO L84 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 241 events. 90/241 cut-off events. For 108/118 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 973 event pairs, 12 based on Foata normal form. 23/250 useless extension candidates. Maximal degree in co-relation 579. Up to 105 conditions per place. [2021-03-26 13:22:32,223 INFO L132 encePairwiseOnDemand]: 49/58 looper letters, 13 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2021-03-26 13:22:32,223 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 198 flow [2021-03-26 13:22:32,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 13:22:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 13:22:32,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2021-03-26 13:22:32,229 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7126436781609196 [2021-03-26 13:22:32,229 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 124 transitions. [2021-03-26 13:22:32,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 124 transitions. [2021-03-26 13:22:32,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 13:22:32,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 124 transitions. [2021-03-26 13:22:32,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:22:32,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:22:32,232 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:22:32,232 INFO L185 Difference]: Start difference. First operand has 36 places, 38 transitions, 150 flow. Second operand 3 states and 124 transitions. [2021-03-26 13:22:32,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 198 flow [2021-03-26 13:22:32,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 13:22:32,236 INFO L241 Difference]: Finished difference. Result has 38 places, 40 transitions, 180 flow [2021-03-26 13:22:32,237 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=38, PETRI_TRANSITIONS=40} [2021-03-26 13:22:32,237 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2021-03-26 13:22:32,237 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 13:22:32,237 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 40 transitions, 180 flow [2021-03-26 13:22:32,240 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 40 transitions, 180 flow [2021-03-26 13:22:32,242 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 40 transitions, 180 flow [2021-03-26 13:22:32,255 INFO L129 PetriNetUnfolder]: 70/209 cut-off events. [2021-03-26 13:22:32,256 INFO L130 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2021-03-26 13:22:32,257 INFO L84 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 209 events. 70/209 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 858 event pairs, 6 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 454. Up to 66 conditions per place. [2021-03-26 13:22:32,259 INFO L142 LiptonReduction]: Number of co-enabled transitions 358 [2021-03-26 13:22:32,263 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 13:22:32,263 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 13:22:32,263 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 26 [2021-03-26 13:22:32,267 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 40 transitions, 180 flow [2021-03-26 13:22:32,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:22:32,267 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 13:22:32,267 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 13:22:32,268 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 13:22:32,268 INFO L428 AbstractCegarLoop]: === Iteration 4 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-26 13:22:32,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 13:22:32,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1267677509, now seen corresponding path program 1 times [2021-03-26 13:22:32,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 13:22:32,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426553990] [2021-03-26 13:22:32,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 13:22:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 13:22:32,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:22:32,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 13:22:32,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:22:32,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 13:22:32,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:22:32,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 13:22:32,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 13:22:32,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426553990] [2021-03-26 13:22:32,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 13:22:32,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 13:22:32,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352403263] [2021-03-26 13:22:32,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 13:22:32,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 13:22:32,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 13:22:32,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 13:22:32,313 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 58 [2021-03-26 13:22:32,313 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 40 transitions, 180 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-03-26 13:22:32,313 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 13:22:32,313 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 58 [2021-03-26 13:22:32,313 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 13:22:32,350 INFO L129 PetriNetUnfolder]: 98/274 cut-off events. [2021-03-26 13:22:32,350 INFO L130 PetriNetUnfolder]: For 178/193 co-relation queries the response was YES. [2021-03-26 13:22:32,351 INFO L84 FinitePrefix]: Finished finitePrefix Result has 741 conditions, 274 events. 98/274 cut-off events. For 178/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1190 event pairs, 14 based on Foata normal form. 4/265 useless extension candidates. Maximal degree in co-relation 730. Up to 86 conditions per place. [2021-03-26 13:22:32,353 INFO L132 encePairwiseOnDemand]: 50/58 looper letters, 14 selfloop transitions, 10 changer transitions 0/46 dead transitions. [2021-03-26 13:22:32,353 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 252 flow [2021-03-26 13:22:32,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 13:22:32,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 13:22:32,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2021-03-26 13:22:32,354 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7011494252873564 [2021-03-26 13:22:32,354 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 122 transitions. [2021-03-26 13:22:32,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 122 transitions. [2021-03-26 13:22:32,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 13:22:32,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 122 transitions. [2021-03-26 13:22:32,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:22:32,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:22:32,356 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:22:32,356 INFO L185 Difference]: Start difference. First operand has 38 places, 40 transitions, 180 flow. Second operand 3 states and 122 transitions. [2021-03-26 13:22:32,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 252 flow [2021-03-26 13:22:32,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 46 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 13:22:32,359 INFO L241 Difference]: Finished difference. Result has 40 places, 44 transitions, 234 flow [2021-03-26 13:22:32,359 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=40, PETRI_TRANSITIONS=44} [2021-03-26 13:22:32,359 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2021-03-26 13:22:32,359 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 13:22:32,359 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 44 transitions, 234 flow [2021-03-26 13:22:32,360 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 44 transitions, 234 flow [2021-03-26 13:22:32,360 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 44 transitions, 234 flow [2021-03-26 13:22:32,375 INFO L129 PetriNetUnfolder]: 78/237 cut-off events. [2021-03-26 13:22:32,375 INFO L130 PetriNetUnfolder]: For 200/207 co-relation queries the response was YES. [2021-03-26 13:22:32,376 INFO L84 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 237 events. 78/237 cut-off events. For 200/207 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1023 event pairs, 6 based on Foata normal form. 1/227 useless extension candidates. Maximal degree in co-relation 627. Up to 74 conditions per place. [2021-03-26 13:22:32,378 INFO L142 LiptonReduction]: Number of co-enabled transitions 380 [2021-03-26 13:22:32,385 INFO L154 LiptonReduction]: Checked pairs total: 15 [2021-03-26 13:22:32,385 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 13:22:32,385 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 26 [2021-03-26 13:22:32,387 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 44 transitions, 234 flow [2021-03-26 13:22:32,387 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-03-26 13:22:32,387 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 13:22:32,387 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 13:22:32,387 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 13:22:32,388 INFO L428 AbstractCegarLoop]: === Iteration 5 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-26 13:22:32,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 13:22:32,388 INFO L82 PathProgramCache]: Analyzing trace with hash 628495675, now seen corresponding path program 2 times [2021-03-26 13:22:32,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 13:22:32,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795175004] [2021-03-26 13:22:32,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 13:22:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 13:22:32,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:22:32,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 13:22:32,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:22:32,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 13:22:32,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:22:32,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 13:22:32,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 13:22:32,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795175004] [2021-03-26 13:22:32,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 13:22:32,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 13:22:32,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933598435] [2021-03-26 13:22:32,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 13:22:32,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 13:22:32,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 13:22:32,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 13:22:32,433 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 58 [2021-03-26 13:22:32,434 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 44 transitions, 234 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-03-26 13:22:32,434 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 13:22:32,434 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 58 [2021-03-26 13:22:32,434 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 13:22:32,478 INFO L129 PetriNetUnfolder]: 86/259 cut-off events. [2021-03-26 13:22:32,478 INFO L130 PetriNetUnfolder]: For 388/405 co-relation queries the response was YES. [2021-03-26 13:22:32,480 INFO L84 FinitePrefix]: Finished finitePrefix Result has 790 conditions, 259 events. 86/259 cut-off events. For 388/405 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1074 event pairs, 13 based on Foata normal form. 16/259 useless extension candidates. Maximal degree in co-relation 778. Up to 81 conditions per place. [2021-03-26 13:22:32,482 INFO L132 encePairwiseOnDemand]: 50/58 looper letters, 14 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2021-03-26 13:22:32,482 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 264 flow [2021-03-26 13:22:32,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 13:22:32,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 13:22:32,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2021-03-26 13:22:32,483 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7126436781609196 [2021-03-26 13:22:32,483 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 124 transitions. [2021-03-26 13:22:32,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 124 transitions. [2021-03-26 13:22:32,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 13:22:32,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 124 transitions. [2021-03-26 13:22:32,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:22:32,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:22:32,485 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:22:32,486 INFO L185 Difference]: Start difference. First operand has 40 places, 44 transitions, 234 flow. Second operand 3 states and 124 transitions. [2021-03-26 13:22:32,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 264 flow [2021-03-26 13:22:32,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 13:22:32,489 INFO L241 Difference]: Finished difference. Result has 40 places, 42 transitions, 216 flow [2021-03-26 13:22:32,489 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=40, PETRI_TRANSITIONS=42} [2021-03-26 13:22:32,489 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2021-03-26 13:22:32,489 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 13:22:32,490 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 42 transitions, 216 flow [2021-03-26 13:22:32,490 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 42 transitions, 216 flow [2021-03-26 13:22:32,490 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 42 transitions, 216 flow [2021-03-26 13:22:32,504 INFO L129 PetriNetUnfolder]: 68/227 cut-off events. [2021-03-26 13:22:32,504 INFO L130 PetriNetUnfolder]: For 193/202 co-relation queries the response was YES. [2021-03-26 13:22:32,506 INFO L84 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 227 events. 68/227 cut-off events. For 193/202 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 932 event pairs, 6 based on Foata normal form. 1/217 useless extension candidates. Maximal degree in co-relation 579. Up to 65 conditions per place. [2021-03-26 13:22:32,508 INFO L142 LiptonReduction]: Number of co-enabled transitions 356 [2021-03-26 13:22:32,513 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 13:22:32,513 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 13:22:32,513 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 24 [2021-03-26 13:22:32,515 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 42 transitions, 216 flow [2021-03-26 13:22:32,515 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-03-26 13:22:32,516 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 13:22:32,516 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 13:22:32,516 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 13:22:32,516 INFO L428 AbstractCegarLoop]: === Iteration 6 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-26 13:22:32,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 13:22:32,516 INFO L82 PathProgramCache]: Analyzing trace with hash 242715444, now seen corresponding path program 1 times [2021-03-26 13:22:32,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 13:22:32,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825476888] [2021-03-26 13:22:32,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 13:22:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 13:22:32,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:22:32,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 13:22:32,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:22:32,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 13:22:32,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:22:32,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 13:22:32,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 13:22:32,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825476888] [2021-03-26 13:22:32,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 13:22:32,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 13:22:32,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229950524] [2021-03-26 13:22:32,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 13:22:32,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 13:22:32,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 13:22:32,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 13:22:32,592 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 58 [2021-03-26 13:22:32,593 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 42 transitions, 216 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-03-26 13:22:32,593 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 13:22:32,593 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 58 [2021-03-26 13:22:32,593 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 13:22:32,659 INFO L129 PetriNetUnfolder]: 179/386 cut-off events. [2021-03-26 13:22:32,659 INFO L130 PetriNetUnfolder]: For 308/314 co-relation queries the response was YES. [2021-03-26 13:22:32,661 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 386 events. 179/386 cut-off events. For 308/314 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1428 event pairs, 22 based on Foata normal form. 12/382 useless extension candidates. Maximal degree in co-relation 1016. Up to 188 conditions per place. [2021-03-26 13:22:32,663 INFO L132 encePairwiseOnDemand]: 54/58 looper letters, 12 selfloop transitions, 3 changer transitions 4/48 dead transitions. [2021-03-26 13:22:32,663 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 282 flow [2021-03-26 13:22:32,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 13:22:32,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 13:22:32,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2021-03-26 13:22:32,664 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5905172413793104 [2021-03-26 13:22:32,664 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 137 transitions. [2021-03-26 13:22:32,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 137 transitions. [2021-03-26 13:22:32,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 13:22:32,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 137 transitions. [2021-03-26 13:22:32,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:22:32,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:22:32,666 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:22:32,666 INFO L185 Difference]: Start difference. First operand has 40 places, 42 transitions, 216 flow. Second operand 4 states and 137 transitions. [2021-03-26 13:22:32,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 282 flow [2021-03-26 13:22:32,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 273 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 13:22:32,669 INFO L241 Difference]: Finished difference. Result has 43 places, 43 transitions, 222 flow [2021-03-26 13:22:32,669 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2021-03-26 13:22:32,669 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2021-03-26 13:22:32,669 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 13:22:32,670 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 43 transitions, 222 flow [2021-03-26 13:22:32,670 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 43 transitions, 222 flow [2021-03-26 13:22:32,670 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 43 transitions, 222 flow [2021-03-26 13:22:32,688 INFO L129 PetriNetUnfolder]: 83/250 cut-off events. [2021-03-26 13:22:32,689 INFO L130 PetriNetUnfolder]: For 135/140 co-relation queries the response was YES. [2021-03-26 13:22:32,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 250 events. 83/250 cut-off events. For 135/140 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 976 event pairs, 6 based on Foata normal form. 2/241 useless extension candidates. Maximal degree in co-relation 634. Up to 65 conditions per place. [2021-03-26 13:22:32,692 INFO L142 LiptonReduction]: Number of co-enabled transitions 380 [2021-03-26 13:22:32,697 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 13:22:32,697 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 13:22:32,697 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 28 [2021-03-26 13:22:32,700 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 222 flow [2021-03-26 13:22:32,700 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-03-26 13:22:32,700 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 13:22:32,700 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 13:22:32,700 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 13:22:32,700 INFO L428 AbstractCegarLoop]: === Iteration 7 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-26 13:22:32,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 13:22:32,701 INFO L82 PathProgramCache]: Analyzing trace with hash -801084517, now seen corresponding path program 1 times [2021-03-26 13:22:32,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 13:22:32,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151093381] [2021-03-26 13:22:32,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 13:22:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 13:22:32,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:22:32,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 13:22:32,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:22:32,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 13:22:32,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:22:32,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 13:22:32,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 13:22:32,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151093381] [2021-03-26 13:22:32,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 13:22:32,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 13:22:32,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61766129] [2021-03-26 13:22:32,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 13:22:32,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 13:22:32,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 13:22:32,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 13:22:32,748 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 58 [2021-03-26 13:22:32,748 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 222 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-03-26 13:22:32,749 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 13:22:32,749 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 58 [2021-03-26 13:22:32,749 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 13:22:32,802 INFO L129 PetriNetUnfolder]: 190/423 cut-off events. [2021-03-26 13:22:32,803 INFO L130 PetriNetUnfolder]: For 348/355 co-relation queries the response was YES. [2021-03-26 13:22:32,805 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1255 conditions, 423 events. 190/423 cut-off events. For 348/355 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1600 event pairs, 26 based on Foata normal form. 13/421 useless extension candidates. Maximal degree in co-relation 1240. Up to 216 conditions per place. [2021-03-26 13:22:32,807 INFO L132 encePairwiseOnDemand]: 54/58 looper letters, 14 selfloop transitions, 3 changer transitions 4/50 dead transitions. [2021-03-26 13:22:32,807 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 301 flow [2021-03-26 13:22:32,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 13:22:32,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 13:22:32,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2021-03-26 13:22:32,808 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5905172413793104 [2021-03-26 13:22:32,808 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 137 transitions. [2021-03-26 13:22:32,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 137 transitions. [2021-03-26 13:22:32,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 13:22:32,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 137 transitions. [2021-03-26 13:22:32,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:22:32,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:22:32,810 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:22:32,810 INFO L185 Difference]: Start difference. First operand has 43 places, 43 transitions, 222 flow. Second operand 4 states and 137 transitions. [2021-03-26 13:22:32,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 301 flow [2021-03-26 13:22:32,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 50 transitions, 291 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 13:22:32,815 INFO L241 Difference]: Finished difference. Result has 45 places, 44 transitions, 234 flow [2021-03-26 13:22:32,815 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2021-03-26 13:22:32,816 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2021-03-26 13:22:32,816 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 13:22:32,816 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 44 transitions, 234 flow [2021-03-26 13:22:32,816 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 44 transitions, 234 flow [2021-03-26 13:22:32,817 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 44 transitions, 234 flow [2021-03-26 13:22:32,835 INFO L129 PetriNetUnfolder]: 108/305 cut-off events. [2021-03-26 13:22:32,836 INFO L130 PetriNetUnfolder]: For 186/191 co-relation queries the response was YES. [2021-03-26 13:22:32,837 INFO L84 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 305 events. 108/305 cut-off events. For 186/191 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1247 event pairs, 10 based on Foata normal form. 2/295 useless extension candidates. Maximal degree in co-relation 820. Up to 69 conditions per place. [2021-03-26 13:22:32,840 INFO L142 LiptonReduction]: Number of co-enabled transitions 394 [2021-03-26 13:22:32,845 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 13:22:32,845 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 13:22:32,845 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 29 [2021-03-26 13:22:32,848 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 234 flow [2021-03-26 13:22:32,848 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-03-26 13:22:32,848 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 13:22:32,848 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 13:22:32,849 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 13:22:32,849 INFO L428 AbstractCegarLoop]: === Iteration 8 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-26 13:22:32,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 13:22:32,849 INFO L82 PathProgramCache]: Analyzing trace with hash -753043310, now seen corresponding path program 2 times [2021-03-26 13:22:32,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 13:22:32,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658850795] [2021-03-26 13:22:32,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 13:22:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 13:22:32,871 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 13:22:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 13:22:32,876 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 13:22:32,899 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 13:22:32,899 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 13:22:32,900 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 13:22:32,929 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 01:22:32 BasicIcfg [2021-03-26 13:22:32,929 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 13:22:32,930 INFO L168 Benchmark]: Toolchain (without parser) took 2248.97 ms. Allocated memory was 255.9 MB in the beginning and 341.8 MB in the end (delta: 86.0 MB). Free memory was 236.4 MB in the beginning and 258.0 MB in the end (delta: -21.6 MB). Peak memory consumption was 62.9 MB. Max. memory is 16.0 GB. [2021-03-26 13:22:32,930 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.47 ms. Allocated memory is still 255.9 MB. Free memory is still 237.5 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 13:22:32,931 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.42 ms. Allocated memory is still 255.9 MB. Free memory was 236.2 MB in the beginning and 234.8 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 13:22:32,931 INFO L168 Benchmark]: Boogie Preprocessor took 16.54 ms. Allocated memory is still 255.9 MB. Free memory was 234.8 MB in the beginning and 233.8 MB in the end (delta: 976.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 13:22:32,931 INFO L168 Benchmark]: RCFGBuilder took 259.10 ms. Allocated memory is still 255.9 MB. Free memory was 233.8 MB in the beginning and 237.7 MB in the end (delta: -3.9 MB). Peak memory consumption was 22.4 MB. Max. memory is 16.0 GB. [2021-03-26 13:22:32,931 INFO L168 Benchmark]: TraceAbstraction took 1946.36 ms. Allocated memory was 255.9 MB in the beginning and 341.8 MB in the end (delta: 86.0 MB). Free memory was 236.9 MB in the beginning and 258.0 MB in the end (delta: -21.0 MB). Peak memory consumption was 61.4 MB. Max. memory is 16.0 GB. [2021-03-26 13:22:32,933 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.47 ms. Allocated memory is still 255.9 MB. Free memory is still 237.5 MB. There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 22.42 ms. Allocated memory is still 255.9 MB. Free memory was 236.2 MB in the beginning and 234.8 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 16.54 ms. Allocated memory is still 255.9 MB. Free memory was 234.8 MB in the beginning and 233.8 MB in the end (delta: 976.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 259.10 ms. Allocated memory is still 255.9 MB. Free memory was 233.8 MB in the beginning and 237.7 MB in the end (delta: -3.9 MB). Peak memory consumption was 22.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 1946.36 ms. Allocated memory was 255.9 MB in the beginning and 341.8 MB in the end (delta: 86.0 MB). Free memory was 236.9 MB in the beginning and 258.0 MB in the end (delta: -21.0 MB). Peak memory consumption was 61.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 446.4ms, 48 PlacesBefore, 36 PlacesAfterwards, 43 TransitionsBefore, 31 TransitionsAfterwards, 818 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 1106 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 558, positive: 504, positive conditional: 504, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 558, positive: 504, positive conditional: 0, positive unconditional: 504, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 558, positive: 504, positive conditional: 0, positive unconditional: 504, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 370, positive: 343, positive conditional: 0, positive unconditional: 343, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 370, positive: 324, positive conditional: 0, positive unconditional: 324, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 46, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 151, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 99, negative conditional: 0, negative unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 558, positive: 161, positive conditional: 0, positive unconditional: 161, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 370, unknown conditional: 0, unknown unconditional: 370] , Statistics on independence cache: Total cache size (in pairs): 370, Positive cache size: 343, Positive conditional cache size: 0, Positive unconditional cache size: 343, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.0ms, 34 PlacesBefore, 34 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 348 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 81 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, positive: 35, positive conditional: 35, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 41, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 41, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 41, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 375, Positive cache size: 348, Positive conditional cache size: 0, Positive unconditional cache size: 348, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.8ms, 36 PlacesBefore, 36 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 15 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 375, Positive cache size: 348, Positive conditional cache size: 0, Positive unconditional cache size: 348, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.0ms, 38 PlacesBefore, 38 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 358 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 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] , Statistics on independence cache: Total cache size (in pairs): 375, Positive cache size: 348, Positive conditional cache size: 0, Positive unconditional cache size: 348, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25.5ms, 40 PlacesBefore, 40 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 380 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 15 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 376, Positive cache size: 349, Positive conditional cache size: 0, Positive unconditional cache size: 349, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Eliminated conditions: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.5ms, 40 PlacesBefore, 40 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 356 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 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] , Statistics on independence cache: Total cache size (in pairs): 376, Positive cache size: 349, Positive conditional cache size: 0, Positive unconditional cache size: 349, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.0ms, 43 PlacesBefore, 43 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 380 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 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] , Statistics on independence cache: Total cache size (in pairs): 376, Positive cache size: 349, Positive conditional cache size: 0, Positive unconditional cache size: 349, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28.6ms, 45 PlacesBefore, 45 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 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] , Statistics on independence cache: Total cache size (in pairs): 376, Positive cache size: 349, Positive conditional cache size: 0, Positive unconditional cache size: 349, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Eliminated conditions: 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: 4.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 1773.4ms, OverallIterations: 8, TraceHistogramMax: 2, EmptinessCheckTime: 0.0ms, AutomataDifference: 539.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 549.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 78 SDtfs, 29 SDslu, 0 SDs, 0 SdLazy, 88 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 93.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 54.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=4, 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: 14.9ms SsaConstructionTime, 106.6ms SatisfiabilityAnalysisTime, 159.8ms InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 153 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...