/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-atomic/qrcu-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 00:01:24,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 00:01:24,956 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 00:01:24,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 00:01:24,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 00:01:24,982 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 00:01:24,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 00:01:24,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 00:01:24,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 00:01:24,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 00:01:24,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 00:01:24,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 00:01:24,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 00:01:24,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 00:01:24,996 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 00:01:24,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 00:01:24,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 00:01:25,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 00:01:25,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 00:01:25,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 00:01:25,007 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 00:01:25,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 00:01:25,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 00:01:25,011 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 00:01:25,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 00:01:25,018 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 00:01:25,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 00:01:25,020 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 00:01:25,021 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 00:01:25,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 00:01:25,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 00:01:25,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 00:01:25,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 00:01:25,024 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 00:01:25,034 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 00:01:25,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 00:01:25,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 00:01:25,035 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 00:01:25,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 00:01:25,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 00:01:25,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 00:01:25,038 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2020-10-16 00:01:25,083 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 00:01:25,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 00:01:25,085 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 00:01:25,085 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 00:01:25,085 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 00:01:25,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 00:01:25,086 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 00:01:25,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 00:01:25,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 00:01:25,087 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 00:01:25,087 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 00:01:25,087 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 00:01:25,087 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 00:01:25,087 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 00:01:25,088 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 00:01:25,088 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 00:01:25,089 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 00:01:25,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 00:01:25,090 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 00:01:25,090 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 00:01:25,090 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 00:01:25,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 00:01:25,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 00:01:25,091 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 00:01:25,091 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 00:01:25,091 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 00:01:25,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 00:01:25,092 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 00:01:25,092 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 00:01:25,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 00:01:25,375 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 00:01:25,378 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 00:01:25,379 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 00:01:25,380 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 00:01:25,380 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/qrcu-1.i [2020-10-16 00:01:25,445 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8541b47d7/efd815256d424ca68d973b63dda4b8a3/FLAG9d9551bba [2020-10-16 00:01:25,937 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 00:01:25,938 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i [2020-10-16 00:01:25,957 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8541b47d7/efd815256d424ca68d973b63dda4b8a3/FLAG9d9551bba [2020-10-16 00:01:26,263 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8541b47d7/efd815256d424ca68d973b63dda4b8a3 [2020-10-16 00:01:26,270 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 00:01:26,272 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 00:01:26,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 00:01:26,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 00:01:26,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 00:01:26,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:01:26" (1/1) ... [2020-10-16 00:01:26,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76c2b72c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:26, skipping insertion in model container [2020-10-16 00:01:26,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:01:26" (1/1) ... [2020-10-16 00:01:26,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 00:01:26,356 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 00:01:26,811 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 00:01:26,827 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 00:01:26,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 00:01:26,950 INFO L208 MainTranslator]: Completed translation [2020-10-16 00:01:26,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:26 WrapperNode [2020-10-16 00:01:26,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 00:01:26,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 00:01:26,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 00:01:26,952 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 00:01:26,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:26" (1/1) ... [2020-10-16 00:01:26,978 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:26" (1/1) ... [2020-10-16 00:01:27,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 00:01:27,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 00:01:27,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 00:01:27,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 00:01:27,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:26" (1/1) ... [2020-10-16 00:01:27,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:26" (1/1) ... [2020-10-16 00:01:27,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:26" (1/1) ... [2020-10-16 00:01:27,025 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:26" (1/1) ... [2020-10-16 00:01:27,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:26" (1/1) ... [2020-10-16 00:01:27,039 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:26" (1/1) ... [2020-10-16 00:01:27,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:26" (1/1) ... [2020-10-16 00:01:27,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 00:01:27,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 00:01:27,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 00:01:27,048 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 00:01:27,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:26" (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 [2020-10-16 00:01:27,112 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader1 [2020-10-16 00:01:27,112 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader1 [2020-10-16 00:01:27,113 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader2 [2020-10-16 00:01:27,113 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader2 [2020-10-16 00:01:27,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-16 00:01:27,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 00:01:27,113 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_updater [2020-10-16 00:01:27,114 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_updater [2020-10-16 00:01:27,114 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-10-16 00:01:27,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 00:01:27,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 00:01:27,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-16 00:01:27,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 00:01:27,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 00:01:27,116 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 00:01:28,204 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 00:01:28,204 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-16 00:01:28,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:01:28 BoogieIcfgContainer [2020-10-16 00:01:28,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 00:01:28,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 00:01:28,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 00:01:28,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 00:01:28,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:01:26" (1/3) ... [2020-10-16 00:01:28,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e663b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:01:28, skipping insertion in model container [2020-10-16 00:01:28,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:26" (2/3) ... [2020-10-16 00:01:28,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e663b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:01:28, skipping insertion in model container [2020-10-16 00:01:28,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:01:28" (3/3) ... [2020-10-16 00:01:28,215 INFO L111 eAbstractionObserver]: Analyzing ICFG qrcu-1.i [2020-10-16 00:01:28,226 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 00:01:28,233 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 00:01:28,234 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 00:01:28,267 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,268 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,268 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,268 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,269 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,269 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,269 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,269 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,270 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,270 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,270 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,270 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,271 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,271 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,271 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,271 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,272 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,272 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,272 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,272 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,272 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,272 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,273 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,273 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,273 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,273 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,274 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,274 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,274 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,274 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,275 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,275 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,275 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,275 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,275 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,276 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,276 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,276 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,276 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,276 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,277 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,277 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,277 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,277 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,278 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,278 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,278 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,278 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,279 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,279 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,279 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,279 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,279 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,279 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,280 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,280 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,280 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,280 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,280 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,280 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,281 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,281 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,281 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,281 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,281 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,282 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,282 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,282 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,282 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,282 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,284 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,284 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,284 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,284 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,284 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,285 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,285 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,285 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,285 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,285 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,286 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,286 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,286 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,286 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,286 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,286 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,287 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,287 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,287 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,287 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,287 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,287 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,288 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,288 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,288 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,288 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,288 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,289 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,289 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,289 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,289 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,289 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,290 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,290 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,290 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,290 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,290 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,291 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,291 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,291 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,291 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,291 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,292 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,292 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,292 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,292 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,292 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,293 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,293 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,293 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,293 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,293 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,293 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,294 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,294 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,294 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,294 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,294 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,295 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,295 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,295 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,295 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,295 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,296 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,296 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,296 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,296 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,296 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,296 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,297 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,297 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,297 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,297 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,297 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,298 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,298 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,298 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,298 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,298 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,298 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,299 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,299 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,299 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,299 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,299 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,300 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,300 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,300 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,300 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,300 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,300 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,301 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,301 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,301 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,301 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,301 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,302 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,302 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,302 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,302 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,302 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,303 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,303 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,303 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,303 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,303 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,307 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,308 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,308 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,308 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,308 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,308 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,309 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,309 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,309 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,309 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,309 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,310 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,310 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,310 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,310 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,310 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,310 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,311 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,311 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,311 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,311 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,311 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,311 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,312 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,312 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,312 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,312 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,312 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,313 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,313 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,313 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,313 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,313 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,313 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,314 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,321 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,321 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,321 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,321 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,321 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,321 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,321 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,322 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,322 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,322 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,322 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,322 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,322 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,322 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,322 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,323 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,323 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,323 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,323 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,324 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,324 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,325 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,325 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,325 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,325 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,325 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,325 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,326 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,326 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,326 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,326 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,326 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,327 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,327 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,327 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,327 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,327 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,327 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 00:01:28,352 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 00:01:28,370 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 00:01:28,370 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 00:01:28,370 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 00:01:28,370 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 00:01:28,370 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 00:01:28,370 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 00:01:28,371 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 00:01:28,371 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 00:01:28,385 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 157 places, 171 transitions, 384 flow [2020-10-16 00:01:28,453 INFO L129 PetriNetUnfolder]: 23/179 cut-off events. [2020-10-16 00:01:28,453 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2020-10-16 00:01:28,461 INFO L80 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 179 events. 23/179 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 447 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 141. Up to 6 conditions per place. [2020-10-16 00:01:28,461 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 171 transitions, 384 flow [2020-10-16 00:01:28,470 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 155 transitions, 337 flow [2020-10-16 00:01:28,472 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 00:01:28,475 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 155 transitions, 337 flow [2020-10-16 00:01:28,477 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 155 transitions, 337 flow [2020-10-16 00:01:28,478 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 143 places, 155 transitions, 337 flow [2020-10-16 00:01:28,513 INFO L129 PetriNetUnfolder]: 21/166 cut-off events. [2020-10-16 00:01:28,513 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2020-10-16 00:01:28,516 INFO L80 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 166 events. 21/166 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 432 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 141. Up to 6 conditions per place. [2020-10-16 00:01:28,524 INFO L117 LiptonReduction]: Number of co-enabled transitions 10120 [2020-10-16 00:01:31,525 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-10-16 00:01:31,652 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-16 00:01:31,934 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2020-10-16 00:01:32,050 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-16 00:01:32,074 INFO L132 LiptonReduction]: Checked pairs total: 25903 [2020-10-16 00:01:32,074 INFO L134 LiptonReduction]: Total number of compositions: 116 [2020-10-16 00:01:32,076 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3606 [2020-10-16 00:01:32,093 INFO L129 PetriNetUnfolder]: 9/45 cut-off events. [2020-10-16 00:01:32,093 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2020-10-16 00:01:32,095 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:32,096 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:32,096 INFO L429 AbstractCegarLoop]: === Iteration 1 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:32,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:32,102 INFO L82 PathProgramCache]: Analyzing trace with hash 248883412, now seen corresponding path program 1 times [2020-10-16 00:01:32,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:32,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084484401] [2020-10-16 00:01:32,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:32,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084484401] [2020-10-16 00:01:32,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:32,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 00:01:32,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191398333] [2020-10-16 00:01:32,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 00:01:32,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:32,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 00:01:32,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 00:01:32,387 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 287 [2020-10-16 00:01:32,390 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 67 transitions, 161 flow. Second operand 3 states. [2020-10-16 00:01:32,390 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:32,390 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 287 [2020-10-16 00:01:32,392 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:32,446 INFO L129 PetriNetUnfolder]: 17/92 cut-off events. [2020-10-16 00:01:32,447 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2020-10-16 00:01:32,448 INFO L80 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 92 events. 17/92 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 249 event pairs, 0 based on Foata normal form. 26/100 useless extension candidates. Maximal degree in co-relation 102. Up to 12 conditions per place. [2020-10-16 00:01:32,450 INFO L132 encePairwiseOnDemand]: 281/287 looper letters, 13 selfloop transitions, 3 changer transitions 0/67 dead transitions. [2020-10-16 00:01:32,450 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 67 transitions, 193 flow [2020-10-16 00:01:32,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 00:01:32,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 00:01:32,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 738 transitions. [2020-10-16 00:01:32,469 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2020-10-16 00:01:32,469 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 738 transitions. [2020-10-16 00:01:32,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 738 transitions. [2020-10-16 00:01:32,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:32,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 738 transitions. [2020-10-16 00:01:32,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 00:01:32,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 00:01:32,489 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 00:01:32,492 INFO L185 Difference]: Start difference. First operand has 59 places, 67 transitions, 161 flow. Second operand 3 states and 738 transitions. [2020-10-16 00:01:32,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 67 transitions, 193 flow [2020-10-16 00:01:32,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 67 transitions, 175 flow, removed 0 selfloop flow, removed 6 redundant places. [2020-10-16 00:01:32,499 INFO L241 Difference]: Finished difference. Result has 57 places, 67 transitions, 161 flow [2020-10-16 00:01:32,502 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=57, PETRI_TRANSITIONS=67} [2020-10-16 00:01:32,503 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2020-10-16 00:01:32,503 INFO L481 AbstractCegarLoop]: Abstraction has has 57 places, 67 transitions, 161 flow [2020-10-16 00:01:32,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 00:01:32,504 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:32,504 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:32,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 00:01:32,504 INFO L429 AbstractCegarLoop]: === Iteration 2 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:32,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:32,505 INFO L82 PathProgramCache]: Analyzing trace with hash -869515668, now seen corresponding path program 1 times [2020-10-16 00:01:32,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:32,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516005352] [2020-10-16 00:01:32,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:32,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:32,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516005352] [2020-10-16 00:01:32,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:32,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 00:01:32,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485457701] [2020-10-16 00:01:32,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 00:01:32,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:32,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 00:01:32,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 00:01:32,661 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 287 [2020-10-16 00:01:32,662 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 67 transitions, 161 flow. Second operand 3 states. [2020-10-16 00:01:32,662 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:32,662 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 287 [2020-10-16 00:01:32,663 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:32,694 INFO L129 PetriNetUnfolder]: 41/192 cut-off events. [2020-10-16 00:01:32,694 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2020-10-16 00:01:32,695 INFO L80 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 192 events. 41/192 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 801 event pairs, 3 based on Foata normal form. 2/161 useless extension candidates. Maximal degree in co-relation 189. Up to 18 conditions per place. [2020-10-16 00:01:32,697 INFO L132 encePairwiseOnDemand]: 284/287 looper letters, 4 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2020-10-16 00:01:32,697 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 68 transitions, 175 flow [2020-10-16 00:01:32,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 00:01:32,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 00:01:32,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 775 transitions. [2020-10-16 00:01:32,700 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.9001161440185831 [2020-10-16 00:01:32,700 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 775 transitions. [2020-10-16 00:01:32,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 775 transitions. [2020-10-16 00:01:32,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:32,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 775 transitions. [2020-10-16 00:01:32,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 00:01:32,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 00:01:32,705 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 00:01:32,705 INFO L185 Difference]: Start difference. First operand has 57 places, 67 transitions, 161 flow. Second operand 3 states and 775 transitions. [2020-10-16 00:01:32,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 68 transitions, 175 flow [2020-10-16 00:01:32,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 68 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 00:01:32,708 INFO L241 Difference]: Finished difference. Result has 59 places, 67 transitions, 166 flow [2020-10-16 00:01:32,708 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=59, PETRI_TRANSITIONS=67} [2020-10-16 00:01:32,709 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 0 predicate places. [2020-10-16 00:01:32,709 INFO L481 AbstractCegarLoop]: Abstraction has has 59 places, 67 transitions, 166 flow [2020-10-16 00:01:32,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 00:01:32,709 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:32,710 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:32,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 00:01:32,710 INFO L429 AbstractCegarLoop]: === Iteration 3 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:32,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:32,711 INFO L82 PathProgramCache]: Analyzing trace with hash -869515522, now seen corresponding path program 1 times [2020-10-16 00:01:32,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:32,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911683714] [2020-10-16 00:01:32,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:32,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:32,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911683714] [2020-10-16 00:01:32,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:32,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 00:01:32,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804674692] [2020-10-16 00:01:32,777 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 00:01:32,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:32,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 00:01:32,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 00:01:32,780 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 287 [2020-10-16 00:01:32,780 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 67 transitions, 166 flow. Second operand 3 states. [2020-10-16 00:01:32,781 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:32,781 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 287 [2020-10-16 00:01:32,781 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:32,808 INFO L129 PetriNetUnfolder]: 24/124 cut-off events. [2020-10-16 00:01:32,808 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 00:01:32,809 INFO L80 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 124 events. 24/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 469 event pairs, 2 based on Foata normal form. 2/110 useless extension candidates. Maximal degree in co-relation 141. Up to 16 conditions per place. [2020-10-16 00:01:32,810 INFO L132 encePairwiseOnDemand]: 284/287 looper letters, 4 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2020-10-16 00:01:32,810 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 68 transitions, 180 flow [2020-10-16 00:01:32,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 00:01:32,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 00:01:32,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 775 transitions. [2020-10-16 00:01:32,814 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.9001161440185831 [2020-10-16 00:01:32,814 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 775 transitions. [2020-10-16 00:01:32,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 775 transitions. [2020-10-16 00:01:32,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:32,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 775 transitions. [2020-10-16 00:01:32,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 00:01:32,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 00:01:32,818 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 00:01:32,818 INFO L185 Difference]: Start difference. First operand has 59 places, 67 transitions, 166 flow. Second operand 3 states and 775 transitions. [2020-10-16 00:01:32,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 68 transitions, 180 flow [2020-10-16 00:01:32,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 68 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 00:01:32,821 INFO L241 Difference]: Finished difference. Result has 60 places, 67 transitions, 170 flow [2020-10-16 00:01:32,821 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=60, PETRI_TRANSITIONS=67} [2020-10-16 00:01:32,821 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 1 predicate places. [2020-10-16 00:01:32,821 INFO L481 AbstractCegarLoop]: Abstraction has has 60 places, 67 transitions, 170 flow [2020-10-16 00:01:32,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 00:01:32,822 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:32,822 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:32,822 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 00:01:32,822 INFO L429 AbstractCegarLoop]: === Iteration 4 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:32,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:32,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1289592080, now seen corresponding path program 1 times [2020-10-16 00:01:32,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:32,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810203105] [2020-10-16 00:01:32,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:32,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810203105] [2020-10-16 00:01:32,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:32,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 00:01:32,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455121457] [2020-10-16 00:01:32,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 00:01:32,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:32,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 00:01:32,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 00:01:32,864 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 287 [2020-10-16 00:01:32,865 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 67 transitions, 170 flow. Second operand 3 states. [2020-10-16 00:01:32,865 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:32,865 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 287 [2020-10-16 00:01:32,865 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:32,965 INFO L129 PetriNetUnfolder]: 176/487 cut-off events. [2020-10-16 00:01:32,966 INFO L130 PetriNetUnfolder]: For 4/10 co-relation queries the response was YES. [2020-10-16 00:01:32,968 INFO L80 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 487 events. 176/487 cut-off events. For 4/10 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2975 event pairs, 37 based on Foata normal form. 16/467 useless extension candidates. Maximal degree in co-relation 634. Up to 197 conditions per place. [2020-10-16 00:01:32,972 INFO L132 encePairwiseOnDemand]: 280/287 looper letters, 22 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2020-10-16 00:01:32,972 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 78 transitions, 251 flow [2020-10-16 00:01:32,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 00:01:32,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 00:01:32,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2020-10-16 00:01:32,975 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8432055749128919 [2020-10-16 00:01:32,975 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 726 transitions. [2020-10-16 00:01:32,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 726 transitions. [2020-10-16 00:01:32,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:32,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 726 transitions. [2020-10-16 00:01:32,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 00:01:32,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 00:01:32,979 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 00:01:32,979 INFO L185 Difference]: Start difference. First operand has 60 places, 67 transitions, 170 flow. Second operand 3 states and 726 transitions. [2020-10-16 00:01:32,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 78 transitions, 251 flow [2020-10-16 00:01:32,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 78 transitions, 247 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 00:01:32,982 INFO L241 Difference]: Finished difference. Result has 61 places, 71 transitions, 201 flow [2020-10-16 00:01:32,983 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=201, PETRI_PLACES=61, PETRI_TRANSITIONS=71} [2020-10-16 00:01:32,983 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 2 predicate places. [2020-10-16 00:01:32,983 INFO L481 AbstractCegarLoop]: Abstraction has has 61 places, 71 transitions, 201 flow [2020-10-16 00:01:32,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 00:01:32,984 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:32,984 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:32,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 00:01:32,984 INFO L429 AbstractCegarLoop]: === Iteration 5 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:32,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:32,984 INFO L82 PathProgramCache]: Analyzing trace with hash -320433645, now seen corresponding path program 1 times [2020-10-16 00:01:32,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:32,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203993408] [2020-10-16 00:01:32,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:33,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:33,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203993408] [2020-10-16 00:01:33,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:33,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 00:01:33,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422965742] [2020-10-16 00:01:33,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 00:01:33,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:33,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 00:01:33,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 00:01:33,055 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 287 [2020-10-16 00:01:33,056 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 71 transitions, 201 flow. Second operand 6 states. [2020-10-16 00:01:33,057 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:33,057 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 287 [2020-10-16 00:01:33,057 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:33,438 INFO L129 PetriNetUnfolder]: 439/1092 cut-off events. [2020-10-16 00:01:33,438 INFO L130 PetriNetUnfolder]: For 181/181 co-relation queries the response was YES. [2020-10-16 00:01:33,442 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2257 conditions, 1092 events. 439/1092 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7466 event pairs, 12 based on Foata normal form. 8/1009 useless extension candidates. Maximal degree in co-relation 1871. Up to 295 conditions per place. [2020-10-16 00:01:33,450 INFO L132 encePairwiseOnDemand]: 270/287 looper letters, 73 selfloop transitions, 32 changer transitions 0/139 dead transitions. [2020-10-16 00:01:33,450 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 139 transitions, 623 flow [2020-10-16 00:01:33,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 00:01:33,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 00:01:33,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1675 transitions. [2020-10-16 00:01:33,455 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7295296167247387 [2020-10-16 00:01:33,455 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1675 transitions. [2020-10-16 00:01:33,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1675 transitions. [2020-10-16 00:01:33,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:33,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1675 transitions. [2020-10-16 00:01:33,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 00:01:33,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 00:01:33,464 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 00:01:33,464 INFO L185 Difference]: Start difference. First operand has 61 places, 71 transitions, 201 flow. Second operand 8 states and 1675 transitions. [2020-10-16 00:01:33,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 139 transitions, 623 flow [2020-10-16 00:01:33,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 139 transitions, 612 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 00:01:33,470 INFO L241 Difference]: Finished difference. Result has 73 places, 101 transitions, 470 flow [2020-10-16 00:01:33,470 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=470, PETRI_PLACES=73, PETRI_TRANSITIONS=101} [2020-10-16 00:01:33,470 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 14 predicate places. [2020-10-16 00:01:33,471 INFO L481 AbstractCegarLoop]: Abstraction has has 73 places, 101 transitions, 470 flow [2020-10-16 00:01:33,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 00:01:33,471 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:33,471 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:33,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 00:01:33,471 INFO L429 AbstractCegarLoop]: === Iteration 6 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:33,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:33,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1289256691, now seen corresponding path program 1 times [2020-10-16 00:01:33,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:33,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313953599] [2020-10-16 00:01:33,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:33,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313953599] [2020-10-16 00:01:33,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:33,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 00:01:33,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755809088] [2020-10-16 00:01:33,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 00:01:33,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:33,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 00:01:33,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 00:01:33,569 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 287 [2020-10-16 00:01:33,570 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 101 transitions, 470 flow. Second operand 7 states. [2020-10-16 00:01:33,570 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:33,570 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 287 [2020-10-16 00:01:33,571 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:35,310 INFO L129 PetriNetUnfolder]: 8669/12651 cut-off events. [2020-10-16 00:01:35,311 INFO L130 PetriNetUnfolder]: For 9079/9375 co-relation queries the response was YES. [2020-10-16 00:01:35,439 INFO L80 FinitePrefix]: Finished finitePrefix Result has 32605 conditions, 12651 events. 8669/12651 cut-off events. For 9079/9375 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 75569 event pairs, 1201 based on Foata normal form. 164/10019 useless extension candidates. Maximal degree in co-relation 26522. Up to 7795 conditions per place. [2020-10-16 00:01:35,519 INFO L132 encePairwiseOnDemand]: 273/287 looper letters, 162 selfloop transitions, 35 changer transitions 5/234 dead transitions. [2020-10-16 00:01:35,520 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 234 transitions, 1389 flow [2020-10-16 00:01:35,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 00:01:35,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 00:01:35,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1636 transitions. [2020-10-16 00:01:35,525 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.570034843205575 [2020-10-16 00:01:35,525 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1636 transitions. [2020-10-16 00:01:35,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1636 transitions. [2020-10-16 00:01:35,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:35,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1636 transitions. [2020-10-16 00:01:35,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 00:01:35,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 00:01:35,535 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 00:01:35,535 INFO L185 Difference]: Start difference. First operand has 73 places, 101 transitions, 470 flow. Second operand 10 states and 1636 transitions. [2020-10-16 00:01:35,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 234 transitions, 1389 flow [2020-10-16 00:01:35,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 234 transitions, 1365 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 00:01:35,617 INFO L241 Difference]: Finished difference. Result has 89 places, 133 transitions, 780 flow [2020-10-16 00:01:35,617 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=780, PETRI_PLACES=89, PETRI_TRANSITIONS=133} [2020-10-16 00:01:35,617 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 30 predicate places. [2020-10-16 00:01:35,618 INFO L481 AbstractCegarLoop]: Abstraction has has 89 places, 133 transitions, 780 flow [2020-10-16 00:01:35,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 00:01:35,618 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:35,618 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:35,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 00:01:35,618 INFO L429 AbstractCegarLoop]: === Iteration 7 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:35,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:35,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1774456098, now seen corresponding path program 1 times [2020-10-16 00:01:35,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:35,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871700737] [2020-10-16 00:01:35,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:35,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:35,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871700737] [2020-10-16 00:01:35,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:35,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 00:01:35,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514353659] [2020-10-16 00:01:35,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 00:01:35,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:35,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 00:01:35,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 00:01:35,684 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 287 [2020-10-16 00:01:35,685 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 133 transitions, 780 flow. Second operand 6 states. [2020-10-16 00:01:35,685 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:35,685 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 287 [2020-10-16 00:01:35,686 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:36,042 INFO L129 PetriNetUnfolder]: 654/1522 cut-off events. [2020-10-16 00:01:36,042 INFO L130 PetriNetUnfolder]: For 2627/2713 co-relation queries the response was YES. [2020-10-16 00:01:36,051 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4743 conditions, 1522 events. 654/1522 cut-off events. For 2627/2713 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10808 event pairs, 45 based on Foata normal form. 86/1501 useless extension candidates. Maximal degree in co-relation 4373. Up to 439 conditions per place. [2020-10-16 00:01:36,061 INFO L132 encePairwiseOnDemand]: 268/287 looper letters, 86 selfloop transitions, 50 changer transitions 0/186 dead transitions. [2020-10-16 00:01:36,062 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 186 transitions, 1368 flow [2020-10-16 00:01:36,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 00:01:36,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 00:01:36,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1669 transitions. [2020-10-16 00:01:36,066 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7269163763066202 [2020-10-16 00:01:36,067 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1669 transitions. [2020-10-16 00:01:36,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1669 transitions. [2020-10-16 00:01:36,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:36,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1669 transitions. [2020-10-16 00:01:36,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 00:01:36,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 00:01:36,076 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 00:01:36,076 INFO L185 Difference]: Start difference. First operand has 89 places, 133 transitions, 780 flow. Second operand 8 states and 1669 transitions. [2020-10-16 00:01:36,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 186 transitions, 1368 flow [2020-10-16 00:01:36,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 186 transitions, 1368 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-16 00:01:36,090 INFO L241 Difference]: Finished difference. Result has 101 places, 152 transitions, 1138 flow [2020-10-16 00:01:36,090 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1138, PETRI_PLACES=101, PETRI_TRANSITIONS=152} [2020-10-16 00:01:36,090 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 42 predicate places. [2020-10-16 00:01:36,091 INFO L481 AbstractCegarLoop]: Abstraction has has 101 places, 152 transitions, 1138 flow [2020-10-16 00:01:36,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 00:01:36,091 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:36,091 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:36,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 00:01:36,091 INFO L429 AbstractCegarLoop]: === Iteration 8 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:36,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:36,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1288877321, now seen corresponding path program 1 times [2020-10-16 00:01:36,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:36,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168172833] [2020-10-16 00:01:36,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:36,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168172833] [2020-10-16 00:01:36,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:36,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 00:01:36,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248418760] [2020-10-16 00:01:36,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 00:01:36,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:36,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 00:01:36,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 00:01:36,129 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 287 [2020-10-16 00:01:36,130 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 152 transitions, 1138 flow. Second operand 4 states. [2020-10-16 00:01:36,130 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:36,130 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 287 [2020-10-16 00:01:36,130 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:36,672 INFO L129 PetriNetUnfolder]: 1578/3545 cut-off events. [2020-10-16 00:01:36,672 INFO L130 PetriNetUnfolder]: For 8042/8468 co-relation queries the response was YES. [2020-10-16 00:01:36,697 INFO L80 FinitePrefix]: Finished finitePrefix Result has 11390 conditions, 3545 events. 1578/3545 cut-off events. For 8042/8468 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 29171 event pairs, 179 based on Foata normal form. 174/3355 useless extension candidates. Maximal degree in co-relation 9681. Up to 773 conditions per place. [2020-10-16 00:01:36,719 INFO L132 encePairwiseOnDemand]: 282/287 looper letters, 35 selfloop transitions, 9 changer transitions 0/172 dead transitions. [2020-10-16 00:01:36,719 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 172 transitions, 1312 flow [2020-10-16 00:01:36,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 00:01:36,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 00:01:36,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1117 transitions. [2020-10-16 00:01:36,723 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.778397212543554 [2020-10-16 00:01:36,723 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1117 transitions. [2020-10-16 00:01:36,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1117 transitions. [2020-10-16 00:01:36,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:36,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1117 transitions. [2020-10-16 00:01:36,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 00:01:36,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 00:01:36,728 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 00:01:36,729 INFO L185 Difference]: Start difference. First operand has 101 places, 152 transitions, 1138 flow. Second operand 5 states and 1117 transitions. [2020-10-16 00:01:36,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 172 transitions, 1312 flow [2020-10-16 00:01:36,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 172 transitions, 1284 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 00:01:36,765 INFO L241 Difference]: Finished difference. Result has 104 places, 153 transitions, 1148 flow [2020-10-16 00:01:36,766 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1148, PETRI_PLACES=104, PETRI_TRANSITIONS=153} [2020-10-16 00:01:36,766 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 45 predicate places. [2020-10-16 00:01:36,766 INFO L481 AbstractCegarLoop]: Abstraction has has 104 places, 153 transitions, 1148 flow [2020-10-16 00:01:36,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 00:01:36,766 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:36,766 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:36,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 00:01:36,767 INFO L429 AbstractCegarLoop]: === Iteration 9 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:36,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:36,767 INFO L82 PathProgramCache]: Analyzing trace with hash -44634027, now seen corresponding path program 1 times [2020-10-16 00:01:36,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:36,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401296929] [2020-10-16 00:01:36,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:36,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:36,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401296929] [2020-10-16 00:01:36,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:36,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 00:01:36,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765449179] [2020-10-16 00:01:36,808 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 00:01:36,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:36,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 00:01:36,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 00:01:36,810 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 287 [2020-10-16 00:01:36,811 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 153 transitions, 1148 flow. Second operand 3 states. [2020-10-16 00:01:36,811 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:36,811 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 287 [2020-10-16 00:01:36,811 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:36,977 INFO L129 PetriNetUnfolder]: 454/1433 cut-off events. [2020-10-16 00:01:36,977 INFO L130 PetriNetUnfolder]: For 2964/3113 co-relation queries the response was YES. [2020-10-16 00:01:36,988 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4079 conditions, 1433 events. 454/1433 cut-off events. For 2964/3113 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11971 event pairs, 31 based on Foata normal form. 35/1336 useless extension candidates. Maximal degree in co-relation 3551. Up to 337 conditions per place. [2020-10-16 00:01:36,995 INFO L132 encePairwiseOnDemand]: 285/287 looper letters, 13 selfloop transitions, 1 changer transitions 3/155 dead transitions. [2020-10-16 00:01:36,996 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 155 transitions, 1191 flow [2020-10-16 00:01:36,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 00:01:36,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 00:01:36,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 775 transitions. [2020-10-16 00:01:36,998 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.9001161440185831 [2020-10-16 00:01:36,998 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 775 transitions. [2020-10-16 00:01:36,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 775 transitions. [2020-10-16 00:01:36,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:36,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 775 transitions. [2020-10-16 00:01:37,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 00:01:37,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 00:01:37,002 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 00:01:37,003 INFO L185 Difference]: Start difference. First operand has 104 places, 153 transitions, 1148 flow. Second operand 3 states and 775 transitions. [2020-10-16 00:01:37,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 155 transitions, 1191 flow [2020-10-16 00:01:37,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 155 transitions, 1189 flow, removed 1 selfloop flow, removed 0 redundant places. [2020-10-16 00:01:37,018 INFO L241 Difference]: Finished difference. Result has 107 places, 150 transitions, 1118 flow [2020-10-16 00:01:37,019 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=1146, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1118, PETRI_PLACES=107, PETRI_TRANSITIONS=150} [2020-10-16 00:01:37,019 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 48 predicate places. [2020-10-16 00:01:37,019 INFO L481 AbstractCegarLoop]: Abstraction has has 107 places, 150 transitions, 1118 flow [2020-10-16 00:01:37,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 00:01:37,019 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:37,020 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:37,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 00:01:37,020 INFO L429 AbstractCegarLoop]: === Iteration 10 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:37,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:37,020 INFO L82 PathProgramCache]: Analyzing trace with hash -666768685, now seen corresponding path program 1 times [2020-10-16 00:01:37,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:37,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980010696] [2020-10-16 00:01:37,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:37,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980010696] [2020-10-16 00:01:37,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:37,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 00:01:37,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320640435] [2020-10-16 00:01:37,045 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 00:01:37,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:37,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 00:01:37,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 00:01:37,047 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 287 [2020-10-16 00:01:37,047 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 150 transitions, 1118 flow. Second operand 3 states. [2020-10-16 00:01:37,047 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:37,047 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 287 [2020-10-16 00:01:37,047 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:37,210 INFO L129 PetriNetUnfolder]: 476/1537 cut-off events. [2020-10-16 00:01:37,210 INFO L130 PetriNetUnfolder]: For 3120/3310 co-relation queries the response was YES. [2020-10-16 00:01:37,221 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4306 conditions, 1537 events. 476/1537 cut-off events. For 3120/3310 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13092 event pairs, 29 based on Foata normal form. 53/1454 useless extension candidates. Maximal degree in co-relation 3784. Up to 352 conditions per place. [2020-10-16 00:01:37,229 INFO L132 encePairwiseOnDemand]: 285/287 looper letters, 10 selfloop transitions, 1 changer transitions 0/152 dead transitions. [2020-10-16 00:01:37,229 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 152 transitions, 1154 flow [2020-10-16 00:01:37,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 00:01:37,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 00:01:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 775 transitions. [2020-10-16 00:01:37,233 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.9001161440185831 [2020-10-16 00:01:37,233 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 775 transitions. [2020-10-16 00:01:37,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 775 transitions. [2020-10-16 00:01:37,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:37,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 775 transitions. [2020-10-16 00:01:37,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 00:01:37,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 00:01:37,238 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 00:01:37,238 INFO L185 Difference]: Start difference. First operand has 107 places, 150 transitions, 1118 flow. Second operand 3 states and 775 transitions. [2020-10-16 00:01:37,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 152 transitions, 1154 flow [2020-10-16 00:01:37,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 152 transitions, 1153 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 00:01:37,256 INFO L241 Difference]: Finished difference. Result has 109 places, 150 transitions, 1122 flow [2020-10-16 00:01:37,256 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=1117, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1122, PETRI_PLACES=109, PETRI_TRANSITIONS=150} [2020-10-16 00:01:37,256 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 50 predicate places. [2020-10-16 00:01:37,257 INFO L481 AbstractCegarLoop]: Abstraction has has 109 places, 150 transitions, 1122 flow [2020-10-16 00:01:37,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 00:01:37,257 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:37,257 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:37,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 00:01:37,258 INFO L429 AbstractCegarLoop]: === Iteration 11 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:37,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:37,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1402844315, now seen corresponding path program 1 times [2020-10-16 00:01:37,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:37,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944417458] [2020-10-16 00:01:37,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:37,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:37,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944417458] [2020-10-16 00:01:37,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:37,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 00:01:37,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162554342] [2020-10-16 00:01:37,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 00:01:37,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:37,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 00:01:37,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 00:01:37,309 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 287 [2020-10-16 00:01:37,310 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 150 transitions, 1122 flow. Second operand 5 states. [2020-10-16 00:01:37,310 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:37,311 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 287 [2020-10-16 00:01:37,311 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:37,738 INFO L129 PetriNetUnfolder]: 914/2156 cut-off events. [2020-10-16 00:01:37,738 INFO L130 PetriNetUnfolder]: For 6435/6556 co-relation queries the response was YES. [2020-10-16 00:01:37,751 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7672 conditions, 2156 events. 914/2156 cut-off events. For 6435/6556 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 16900 event pairs, 151 based on Foata normal form. 55/2072 useless extension candidates. Maximal degree in co-relation 7155. Up to 1061 conditions per place. [2020-10-16 00:01:37,762 INFO L132 encePairwiseOnDemand]: 272/287 looper letters, 109 selfloop transitions, 23 changer transitions 0/180 dead transitions. [2020-10-16 00:01:37,762 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 180 transitions, 1623 flow [2020-10-16 00:01:37,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 00:01:37,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 00:01:37,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1242 transitions. [2020-10-16 00:01:37,766 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7212543554006968 [2020-10-16 00:01:37,766 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1242 transitions. [2020-10-16 00:01:37,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1242 transitions. [2020-10-16 00:01:37,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:37,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1242 transitions. [2020-10-16 00:01:37,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 00:01:37,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 00:01:37,773 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 00:01:37,773 INFO L185 Difference]: Start difference. First operand has 109 places, 150 transitions, 1122 flow. Second operand 6 states and 1242 transitions. [2020-10-16 00:01:37,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 180 transitions, 1623 flow [2020-10-16 00:01:37,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 180 transitions, 1610 flow, removed 6 selfloop flow, removed 2 redundant places. [2020-10-16 00:01:37,798 INFO L241 Difference]: Finished difference. Result has 114 places, 165 transitions, 1347 flow [2020-10-16 00:01:37,799 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=1073, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1347, PETRI_PLACES=114, PETRI_TRANSITIONS=165} [2020-10-16 00:01:37,799 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 55 predicate places. [2020-10-16 00:01:37,799 INFO L481 AbstractCegarLoop]: Abstraction has has 114 places, 165 transitions, 1347 flow [2020-10-16 00:01:37,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 00:01:37,799 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:37,799 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:37,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 00:01:37,800 INFO L429 AbstractCegarLoop]: === Iteration 12 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:37,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:37,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1432232024, now seen corresponding path program 1 times [2020-10-16 00:01:37,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:37,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284629736] [2020-10-16 00:01:37,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:37,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:37,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284629736] [2020-10-16 00:01:37,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:37,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 00:01:37,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975208925] [2020-10-16 00:01:37,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 00:01:37,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:37,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 00:01:37,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 00:01:37,846 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 287 [2020-10-16 00:01:37,847 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 165 transitions, 1347 flow. Second operand 5 states. [2020-10-16 00:01:37,847 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:37,847 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 287 [2020-10-16 00:01:37,847 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:38,296 INFO L129 PetriNetUnfolder]: 866/2605 cut-off events. [2020-10-16 00:01:38,296 INFO L130 PetriNetUnfolder]: For 7530/8219 co-relation queries the response was YES. [2020-10-16 00:01:38,318 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8184 conditions, 2605 events. 866/2605 cut-off events. For 7530/8219 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 24208 event pairs, 25 based on Foata normal form. 174/2618 useless extension candidates. Maximal degree in co-relation 7374. Up to 605 conditions per place. [2020-10-16 00:01:38,329 INFO L132 encePairwiseOnDemand]: 276/287 looper letters, 56 selfloop transitions, 61 changer transitions 0/212 dead transitions. [2020-10-16 00:01:38,329 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 212 transitions, 1896 flow [2020-10-16 00:01:38,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 00:01:38,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 00:01:38,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1668 transitions. [2020-10-16 00:01:38,334 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8302638128422101 [2020-10-16 00:01:38,334 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1668 transitions. [2020-10-16 00:01:38,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1668 transitions. [2020-10-16 00:01:38,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:38,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1668 transitions. [2020-10-16 00:01:38,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 00:01:38,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 00:01:38,343 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 00:01:38,343 INFO L185 Difference]: Start difference. First operand has 114 places, 165 transitions, 1347 flow. Second operand 7 states and 1668 transitions. [2020-10-16 00:01:38,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 212 transitions, 1896 flow [2020-10-16 00:01:38,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 212 transitions, 1869 flow, removed 10 selfloop flow, removed 1 redundant places. [2020-10-16 00:01:38,376 INFO L241 Difference]: Finished difference. Result has 124 places, 185 transitions, 1719 flow [2020-10-16 00:01:38,376 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=1320, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1719, PETRI_PLACES=124, PETRI_TRANSITIONS=185} [2020-10-16 00:01:38,377 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 65 predicate places. [2020-10-16 00:01:38,377 INFO L481 AbstractCegarLoop]: Abstraction has has 124 places, 185 transitions, 1719 flow [2020-10-16 00:01:38,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 00:01:38,377 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:38,377 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:38,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 00:01:38,377 INFO L429 AbstractCegarLoop]: === Iteration 13 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:38,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:38,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1432231094, now seen corresponding path program 1 times [2020-10-16 00:01:38,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:38,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040103373] [2020-10-16 00:01:38,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:38,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040103373] [2020-10-16 00:01:38,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:38,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 00:01:38,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735655696] [2020-10-16 00:01:38,424 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 00:01:38,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:38,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 00:01:38,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 00:01:38,426 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 287 [2020-10-16 00:01:38,426 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 185 transitions, 1719 flow. Second operand 3 states. [2020-10-16 00:01:38,426 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:38,427 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 287 [2020-10-16 00:01:38,427 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:38,928 INFO L129 PetriNetUnfolder]: 1295/3649 cut-off events. [2020-10-16 00:01:38,928 INFO L130 PetriNetUnfolder]: For 11101/11313 co-relation queries the response was YES. [2020-10-16 00:01:38,952 INFO L80 FinitePrefix]: Finished finitePrefix Result has 12008 conditions, 3649 events. 1295/3649 cut-off events. For 11101/11313 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 34662 event pairs, 102 based on Foata normal form. 87/3263 useless extension candidates. Maximal degree in co-relation 10949. Up to 636 conditions per place. [2020-10-16 00:01:38,968 INFO L132 encePairwiseOnDemand]: 285/287 looper letters, 32 selfloop transitions, 5 changer transitions 1/192 dead transitions. [2020-10-16 00:01:38,968 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 192 transitions, 1813 flow [2020-10-16 00:01:38,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 00:01:38,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 00:01:38,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 711 transitions. [2020-10-16 00:01:38,971 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8257839721254355 [2020-10-16 00:01:38,971 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 711 transitions. [2020-10-16 00:01:38,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 711 transitions. [2020-10-16 00:01:38,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:38,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 711 transitions. [2020-10-16 00:01:38,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 00:01:38,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 00:01:38,974 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 00:01:38,975 INFO L185 Difference]: Start difference. First operand has 124 places, 185 transitions, 1719 flow. Second operand 3 states and 711 transitions. [2020-10-16 00:01:38,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 192 transitions, 1813 flow [2020-10-16 00:01:39,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 192 transitions, 1813 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-16 00:01:39,041 INFO L241 Difference]: Finished difference. Result has 127 places, 184 transitions, 1728 flow [2020-10-16 00:01:39,042 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=1719, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1728, PETRI_PLACES=127, PETRI_TRANSITIONS=184} [2020-10-16 00:01:39,042 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 68 predicate places. [2020-10-16 00:01:39,042 INFO L481 AbstractCegarLoop]: Abstraction has has 127 places, 184 transitions, 1728 flow [2020-10-16 00:01:39,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 00:01:39,042 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:39,043 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:39,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 00:01:39,043 INFO L429 AbstractCegarLoop]: === Iteration 14 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:39,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:39,043 INFO L82 PathProgramCache]: Analyzing trace with hash -143971777, now seen corresponding path program 1 times [2020-10-16 00:01:39,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:39,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119872244] [2020-10-16 00:01:39,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:39,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119872244] [2020-10-16 00:01:39,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:39,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 00:01:39,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127404931] [2020-10-16 00:01:39,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 00:01:39,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:39,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 00:01:39,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 00:01:39,069 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 287 [2020-10-16 00:01:39,070 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 184 transitions, 1728 flow. Second operand 3 states. [2020-10-16 00:01:39,070 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:39,070 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 287 [2020-10-16 00:01:39,070 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:39,344 INFO L129 PetriNetUnfolder]: 945/2818 cut-off events. [2020-10-16 00:01:39,344 INFO L130 PetriNetUnfolder]: For 10396/10593 co-relation queries the response was YES. [2020-10-16 00:01:39,360 INFO L80 FinitePrefix]: Finished finitePrefix Result has 9629 conditions, 2818 events. 945/2818 cut-off events. For 10396/10593 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 26526 event pairs, 43 based on Foata normal form. 101/2619 useless extension candidates. Maximal degree in co-relation 8873. Up to 483 conditions per place. [2020-10-16 00:01:39,372 INFO L132 encePairwiseOnDemand]: 284/287 looper letters, 24 selfloop transitions, 6 changer transitions 0/170 dead transitions. [2020-10-16 00:01:39,372 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 170 transitions, 1649 flow [2020-10-16 00:01:39,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 00:01:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 00:01:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 707 transitions. [2020-10-16 00:01:39,375 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8211382113821138 [2020-10-16 00:01:39,375 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 707 transitions. [2020-10-16 00:01:39,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 707 transitions. [2020-10-16 00:01:39,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:39,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 707 transitions. [2020-10-16 00:01:39,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 00:01:39,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 00:01:39,378 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 00:01:39,378 INFO L185 Difference]: Start difference. First operand has 127 places, 184 transitions, 1728 flow. Second operand 3 states and 707 transitions. [2020-10-16 00:01:39,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 170 transitions, 1649 flow [2020-10-16 00:01:39,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 170 transitions, 1631 flow, removed 4 selfloop flow, removed 3 redundant places. [2020-10-16 00:01:39,440 INFO L241 Difference]: Finished difference. Result has 120 places, 164 transitions, 1565 flow [2020-10-16 00:01:39,440 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1565, PETRI_PLACES=120, PETRI_TRANSITIONS=164} [2020-10-16 00:01:39,441 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 61 predicate places. [2020-10-16 00:01:39,441 INFO L481 AbstractCegarLoop]: Abstraction has has 120 places, 164 transitions, 1565 flow [2020-10-16 00:01:39,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 00:01:39,441 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:39,441 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:39,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 00:01:39,441 INFO L429 AbstractCegarLoop]: === Iteration 15 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:39,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:39,442 INFO L82 PathProgramCache]: Analyzing trace with hash 48069103, now seen corresponding path program 1 times [2020-10-16 00:01:39,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:39,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590206675] [2020-10-16 00:01:39,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:39,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:39,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590206675] [2020-10-16 00:01:39,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:39,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 00:01:39,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423061368] [2020-10-16 00:01:39,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 00:01:39,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:39,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 00:01:39,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 00:01:39,492 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 287 [2020-10-16 00:01:39,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 164 transitions, 1565 flow. Second operand 5 states. [2020-10-16 00:01:39,493 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:39,493 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 287 [2020-10-16 00:01:39,493 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:39,771 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([968] L714-2-->L714-2: Formula: (and (= |v_qrcu_reader1Thread1of1ForFork1_#t~nondet8_60| 0) (= |v_qrcu_reader1Thread1of1ForFork1_#t~nondet9_91| 0) (= v_qrcu_reader1Thread1of1ForFork1_~myidx~0_112 v_~idx~0_111)) InVars {~idx~0=v_~idx~0_111, qrcu_reader1Thread1of1ForFork1_#t~nondet8=|v_qrcu_reader1Thread1of1ForFork1_#t~nondet8_60|, qrcu_reader1Thread1of1ForFork1_#t~nondet9=|v_qrcu_reader1Thread1of1ForFork1_#t~nondet9_91|} OutVars{~idx~0=v_~idx~0_111, qrcu_reader1Thread1of1ForFork1_#t~nondet8=|v_qrcu_reader1Thread1of1ForFork1_#t~nondet8_59|, qrcu_reader1Thread1of1ForFork1_#t~nondet9=|v_qrcu_reader1Thread1of1ForFork1_#t~nondet9_90|, qrcu_reader1Thread1of1ForFork1_~myidx~0=v_qrcu_reader1Thread1of1ForFork1_~myidx~0_112} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork1_#t~nondet8, qrcu_reader1Thread1of1ForFork1_#t~nondet9, qrcu_reader1Thread1of1ForFork1_~myidx~0][126], [Black: 183#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 65#L766true, Black: 186#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 258#(= ~readerprogress2~0 2), Black: 190#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 265#(<= qrcu_updaterThread1of1ForFork0_~sum~0 1), Black: 261#true, Black: 263#(and (= ~ctr2~0 0) (<= ~ctr1~0 1)), 210#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), 276#(= ~ctr2~0 0), 22#L775-2true, Black: 208#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 212#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 214#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 200#(and (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), Black: 274#true, 28#L714-2true, Black: 201#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 277#(= |qrcu_updaterThread1of1ForFork0_#t~post15| 0), Black: 204#(not (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 1)), Black: 278#(<= 1 ~ctr2~0), Black: 206#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), Black: 282#(and (= |qrcu_updaterThread1of1ForFork0_#t~post15| 0) (<= 1 ~ctr2~0)), 227#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 162#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), 296#(= ~idx~0 0), Black: 224#true, 45#L733-3true, Black: 229#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 304#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0)), Black: 233#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 235#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), 184#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 244#(= ~readerprogress2~0 0), Black: 245#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), Black: 253#(<= 2 ~readerprogress1~0)]) [2020-10-16 00:01:39,771 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2020-10-16 00:01:39,771 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2020-10-16 00:01:39,772 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2020-10-16 00:01:39,772 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2020-10-16 00:01:39,772 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([962] L714-2-->L717: Formula: (and (not (= |v_qrcu_reader1Thread1of1ForFork1_#t~nondet8_32| 0)) (<= 0 (+ |v_qrcu_reader1Thread1of1ForFork1_#t~nondet8_32| 2147483648)) (= v_qrcu_reader1Thread1of1ForFork1_~myidx~0_88 v_~idx~0_77) (<= |v_qrcu_reader1Thread1of1ForFork1_#t~nondet8_32| 2147483647)) InVars {~idx~0=v_~idx~0_77, qrcu_reader1Thread1of1ForFork1_#t~nondet8=|v_qrcu_reader1Thread1of1ForFork1_#t~nondet8_32|} OutVars{~idx~0=v_~idx~0_77, qrcu_reader1Thread1of1ForFork1_#t~nondet8=|v_qrcu_reader1Thread1of1ForFork1_#t~nondet8_31|, qrcu_reader1Thread1of1ForFork1_~myidx~0=v_qrcu_reader1Thread1of1ForFork1_~myidx~0_88} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork1_#t~nondet8, qrcu_reader1Thread1of1ForFork1_~myidx~0][127], [Black: 183#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 65#L766true, Black: 186#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 258#(= ~readerprogress2~0 2), Black: 190#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 265#(<= qrcu_updaterThread1of1ForFork0_~sum~0 1), Black: 261#true, Black: 263#(and (= ~ctr2~0 0) (<= ~ctr1~0 1)), 17#L717true, 210#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), 276#(= ~ctr2~0 0), 22#L775-2true, Black: 208#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 212#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 214#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 200#(and (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), Black: 274#true, Black: 201#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 277#(= |qrcu_updaterThread1of1ForFork0_#t~post15| 0), Black: 204#(not (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 1)), Black: 278#(<= 1 ~ctr2~0), Black: 206#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), Black: 282#(and (= |qrcu_updaterThread1of1ForFork0_#t~post15| 0) (<= 1 ~ctr2~0)), 227#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 162#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), 296#(= ~idx~0 0), Black: 224#true, 45#L733-3true, Black: 229#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 304#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0)), Black: 233#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 235#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), 184#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 244#(= ~readerprogress2~0 0), Black: 245#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), Black: 253#(<= 2 ~readerprogress1~0)]) [2020-10-16 00:01:39,772 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2020-10-16 00:01:39,772 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2020-10-16 00:01:39,772 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2020-10-16 00:01:39,772 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2020-10-16 00:01:39,773 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([967] L714-2-->L720-1: Formula: (and (= v_qrcu_reader1Thread1of1ForFork1_~myidx~0_111 v_~idx~0_110) (<= 0 (+ |v_qrcu_reader1Thread1of1ForFork1_#t~nondet9_89| 2147483648)) (= |v_qrcu_reader1Thread1of1ForFork1_#t~nondet8_58| 0) (<= |v_qrcu_reader1Thread1of1ForFork1_#t~nondet9_89| 2147483647)) InVars {~idx~0=v_~idx~0_110, qrcu_reader1Thread1of1ForFork1_#t~nondet8=|v_qrcu_reader1Thread1of1ForFork1_#t~nondet8_58|, qrcu_reader1Thread1of1ForFork1_#t~nondet9=|v_qrcu_reader1Thread1of1ForFork1_#t~nondet9_89|} OutVars{~idx~0=v_~idx~0_110, qrcu_reader1Thread1of1ForFork1_#t~nondet8=|v_qrcu_reader1Thread1of1ForFork1_#t~nondet8_57|, qrcu_reader1Thread1of1ForFork1_#t~nondet9=|v_qrcu_reader1Thread1of1ForFork1_#t~nondet9_89|, qrcu_reader1Thread1of1ForFork1_~myidx~0=v_qrcu_reader1Thread1of1ForFork1_~myidx~0_111} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork1_#t~nondet8, qrcu_reader1Thread1of1ForFork1_~myidx~0][128], [Black: 183#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 65#L766true, Black: 186#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 258#(= ~readerprogress2~0 2), Black: 190#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 7#L720-1true, 265#(<= qrcu_updaterThread1of1ForFork0_~sum~0 1), Black: 261#true, Black: 263#(and (= ~ctr2~0 0) (<= ~ctr1~0 1)), 210#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), 276#(= ~ctr2~0 0), 22#L775-2true, Black: 208#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 212#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 214#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 200#(and (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), Black: 274#true, Black: 201#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 277#(= |qrcu_updaterThread1of1ForFork0_#t~post15| 0), Black: 204#(not (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 1)), Black: 278#(<= 1 ~ctr2~0), Black: 206#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), Black: 282#(and (= |qrcu_updaterThread1of1ForFork0_#t~post15| 0) (<= 1 ~ctr2~0)), 227#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 162#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), 296#(= ~idx~0 0), Black: 224#true, 45#L733-3true, Black: 229#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 233#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 304#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0)), Black: 235#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), 184#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 244#(= ~readerprogress2~0 0), Black: 245#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), Black: 253#(<= 2 ~readerprogress1~0)]) [2020-10-16 00:01:39,773 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2020-10-16 00:01:39,773 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2020-10-16 00:01:39,773 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2020-10-16 00:01:39,773 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2020-10-16 00:01:40,124 INFO L129 PetriNetUnfolder]: 1979/4675 cut-off events. [2020-10-16 00:01:40,125 INFO L130 PetriNetUnfolder]: For 18383/18755 co-relation queries the response was YES. [2020-10-16 00:01:40,145 INFO L80 FinitePrefix]: Finished finitePrefix Result has 17177 conditions, 4675 events. 1979/4675 cut-off events. For 18383/18755 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 41609 event pairs, 89 based on Foata normal form. 122/4047 useless extension candidates. Maximal degree in co-relation 16366. Up to 1167 conditions per place. [2020-10-16 00:01:40,155 INFO L132 encePairwiseOnDemand]: 280/287 looper letters, 110 selfloop transitions, 19 changer transitions 28/224 dead transitions. [2020-10-16 00:01:40,155 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 224 transitions, 2416 flow [2020-10-16 00:01:40,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 00:01:40,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 00:01:40,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 839 transitions. [2020-10-16 00:01:40,158 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.730836236933798 [2020-10-16 00:01:40,158 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 839 transitions. [2020-10-16 00:01:40,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 839 transitions. [2020-10-16 00:01:40,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:40,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 839 transitions. [2020-10-16 00:01:40,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 00:01:40,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 00:01:40,162 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 00:01:40,162 INFO L185 Difference]: Start difference. First operand has 120 places, 164 transitions, 1565 flow. Second operand 4 states and 839 transitions. [2020-10-16 00:01:40,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 224 transitions, 2416 flow [2020-10-16 00:01:40,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 224 transitions, 2404 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 00:01:40,265 INFO L241 Difference]: Finished difference. Result has 123 places, 162 transitions, 1560 flow [2020-10-16 00:01:40,266 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1560, PETRI_PLACES=123, PETRI_TRANSITIONS=162} [2020-10-16 00:01:40,266 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 64 predicate places. [2020-10-16 00:01:40,266 INFO L481 AbstractCegarLoop]: Abstraction has has 123 places, 162 transitions, 1560 flow [2020-10-16 00:01:40,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 00:01:40,266 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:40,266 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:40,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 00:01:40,267 INFO L429 AbstractCegarLoop]: === Iteration 16 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:40,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:40,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1695312275, now seen corresponding path program 1 times [2020-10-16 00:01:40,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:40,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133312852] [2020-10-16 00:01:40,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:40,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:40,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133312852] [2020-10-16 00:01:40,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:40,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 00:01:40,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697899598] [2020-10-16 00:01:40,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 00:01:40,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:40,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 00:01:40,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-16 00:01:40,368 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 287 [2020-10-16 00:01:40,369 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 162 transitions, 1560 flow. Second operand 9 states. [2020-10-16 00:01:40,369 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:40,369 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 287 [2020-10-16 00:01:40,369 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:41,779 INFO L129 PetriNetUnfolder]: 3206/6446 cut-off events. [2020-10-16 00:01:41,779 INFO L130 PetriNetUnfolder]: For 28620/29072 co-relation queries the response was YES. [2020-10-16 00:01:41,804 INFO L80 FinitePrefix]: Finished finitePrefix Result has 26461 conditions, 6446 events. 3206/6446 cut-off events. For 28620/29072 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 53207 event pairs, 197 based on Foata normal form. 316/5667 useless extension candidates. Maximal degree in co-relation 25906. Up to 1255 conditions per place. [2020-10-16 00:01:41,819 INFO L132 encePairwiseOnDemand]: 266/287 looper letters, 231 selfloop transitions, 156 changer transitions 50/466 dead transitions. [2020-10-16 00:01:41,819 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 466 transitions, 5363 flow [2020-10-16 00:01:41,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 00:01:41,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-16 00:01:41,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2496 transitions. [2020-10-16 00:01:41,826 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6212045793927327 [2020-10-16 00:01:41,827 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2496 transitions. [2020-10-16 00:01:41,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2496 transitions. [2020-10-16 00:01:41,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:41,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2496 transitions. [2020-10-16 00:01:41,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-16 00:01:41,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-16 00:01:41,837 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-16 00:01:41,837 INFO L185 Difference]: Start difference. First operand has 123 places, 162 transitions, 1560 flow. Second operand 14 states and 2496 transitions. [2020-10-16 00:01:41,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 466 transitions, 5363 flow [2020-10-16 00:01:41,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 466 transitions, 5317 flow, removed 7 selfloop flow, removed 1 redundant places. [2020-10-16 00:01:41,965 INFO L241 Difference]: Finished difference. Result has 147 places, 283 transitions, 3765 flow [2020-10-16 00:01:41,965 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=1530, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3765, PETRI_PLACES=147, PETRI_TRANSITIONS=283} [2020-10-16 00:01:41,965 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 88 predicate places. [2020-10-16 00:01:41,965 INFO L481 AbstractCegarLoop]: Abstraction has has 147 places, 283 transitions, 3765 flow [2020-10-16 00:01:41,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 00:01:41,966 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:41,966 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:41,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 00:01:41,966 INFO L429 AbstractCegarLoop]: === Iteration 17 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:41,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:41,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1415704144, now seen corresponding path program 1 times [2020-10-16 00:01:41,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:41,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617857675] [2020-10-16 00:01:41,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:42,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:42,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617857675] [2020-10-16 00:01:42,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:42,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 00:01:42,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579665199] [2020-10-16 00:01:42,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 00:01:42,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:42,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 00:01:42,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-16 00:01:42,048 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 287 [2020-10-16 00:01:42,049 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 283 transitions, 3765 flow. Second operand 9 states. [2020-10-16 00:01:42,049 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:42,049 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 287 [2020-10-16 00:01:42,049 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:43,485 INFO L129 PetriNetUnfolder]: 3446/7140 cut-off events. [2020-10-16 00:01:43,485 INFO L130 PetriNetUnfolder]: For 54977/56008 co-relation queries the response was YES. [2020-10-16 00:01:43,532 INFO L80 FinitePrefix]: Finished finitePrefix Result has 35166 conditions, 7140 events. 3446/7140 cut-off events. For 54977/56008 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 60825 event pairs, 393 based on Foata normal form. 629/6577 useless extension candidates. Maximal degree in co-relation 34546. Up to 1485 conditions per place. [2020-10-16 00:01:43,558 INFO L132 encePairwiseOnDemand]: 267/287 looper letters, 237 selfloop transitions, 208 changer transitions 26/498 dead transitions. [2020-10-16 00:01:43,559 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 498 transitions, 7086 flow [2020-10-16 00:01:43,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 00:01:43,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-16 00:01:43,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2489 transitions. [2020-10-16 00:01:43,566 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.619462419113987 [2020-10-16 00:01:43,566 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2489 transitions. [2020-10-16 00:01:43,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2489 transitions. [2020-10-16 00:01:43,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:43,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2489 transitions. [2020-10-16 00:01:43,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-16 00:01:43,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-16 00:01:43,710 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-16 00:01:43,710 INFO L185 Difference]: Start difference. First operand has 147 places, 283 transitions, 3765 flow. Second operand 14 states and 2489 transitions. [2020-10-16 00:01:43,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 498 transitions, 7086 flow [2020-10-16 00:01:44,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 498 transitions, 6988 flow, removed 49 selfloop flow, removed 0 redundant places. [2020-10-16 00:01:44,022 INFO L241 Difference]: Finished difference. Result has 169 places, 367 transitions, 5725 flow [2020-10-16 00:01:44,022 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=3701, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5725, PETRI_PLACES=169, PETRI_TRANSITIONS=367} [2020-10-16 00:01:44,022 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 110 predicate places. [2020-10-16 00:01:44,022 INFO L481 AbstractCegarLoop]: Abstraction has has 169 places, 367 transitions, 5725 flow [2020-10-16 00:01:44,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 00:01:44,023 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:44,023 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:44,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 00:01:44,023 INFO L429 AbstractCegarLoop]: === Iteration 18 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:44,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:44,023 INFO L82 PathProgramCache]: Analyzing trace with hash 186710604, now seen corresponding path program 2 times [2020-10-16 00:01:44,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:44,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330414879] [2020-10-16 00:01:44,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:44,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:44,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330414879] [2020-10-16 00:01:44,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:44,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 00:01:44,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816267242] [2020-10-16 00:01:44,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 00:01:44,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:44,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 00:01:44,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-16 00:01:44,119 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 287 [2020-10-16 00:01:44,121 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 367 transitions, 5725 flow. Second operand 9 states. [2020-10-16 00:01:44,121 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:44,121 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 287 [2020-10-16 00:01:44,121 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:45,685 INFO L129 PetriNetUnfolder]: 3374/6945 cut-off events. [2020-10-16 00:01:45,686 INFO L130 PetriNetUnfolder]: For 72908/73842 co-relation queries the response was YES. [2020-10-16 00:01:45,732 INFO L80 FinitePrefix]: Finished finitePrefix Result has 38504 conditions, 6945 events. 3374/6945 cut-off events. For 72908/73842 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 58617 event pairs, 163 based on Foata normal form. 617/6384 useless extension candidates. Maximal degree in co-relation 38277. Up to 1062 conditions per place. [2020-10-16 00:01:45,754 INFO L132 encePairwiseOnDemand]: 267/287 looper letters, 265 selfloop transitions, 253 changer transitions 68/612 dead transitions. [2020-10-16 00:01:45,755 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 612 transitions, 10012 flow [2020-10-16 00:01:45,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-16 00:01:45,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-16 00:01:45,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2841 transitions. [2020-10-16 00:01:45,765 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.618684668989547 [2020-10-16 00:01:45,765 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2841 transitions. [2020-10-16 00:01:45,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2841 transitions. [2020-10-16 00:01:45,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:45,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2841 transitions. [2020-10-16 00:01:45,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-16 00:01:45,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-16 00:01:45,776 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-16 00:01:45,776 INFO L185 Difference]: Start difference. First operand has 169 places, 367 transitions, 5725 flow. Second operand 16 states and 2841 transitions. [2020-10-16 00:01:45,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 612 transitions, 10012 flow [2020-10-16 00:01:47,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 612 transitions, 9879 flow, removed 12 selfloop flow, removed 3 redundant places. [2020-10-16 00:01:47,193 INFO L241 Difference]: Finished difference. Result has 187 places, 407 transitions, 7200 flow [2020-10-16 00:01:47,193 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=5615, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=199, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=7200, PETRI_PLACES=187, PETRI_TRANSITIONS=407} [2020-10-16 00:01:47,193 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 128 predicate places. [2020-10-16 00:01:47,193 INFO L481 AbstractCegarLoop]: Abstraction has has 187 places, 407 transitions, 7200 flow [2020-10-16 00:01:47,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 00:01:47,193 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:47,193 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:47,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 00:01:47,194 INFO L429 AbstractCegarLoop]: === Iteration 19 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:47,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:47,194 INFO L82 PathProgramCache]: Analyzing trace with hash 2044254892, now seen corresponding path program 1 times [2020-10-16 00:01:47,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:47,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013776101] [2020-10-16 00:01:47,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:47,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:47,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013776101] [2020-10-16 00:01:47,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:47,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 00:01:47,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217955865] [2020-10-16 00:01:47,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 00:01:47,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:47,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 00:01:47,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 00:01:47,256 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 287 [2020-10-16 00:01:47,257 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 407 transitions, 7200 flow. Second operand 5 states. [2020-10-16 00:01:47,257 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:47,257 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 287 [2020-10-16 00:01:47,258 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:48,748 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([939] L763-2-->L766: Formula: (and (= |v_qrcu_updaterThread1of1ForFork0_#t~mem19_13| (select (select |v_#memory_int_87| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|)) (not (< 0 v_~ctr2~0_267)) (= |v_#pthreadsMutex_35| (store |v_#pthreadsMutex_36| |v_~#mutex~0.base_29| (store (select |v_#pthreadsMutex_36| |v_~#mutex~0.base_29|) |v_~#mutex~0.offset_29| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_36|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|, ~#mutex~0.base=|v_~#mutex~0.base_29|, #memory_int=|v_#memory_int_87|, ~#mutex~0.offset=|v_~#mutex~0.offset_29|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|, ~ctr2~0=v_~ctr2~0_267} OutVars{#pthreadsMutex=|v_#pthreadsMutex_35|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|, ~#mutex~0.base=|v_~#mutex~0.base_29|, #memory_int=|v_#memory_int_87|, ~#mutex~0.offset=|v_~#mutex~0.offset_29|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|, qrcu_updaterThread1of1ForFork0_#t~mem19=|v_qrcu_updaterThread1of1ForFork0_#t~mem19_13|, ~ctr2~0=v_~ctr2~0_267} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork0_#t~mem19][424], [258#(= ~readerprogress2~0 2), 261#true, 391#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 263#(and (= ~ctr2~0 0) (<= ~ctr1~0 1)), Black: 265#(<= qrcu_updaterThread1of1ForFork0_~sum~0 1), 274#true, 22#L775-2true, Black: 276#(= ~ctr2~0 0), Black: 277#(= |qrcu_updaterThread1of1ForFork0_#t~post15| 0), Black: 278#(<= 1 ~ctr2~0), Black: 405#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 390#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 282#(and (= |qrcu_updaterThread1of1ForFork0_#t~post15| 0) (<= 1 ~ctr2~0)), 162#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 407#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 409#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 291#(= ~idx~0 1), Black: 395#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 160#true, Black: 397#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 383#true, Black: 168#(= ~readerprogress1~0 0), Black: 173#(= ~readerprogress2~0 0), 433#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 304#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0)), Black: 300#(and (= ~ctr2~0 0) (= ~idx~0 0)), Black: 178#(= ~ctr2~0 0), 186#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 316#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 183#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 184#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 65#L766true, Black: 190#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 198#true, Black: 320#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 322#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 324#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 308#true, Black: 326#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 310#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 328#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 330#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 315#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 208#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 210#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 334#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 318#(and (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 200#(and (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), Black: 201#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 93#qrcu_reader1EXITtrue, Black: 204#(not (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 1)), Black: 206#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), 356#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 224#true, Black: 227#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 112#qrcu_reader2EXITtrue, Black: 233#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 235#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 245#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), Black: 368#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 355#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 244#(= ~readerprogress2~0 0), Black: 358#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 362#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 348#true, Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 366#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), 253#(<= 2 ~readerprogress1~0), Black: 351#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0))]) [2020-10-16 00:01:48,748 INFO L384 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2020-10-16 00:01:48,748 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2020-10-16 00:01:48,748 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2020-10-16 00:01:48,749 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2020-10-16 00:01:48,749 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([837] L763-2-->L763-2: Formula: (< 0 v_~ctr2~0_13) InVars {~ctr2~0=v_~ctr2~0_13} OutVars{~ctr2~0=v_~ctr2~0_13} AuxVars[] AssignedVars[][421], [258#(= ~readerprogress2~0 2), 261#true, 391#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 263#(and (= ~ctr2~0 0) (<= ~ctr1~0 1)), Black: 265#(<= qrcu_updaterThread1of1ForFork0_~sum~0 1), 278#(<= 1 ~ctr2~0), 22#L775-2true, Black: 274#true, Black: 276#(= ~ctr2~0 0), Black: 277#(= |qrcu_updaterThread1of1ForFork0_#t~post15| 0), Black: 405#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 390#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 282#(and (= |qrcu_updaterThread1of1ForFork0_#t~post15| 0) (<= 1 ~ctr2~0)), 162#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 407#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 409#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 291#(= ~idx~0 1), Black: 395#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 160#true, Black: 397#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 383#true, Black: 168#(= ~readerprogress1~0 0), 426#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0), Black: 173#(= ~readerprogress2~0 0), Black: 304#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0)), Black: 300#(and (= ~ctr2~0 0) (= ~idx~0 0)), Black: 178#(= ~ctr2~0 0), 186#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 316#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 183#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 184#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 190#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 198#true, 78#L763-2true, Black: 320#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 322#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 324#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 308#true, Black: 326#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 310#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 328#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 330#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 315#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 208#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 210#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 334#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 318#(and (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 200#(and (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), 93#qrcu_reader1EXITtrue, Black: 201#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 204#(not (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 1)), Black: 206#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), 356#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 224#true, Black: 227#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 233#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 112#qrcu_reader2EXITtrue, Black: 235#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 245#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), Black: 368#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 355#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 244#(= ~readerprogress2~0 0), Black: 358#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 362#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 348#true, Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 366#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), 253#(<= 2 ~readerprogress1~0), Black: 351#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0))]) [2020-10-16 00:01:48,749 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is not cut-off event [2020-10-16 00:01:48,749 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2020-10-16 00:01:48,749 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2020-10-16 00:01:48,749 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2020-10-16 00:01:48,750 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([939] L763-2-->L766: Formula: (and (= |v_qrcu_updaterThread1of1ForFork0_#t~mem19_13| (select (select |v_#memory_int_87| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|)) (not (< 0 v_~ctr2~0_267)) (= |v_#pthreadsMutex_35| (store |v_#pthreadsMutex_36| |v_~#mutex~0.base_29| (store (select |v_#pthreadsMutex_36| |v_~#mutex~0.base_29|) |v_~#mutex~0.offset_29| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_36|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|, ~#mutex~0.base=|v_~#mutex~0.base_29|, #memory_int=|v_#memory_int_87|, ~#mutex~0.offset=|v_~#mutex~0.offset_29|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|, ~ctr2~0=v_~ctr2~0_267} OutVars{#pthreadsMutex=|v_#pthreadsMutex_35|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|, ~#mutex~0.base=|v_~#mutex~0.base_29|, #memory_int=|v_#memory_int_87|, ~#mutex~0.offset=|v_~#mutex~0.offset_29|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|, qrcu_updaterThread1of1ForFork0_#t~mem19=|v_qrcu_updaterThread1of1ForFork0_#t~mem19_13|, ~ctr2~0=v_~ctr2~0_267} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork0_#t~mem19][424], [258#(= ~readerprogress2~0 2), 261#true, 391#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 263#(and (= ~ctr2~0 0) (<= ~ctr1~0 1)), Black: 265#(<= qrcu_updaterThread1of1ForFork0_~sum~0 1), 274#true, 22#L775-2true, Black: 276#(= ~ctr2~0 0), Black: 277#(= |qrcu_updaterThread1of1ForFork0_#t~post15| 0), Black: 278#(<= 1 ~ctr2~0), Black: 405#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 390#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 282#(and (= |qrcu_updaterThread1of1ForFork0_#t~post15| 0) (<= 1 ~ctr2~0)), Black: 407#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 162#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 409#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 291#(= ~idx~0 1), Black: 395#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 160#true, Black: 397#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 383#true, Black: 168#(= ~readerprogress1~0 0), Black: 173#(= ~readerprogress2~0 0), 433#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 304#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0)), Black: 300#(and (= ~ctr2~0 0) (= ~idx~0 0)), Black: 178#(= ~ctr2~0 0), 186#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 316#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 183#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 65#L766true, Black: 184#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 190#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 198#true, Black: 320#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 322#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 324#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 308#true, Black: 326#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 310#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 328#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 330#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 315#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 208#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 210#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 334#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 318#(and (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 200#(and (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), Black: 201#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 93#qrcu_reader1EXITtrue, Black: 204#(not (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 1)), Black: 206#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), 356#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 224#true, Black: 227#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 233#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 112#qrcu_reader2EXITtrue, Black: 235#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 242#true, Black: 368#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 355#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 244#(= ~readerprogress2~0 0), Black: 358#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 362#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 245#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), Black: 348#true, Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 366#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), 253#(<= 2 ~readerprogress1~0), Black: 351#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0))]) [2020-10-16 00:01:48,750 INFO L384 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2020-10-16 00:01:48,750 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2020-10-16 00:01:48,750 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2020-10-16 00:01:48,750 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2020-10-16 00:01:48,750 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([837] L763-2-->L763-2: Formula: (< 0 v_~ctr2~0_13) InVars {~ctr2~0=v_~ctr2~0_13} OutVars{~ctr2~0=v_~ctr2~0_13} AuxVars[] AssignedVars[][421], [258#(= ~readerprogress2~0 2), 261#true, 391#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 263#(and (= ~ctr2~0 0) (<= ~ctr1~0 1)), Black: 265#(<= qrcu_updaterThread1of1ForFork0_~sum~0 1), 22#L775-2true, 278#(<= 1 ~ctr2~0), Black: 274#true, Black: 276#(= ~ctr2~0 0), Black: 277#(= |qrcu_updaterThread1of1ForFork0_#t~post15| 0), Black: 405#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 390#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 282#(and (= |qrcu_updaterThread1of1ForFork0_#t~post15| 0) (<= 1 ~ctr2~0)), Black: 407#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 162#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 409#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 291#(= ~idx~0 1), Black: 395#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 160#true, Black: 397#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 383#true, Black: 168#(= ~readerprogress1~0 0), 426#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0), Black: 173#(= ~readerprogress2~0 0), Black: 304#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0)), Black: 300#(and (= ~ctr2~0 0) (= ~idx~0 0)), Black: 178#(= ~ctr2~0 0), 186#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 316#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 183#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 184#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 190#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 198#true, 78#L763-2true, Black: 320#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 322#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 324#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 308#true, Black: 326#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 310#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 328#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 330#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 315#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 208#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 210#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 334#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 318#(and (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 200#(and (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), 93#qrcu_reader1EXITtrue, Black: 201#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 204#(not (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 1)), Black: 206#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), 356#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 224#true, Black: 227#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 233#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 112#qrcu_reader2EXITtrue, Black: 235#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 242#true, Black: 368#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 355#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 244#(= ~readerprogress2~0 0), Black: 358#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 362#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 245#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), Black: 348#true, Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 366#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), 253#(<= 2 ~readerprogress1~0), Black: 351#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0))]) [2020-10-16 00:01:48,750 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is not cut-off event [2020-10-16 00:01:48,751 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2020-10-16 00:01:48,751 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2020-10-16 00:01:48,751 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2020-10-16 00:01:48,768 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([939] L763-2-->L766: Formula: (and (= |v_qrcu_updaterThread1of1ForFork0_#t~mem19_13| (select (select |v_#memory_int_87| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|)) (not (< 0 v_~ctr2~0_267)) (= |v_#pthreadsMutex_35| (store |v_#pthreadsMutex_36| |v_~#mutex~0.base_29| (store (select |v_#pthreadsMutex_36| |v_~#mutex~0.base_29|) |v_~#mutex~0.offset_29| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_36|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|, ~#mutex~0.base=|v_~#mutex~0.base_29|, #memory_int=|v_#memory_int_87|, ~#mutex~0.offset=|v_~#mutex~0.offset_29|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|, ~ctr2~0=v_~ctr2~0_267} OutVars{#pthreadsMutex=|v_#pthreadsMutex_35|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|, ~#mutex~0.base=|v_~#mutex~0.base_29|, #memory_int=|v_#memory_int_87|, ~#mutex~0.offset=|v_~#mutex~0.offset_29|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|, qrcu_updaterThread1of1ForFork0_#t~mem19=|v_qrcu_updaterThread1of1ForFork0_#t~mem19_13|, ~ctr2~0=v_~ctr2~0_267} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork0_#t~mem19][424], [258#(= ~readerprogress2~0 2), 261#true, 391#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 263#(and (= ~ctr2~0 0) (<= ~ctr1~0 1)), Black: 265#(<= qrcu_updaterThread1of1ForFork0_~sum~0 1), 274#true, Black: 276#(= ~ctr2~0 0), Black: 277#(= |qrcu_updaterThread1of1ForFork0_#t~post15| 0), Black: 405#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 278#(<= 1 ~ctr2~0), Black: 282#(and (= |qrcu_updaterThread1of1ForFork0_#t~post15| 0) (<= 1 ~ctr2~0)), Black: 390#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 407#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 162#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 409#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 291#(= ~idx~0 1), Black: 395#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 160#true, Black: 397#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 383#true, Black: 168#(= ~readerprogress1~0 0), Black: 173#(= ~readerprogress2~0 0), 433#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 304#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0)), Black: 300#(and (= ~ctr2~0 0) (= ~idx~0 0)), Black: 178#(= ~ctr2~0 0), 186#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 316#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 183#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 65#L766true, Black: 184#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 190#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 198#true, Black: 320#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 322#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 324#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 308#true, Black: 326#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 310#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 328#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 330#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 315#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 208#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 210#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 334#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 318#(and (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 200#(and (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), Black: 201#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 93#qrcu_reader1EXITtrue, Black: 204#(not (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 1)), Black: 206#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), 356#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 224#true, Black: 227#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 233#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 112#qrcu_reader2EXITtrue, Black: 235#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 116#L776-1true, 245#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), Black: 368#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 355#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 358#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 244#(= ~readerprogress2~0 0), Black: 362#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 348#true, Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 253#(<= 2 ~readerprogress1~0), Black: 366#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 351#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0))]) [2020-10-16 00:01:48,769 INFO L384 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2020-10-16 00:01:48,769 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2020-10-16 00:01:48,769 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2020-10-16 00:01:48,769 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2020-10-16 00:01:48,769 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([837] L763-2-->L763-2: Formula: (< 0 v_~ctr2~0_13) InVars {~ctr2~0=v_~ctr2~0_13} OutVars{~ctr2~0=v_~ctr2~0_13} AuxVars[] AssignedVars[][421], [258#(= ~readerprogress2~0 2), 261#true, 391#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 263#(and (= ~ctr2~0 0) (<= ~ctr1~0 1)), Black: 265#(<= qrcu_updaterThread1of1ForFork0_~sum~0 1), 278#(<= 1 ~ctr2~0), Black: 274#true, Black: 276#(= ~ctr2~0 0), Black: 277#(= |qrcu_updaterThread1of1ForFork0_#t~post15| 0), Black: 405#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 390#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 282#(and (= |qrcu_updaterThread1of1ForFork0_#t~post15| 0) (<= 1 ~ctr2~0)), Black: 407#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 162#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 409#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 291#(= ~idx~0 1), Black: 395#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 160#true, Black: 397#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 383#true, 426#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0), Black: 168#(= ~readerprogress1~0 0), Black: 173#(= ~readerprogress2~0 0), Black: 304#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0)), Black: 300#(and (= ~ctr2~0 0) (= ~idx~0 0)), Black: 178#(= ~ctr2~0 0), 186#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 316#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 183#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 184#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 190#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 198#true, 78#L763-2true, Black: 320#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 322#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 324#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 308#true, Black: 326#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 310#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 328#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 330#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 315#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 208#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 210#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 334#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 318#(and (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 200#(and (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), 93#qrcu_reader1EXITtrue, Black: 201#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 204#(not (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 1)), Black: 206#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), 356#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 224#true, Black: 227#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 233#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 112#qrcu_reader2EXITtrue, Black: 235#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 116#L776-1true, 245#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), Black: 368#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 355#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 358#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 244#(= ~readerprogress2~0 0), Black: 362#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 348#true, Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 253#(<= 2 ~readerprogress1~0), Black: 366#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 351#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0))]) [2020-10-16 00:01:48,770 INFO L384 tUnfolder$Statistics]: this new event has 30 ancestors and is not cut-off event [2020-10-16 00:01:48,770 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2020-10-16 00:01:48,770 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2020-10-16 00:01:48,770 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2020-10-16 00:01:48,771 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([939] L763-2-->L766: Formula: (and (= |v_qrcu_updaterThread1of1ForFork0_#t~mem19_13| (select (select |v_#memory_int_87| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|)) (not (< 0 v_~ctr2~0_267)) (= |v_#pthreadsMutex_35| (store |v_#pthreadsMutex_36| |v_~#mutex~0.base_29| (store (select |v_#pthreadsMutex_36| |v_~#mutex~0.base_29|) |v_~#mutex~0.offset_29| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_36|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|, ~#mutex~0.base=|v_~#mutex~0.base_29|, #memory_int=|v_#memory_int_87|, ~#mutex~0.offset=|v_~#mutex~0.offset_29|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|, ~ctr2~0=v_~ctr2~0_267} OutVars{#pthreadsMutex=|v_#pthreadsMutex_35|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|, ~#mutex~0.base=|v_~#mutex~0.base_29|, #memory_int=|v_#memory_int_87|, ~#mutex~0.offset=|v_~#mutex~0.offset_29|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|, qrcu_updaterThread1of1ForFork0_#t~mem19=|v_qrcu_updaterThread1of1ForFork0_#t~mem19_13|, ~ctr2~0=v_~ctr2~0_267} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork0_#t~mem19][424], [258#(= ~readerprogress2~0 2), 261#true, 391#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 263#(and (= ~ctr2~0 0) (<= ~ctr1~0 1)), Black: 265#(<= qrcu_updaterThread1of1ForFork0_~sum~0 1), 274#true, Black: 276#(= ~ctr2~0 0), Black: 277#(= |qrcu_updaterThread1of1ForFork0_#t~post15| 0), Black: 405#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 278#(<= 1 ~ctr2~0), Black: 390#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 282#(and (= |qrcu_updaterThread1of1ForFork0_#t~post15| 0) (<= 1 ~ctr2~0)), Black: 407#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 162#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 409#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 291#(= ~idx~0 1), Black: 395#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 160#true, Black: 397#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 383#true, Black: 168#(= ~readerprogress1~0 0), Black: 173#(= ~readerprogress2~0 0), 433#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), 49#L777-1true, Black: 304#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0)), Black: 300#(and (= ~ctr2~0 0) (= ~idx~0 0)), Black: 178#(= ~ctr2~0 0), 186#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 316#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 183#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 65#L766true, Black: 184#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 190#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 198#true, Black: 320#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 322#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 324#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 308#true, Black: 326#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 310#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 328#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 330#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 315#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 208#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 210#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 334#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 318#(and (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 200#(and (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), Black: 201#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 204#(not (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 1)), Black: 206#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), 356#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 224#true, Black: 227#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 233#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 112#qrcu_reader2EXITtrue, Black: 235#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 245#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), Black: 368#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 355#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 358#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 244#(= ~readerprogress2~0 0), Black: 362#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 348#true, Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 253#(<= 2 ~readerprogress1~0), Black: 366#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 351#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0))]) [2020-10-16 00:01:48,772 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2020-10-16 00:01:48,772 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2020-10-16 00:01:48,772 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2020-10-16 00:01:48,772 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2020-10-16 00:01:48,776 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([939] L763-2-->L766: Formula: (and (= |v_qrcu_updaterThread1of1ForFork0_#t~mem19_13| (select (select |v_#memory_int_87| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|)) (not (< 0 v_~ctr2~0_267)) (= |v_#pthreadsMutex_35| (store |v_#pthreadsMutex_36| |v_~#mutex~0.base_29| (store (select |v_#pthreadsMutex_36| |v_~#mutex~0.base_29|) |v_~#mutex~0.offset_29| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_36|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|, ~#mutex~0.base=|v_~#mutex~0.base_29|, #memory_int=|v_#memory_int_87|, ~#mutex~0.offset=|v_~#mutex~0.offset_29|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|, ~ctr2~0=v_~ctr2~0_267} OutVars{#pthreadsMutex=|v_#pthreadsMutex_35|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|, ~#mutex~0.base=|v_~#mutex~0.base_29|, #memory_int=|v_#memory_int_87|, ~#mutex~0.offset=|v_~#mutex~0.offset_29|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|, qrcu_updaterThread1of1ForFork0_#t~mem19=|v_qrcu_updaterThread1of1ForFork0_#t~mem19_13|, ~ctr2~0=v_~ctr2~0_267} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork0_#t~mem19][424], [258#(= ~readerprogress2~0 2), 261#true, 391#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 263#(and (= ~ctr2~0 0) (<= ~ctr1~0 1)), Black: 265#(<= qrcu_updaterThread1of1ForFork0_~sum~0 1), 274#true, Black: 276#(= ~ctr2~0 0), Black: 277#(= |qrcu_updaterThread1of1ForFork0_#t~post15| 0), Black: 278#(<= 1 ~ctr2~0), Black: 405#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 390#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 282#(and (= |qrcu_updaterThread1of1ForFork0_#t~post15| 0) (<= 1 ~ctr2~0)), Black: 407#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 162#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), 291#(= ~idx~0 1), Black: 409#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 395#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 160#true, Black: 397#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 383#true, Black: 168#(= ~readerprogress1~0 0), Black: 173#(= ~readerprogress2~0 0), 433#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 304#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0)), Black: 300#(and (= ~ctr2~0 0) (= ~idx~0 0)), Black: 178#(= ~ctr2~0 0), 186#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 316#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 183#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 65#L766true, Black: 184#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 190#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 198#true, Black: 320#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 322#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 324#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 308#true, Black: 326#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 310#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 328#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 330#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 315#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 208#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 210#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 334#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 318#(and (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 200#(and (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), 93#qrcu_reader1EXITtrue, Black: 201#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 204#(not (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 1)), Black: 206#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), 356#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 224#true, Black: 227#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 233#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 112#qrcu_reader2EXITtrue, Black: 235#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 242#true, 116#L776-1true, Black: 368#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 355#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 244#(= ~readerprogress2~0 0), Black: 358#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 362#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 245#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), Black: 348#true, Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 253#(<= 2 ~readerprogress1~0), Black: 366#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 351#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0))]) [2020-10-16 00:01:48,776 INFO L384 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2020-10-16 00:01:48,776 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2020-10-16 00:01:48,776 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2020-10-16 00:01:48,776 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2020-10-16 00:01:48,777 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([837] L763-2-->L763-2: Formula: (< 0 v_~ctr2~0_13) InVars {~ctr2~0=v_~ctr2~0_13} OutVars{~ctr2~0=v_~ctr2~0_13} AuxVars[] AssignedVars[][421], [258#(= ~readerprogress2~0 2), 261#true, 391#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 263#(and (= ~ctr2~0 0) (<= ~ctr1~0 1)), Black: 265#(<= qrcu_updaterThread1of1ForFork0_~sum~0 1), 278#(<= 1 ~ctr2~0), Black: 274#true, Black: 276#(= ~ctr2~0 0), Black: 277#(= |qrcu_updaterThread1of1ForFork0_#t~post15| 0), Black: 405#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 282#(and (= |qrcu_updaterThread1of1ForFork0_#t~post15| 0) (<= 1 ~ctr2~0)), Black: 390#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 407#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 162#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), 291#(= ~idx~0 1), Black: 409#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 395#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 160#true, Black: 397#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 383#true, 426#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0), Black: 168#(= ~readerprogress1~0 0), Black: 173#(= ~readerprogress2~0 0), Black: 304#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0)), Black: 300#(and (= ~ctr2~0 0) (= ~idx~0 0)), Black: 178#(= ~ctr2~0 0), 186#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 316#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 183#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 184#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 190#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 198#true, 78#L763-2true, Black: 320#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 322#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 324#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 308#true, Black: 326#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 310#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 328#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 330#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 315#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 208#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 210#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 334#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 318#(and (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 200#(and (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), 93#qrcu_reader1EXITtrue, Black: 201#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 204#(not (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 1)), Black: 206#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), 356#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 224#true, Black: 227#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 112#qrcu_reader2EXITtrue, Black: 233#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 235#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 242#true, 116#L776-1true, Black: 368#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 355#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 244#(= ~readerprogress2~0 0), Black: 358#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 362#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 245#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), Black: 348#true, Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 253#(<= 2 ~readerprogress1~0), Black: 366#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 351#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0))]) [2020-10-16 00:01:48,777 INFO L384 tUnfolder$Statistics]: this new event has 30 ancestors and is not cut-off event [2020-10-16 00:01:48,777 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2020-10-16 00:01:48,777 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2020-10-16 00:01:48,777 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2020-10-16 00:01:48,795 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([939] L763-2-->L766: Formula: (and (= |v_qrcu_updaterThread1of1ForFork0_#t~mem19_13| (select (select |v_#memory_int_87| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|)) (not (< 0 v_~ctr2~0_267)) (= |v_#pthreadsMutex_35| (store |v_#pthreadsMutex_36| |v_~#mutex~0.base_29| (store (select |v_#pthreadsMutex_36| |v_~#mutex~0.base_29|) |v_~#mutex~0.offset_29| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_36|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|, ~#mutex~0.base=|v_~#mutex~0.base_29|, #memory_int=|v_#memory_int_87|, ~#mutex~0.offset=|v_~#mutex~0.offset_29|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|, ~ctr2~0=v_~ctr2~0_267} OutVars{#pthreadsMutex=|v_#pthreadsMutex_35|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|, ~#mutex~0.base=|v_~#mutex~0.base_29|, #memory_int=|v_#memory_int_87|, ~#mutex~0.offset=|v_~#mutex~0.offset_29|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|, qrcu_updaterThread1of1ForFork0_#t~mem19=|v_qrcu_updaterThread1of1ForFork0_#t~mem19_13|, ~ctr2~0=v_~ctr2~0_267} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork0_#t~mem19][424], [258#(= ~readerprogress2~0 2), 261#true, 391#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 263#(and (= ~ctr2~0 0) (<= ~ctr1~0 1)), Black: 265#(<= qrcu_updaterThread1of1ForFork0_~sum~0 1), 274#true, Black: 276#(= ~ctr2~0 0), Black: 277#(= |qrcu_updaterThread1of1ForFork0_#t~post15| 0), Black: 405#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 278#(<= 1 ~ctr2~0), Black: 282#(and (= |qrcu_updaterThread1of1ForFork0_#t~post15| 0) (<= 1 ~ctr2~0)), Black: 390#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 407#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 162#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), 291#(= ~idx~0 1), Black: 409#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 395#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 160#true, Black: 397#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 383#true, Black: 168#(= ~readerprogress1~0 0), Black: 173#(= ~readerprogress2~0 0), 49#L777-1true, 433#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 304#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0)), Black: 300#(and (= ~ctr2~0 0) (= ~idx~0 0)), Black: 178#(= ~ctr2~0 0), 186#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 316#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 183#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 65#L766true, Black: 184#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 190#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 198#true, Black: 320#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 322#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 324#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 308#true, Black: 326#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 310#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 328#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 330#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 315#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 208#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 210#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 334#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 318#(and (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 200#(and (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), Black: 201#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 204#(not (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 1)), Black: 206#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), 356#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 224#true, Black: 227#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 112#qrcu_reader2EXITtrue, Black: 233#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 235#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 242#true, Black: 368#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 355#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 244#(= ~readerprogress2~0 0), Black: 358#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 362#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 245#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), Black: 348#true, Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 253#(<= 2 ~readerprogress1~0), Black: 366#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 351#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0))]) [2020-10-16 00:01:48,795 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2020-10-16 00:01:48,795 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2020-10-16 00:01:48,795 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2020-10-16 00:01:48,795 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2020-10-16 00:01:48,819 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([939] L763-2-->L766: Formula: (and (= |v_qrcu_updaterThread1of1ForFork0_#t~mem19_13| (select (select |v_#memory_int_87| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|)) (not (< 0 v_~ctr2~0_267)) (= |v_#pthreadsMutex_35| (store |v_#pthreadsMutex_36| |v_~#mutex~0.base_29| (store (select |v_#pthreadsMutex_36| |v_~#mutex~0.base_29|) |v_~#mutex~0.offset_29| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_36|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|, ~#mutex~0.base=|v_~#mutex~0.base_29|, #memory_int=|v_#memory_int_87|, ~#mutex~0.offset=|v_~#mutex~0.offset_29|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|, ~ctr2~0=v_~ctr2~0_267} OutVars{#pthreadsMutex=|v_#pthreadsMutex_35|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|, ~#mutex~0.base=|v_~#mutex~0.base_29|, #memory_int=|v_#memory_int_87|, ~#mutex~0.offset=|v_~#mutex~0.offset_29|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|, qrcu_updaterThread1of1ForFork0_#t~mem19=|v_qrcu_updaterThread1of1ForFork0_#t~mem19_13|, ~ctr2~0=v_~ctr2~0_267} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork0_#t~mem19][424], [258#(= ~readerprogress2~0 2), 261#true, 391#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 263#(and (= ~ctr2~0 0) (<= ~ctr1~0 1)), Black: 265#(<= qrcu_updaterThread1of1ForFork0_~sum~0 1), 274#true, Black: 276#(= ~ctr2~0 0), Black: 277#(= |qrcu_updaterThread1of1ForFork0_#t~post15| 0), Black: 405#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 278#(<= 1 ~ctr2~0), Black: 390#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 282#(and (= |qrcu_updaterThread1of1ForFork0_#t~post15| 0) (<= 1 ~ctr2~0)), Black: 407#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 162#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 409#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 291#(= ~idx~0 1), Black: 395#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 160#true, Black: 397#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 383#true, Black: 168#(= ~readerprogress1~0 0), Black: 173#(= ~readerprogress2~0 0), 433#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), 49#L777-1true, Black: 304#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0)), Black: 300#(and (= ~ctr2~0 0) (= ~idx~0 0)), Black: 178#(= ~ctr2~0 0), 186#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 316#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 183#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 65#L766true, Black: 184#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 190#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 198#true, Black: 320#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 322#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 324#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 308#true, Black: 326#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 310#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 328#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 330#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 315#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 208#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 210#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 334#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 318#(and (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 200#(and (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), 93#qrcu_reader1EXITtrue, Black: 201#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 204#(not (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 1)), Black: 206#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), 356#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 224#true, Black: 227#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 233#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 235#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 245#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), Black: 368#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 355#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 358#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 244#(= ~readerprogress2~0 0), Black: 362#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 348#true, Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 253#(<= 2 ~readerprogress1~0), Black: 366#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 351#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0))]) [2020-10-16 00:01:48,819 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is not cut-off event [2020-10-16 00:01:48,820 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is not cut-off event [2020-10-16 00:01:48,820 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is not cut-off event [2020-10-16 00:01:48,820 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is not cut-off event [2020-10-16 00:01:48,822 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([939] L763-2-->L766: Formula: (and (= |v_qrcu_updaterThread1of1ForFork0_#t~mem19_13| (select (select |v_#memory_int_87| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|)) (not (< 0 v_~ctr2~0_267)) (= |v_#pthreadsMutex_35| (store |v_#pthreadsMutex_36| |v_~#mutex~0.base_29| (store (select |v_#pthreadsMutex_36| |v_~#mutex~0.base_29|) |v_~#mutex~0.offset_29| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_36|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|, ~#mutex~0.base=|v_~#mutex~0.base_29|, #memory_int=|v_#memory_int_87|, ~#mutex~0.offset=|v_~#mutex~0.offset_29|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|, ~ctr2~0=v_~ctr2~0_267} OutVars{#pthreadsMutex=|v_#pthreadsMutex_35|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|, ~#mutex~0.base=|v_~#mutex~0.base_29|, #memory_int=|v_#memory_int_87|, ~#mutex~0.offset=|v_~#mutex~0.offset_29|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|, qrcu_updaterThread1of1ForFork0_#t~mem19=|v_qrcu_updaterThread1of1ForFork0_#t~mem19_13|, ~ctr2~0=v_~ctr2~0_267} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork0_#t~mem19][424], [258#(= ~readerprogress2~0 2), 261#true, 391#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 263#(and (= ~ctr2~0 0) (<= ~ctr1~0 1)), Black: 265#(<= qrcu_updaterThread1of1ForFork0_~sum~0 1), 274#true, Black: 276#(= ~ctr2~0 0), Black: 277#(= |qrcu_updaterThread1of1ForFork0_#t~post15| 0), Black: 405#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 278#(<= 1 ~ctr2~0), Black: 282#(and (= |qrcu_updaterThread1of1ForFork0_#t~post15| 0) (<= 1 ~ctr2~0)), Black: 390#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 407#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 162#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), 291#(= ~idx~0 1), Black: 409#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 395#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 160#true, Black: 397#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 383#true, Black: 168#(= ~readerprogress1~0 0), Black: 173#(= ~readerprogress2~0 0), 49#L777-1true, 433#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 304#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0)), Black: 300#(and (= ~ctr2~0 0) (= ~idx~0 0)), Black: 178#(= ~ctr2~0 0), 186#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 316#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 183#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 65#L766true, Black: 184#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 190#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 198#true, Black: 320#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 322#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 324#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 308#true, Black: 326#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 310#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 328#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 330#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 315#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 208#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 210#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 334#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 318#(and (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 200#(and (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), 93#qrcu_reader1EXITtrue, Black: 201#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 204#(not (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 1)), Black: 206#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), 356#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 224#true, Black: 227#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 233#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 235#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 242#true, Black: 368#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 355#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 244#(= ~readerprogress2~0 0), Black: 358#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 362#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 245#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), Black: 348#true, Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 253#(<= 2 ~readerprogress1~0), Black: 366#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 351#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0))]) [2020-10-16 00:01:48,822 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is not cut-off event [2020-10-16 00:01:48,822 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is not cut-off event [2020-10-16 00:01:48,822 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is not cut-off event [2020-10-16 00:01:48,822 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is not cut-off event [2020-10-16 00:01:48,833 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([939] L763-2-->L766: Formula: (and (= |v_qrcu_updaterThread1of1ForFork0_#t~mem19_13| (select (select |v_#memory_int_87| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|)) (not (< 0 v_~ctr2~0_267)) (= |v_#pthreadsMutex_35| (store |v_#pthreadsMutex_36| |v_~#mutex~0.base_29| (store (select |v_#pthreadsMutex_36| |v_~#mutex~0.base_29|) |v_~#mutex~0.offset_29| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_36|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|, ~#mutex~0.base=|v_~#mutex~0.base_29|, #memory_int=|v_#memory_int_87|, ~#mutex~0.offset=|v_~#mutex~0.offset_29|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|, ~ctr2~0=v_~ctr2~0_267} OutVars{#pthreadsMutex=|v_#pthreadsMutex_35|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|, ~#mutex~0.base=|v_~#mutex~0.base_29|, #memory_int=|v_#memory_int_87|, ~#mutex~0.offset=|v_~#mutex~0.offset_29|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|, qrcu_updaterThread1of1ForFork0_#t~mem19=|v_qrcu_updaterThread1of1ForFork0_#t~mem19_13|, ~ctr2~0=v_~ctr2~0_267} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork0_#t~mem19][423], [258#(= ~readerprogress2~0 2), 261#true, 391#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 263#(and (= ~ctr2~0 0) (<= ~ctr1~0 1)), Black: 265#(<= qrcu_updaterThread1of1ForFork0_~sum~0 1), 274#true, Black: 276#(= ~ctr2~0 0), Black: 277#(= |qrcu_updaterThread1of1ForFork0_#t~post15| 0), Black: 405#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 278#(<= 1 ~ctr2~0), Black: 390#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 282#(and (= |qrcu_updaterThread1of1ForFork0_#t~post15| 0) (<= 1 ~ctr2~0)), Black: 407#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 162#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), 291#(= ~idx~0 1), Black: 409#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 395#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 160#true, Black: 397#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 383#true, 423#true, Black: 168#(= ~readerprogress1~0 0), Black: 173#(= ~readerprogress2~0 0), 49#L777-1true, Black: 304#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0)), Black: 300#(and (= ~ctr2~0 0) (= ~idx~0 0)), Black: 178#(= ~ctr2~0 0), 186#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 316#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 183#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 184#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 65#L766true, Black: 190#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 198#true, Black: 320#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 322#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 324#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 308#true, Black: 326#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 310#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 328#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 330#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 315#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 208#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 210#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 334#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 318#(and (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 200#(and (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), Black: 201#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 204#(not (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 1)), Black: 206#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), 356#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 224#true, Black: 227#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 112#qrcu_reader2EXITtrue, Black: 233#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 235#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 242#true, Black: 368#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 355#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 244#(= ~readerprogress2~0 0), Black: 358#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 362#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 245#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), Black: 348#true, Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 253#(<= 2 ~readerprogress1~0), Black: 366#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 351#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0))]) [2020-10-16 00:01:48,833 INFO L384 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2020-10-16 00:01:48,833 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2020-10-16 00:01:48,833 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2020-10-16 00:01:48,833 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2020-10-16 00:01:48,838 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([939] L763-2-->L766: Formula: (and (= |v_qrcu_updaterThread1of1ForFork0_#t~mem19_13| (select (select |v_#memory_int_87| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|)) (not (< 0 v_~ctr2~0_267)) (= |v_#pthreadsMutex_35| (store |v_#pthreadsMutex_36| |v_~#mutex~0.base_29| (store (select |v_#pthreadsMutex_36| |v_~#mutex~0.base_29|) |v_~#mutex~0.offset_29| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_36|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|, ~#mutex~0.base=|v_~#mutex~0.base_29|, #memory_int=|v_#memory_int_87|, ~#mutex~0.offset=|v_~#mutex~0.offset_29|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|, ~ctr2~0=v_~ctr2~0_267} OutVars{#pthreadsMutex=|v_#pthreadsMutex_35|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|, ~#mutex~0.base=|v_~#mutex~0.base_29|, #memory_int=|v_#memory_int_87|, ~#mutex~0.offset=|v_~#mutex~0.offset_29|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|, qrcu_updaterThread1of1ForFork0_#t~mem19=|v_qrcu_updaterThread1of1ForFork0_#t~mem19_13|, ~ctr2~0=v_~ctr2~0_267} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork0_#t~mem19][424], [258#(= ~readerprogress2~0 2), 261#true, 391#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 137#L778-1true, Black: 263#(and (= ~ctr2~0 0) (<= ~ctr1~0 1)), Black: 265#(<= qrcu_updaterThread1of1ForFork0_~sum~0 1), 274#true, Black: 276#(= ~ctr2~0 0), Black: 277#(= |qrcu_updaterThread1of1ForFork0_#t~post15| 0), Black: 405#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 278#(<= 1 ~ctr2~0), Black: 390#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 282#(and (= |qrcu_updaterThread1of1ForFork0_#t~post15| 0) (<= 1 ~ctr2~0)), Black: 407#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 162#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 409#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 291#(= ~idx~0 1), Black: 395#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 160#true, Black: 397#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 383#true, Black: 168#(= ~readerprogress1~0 0), Black: 173#(= ~readerprogress2~0 0), 433#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 304#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0)), Black: 300#(and (= ~ctr2~0 0) (= ~idx~0 0)), Black: 178#(= ~ctr2~0 0), 186#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 316#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 183#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 65#L766true, Black: 184#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 190#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 198#true, Black: 320#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 322#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 324#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 308#true, Black: 326#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 310#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 328#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 330#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 315#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 208#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 210#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 334#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 318#(and (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 200#(and (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), Black: 201#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 204#(not (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 1)), Black: 206#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), 356#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 224#true, Black: 227#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 233#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 235#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 245#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), Black: 368#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 355#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 358#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 244#(= ~readerprogress2~0 0), Black: 362#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 348#true, Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 253#(<= 2 ~readerprogress1~0), Black: 366#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 351#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0))]) [2020-10-16 00:01:48,838 INFO L384 tUnfolder$Statistics]: this new event has 36 ancestors and is not cut-off event [2020-10-16 00:01:48,838 INFO L387 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2020-10-16 00:01:48,838 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is not cut-off event [2020-10-16 00:01:48,839 INFO L387 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2020-10-16 00:01:48,840 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([939] L763-2-->L766: Formula: (and (= |v_qrcu_updaterThread1of1ForFork0_#t~mem19_13| (select (select |v_#memory_int_87| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|)) (not (< 0 v_~ctr2~0_267)) (= |v_#pthreadsMutex_35| (store |v_#pthreadsMutex_36| |v_~#mutex~0.base_29| (store (select |v_#pthreadsMutex_36| |v_~#mutex~0.base_29|) |v_~#mutex~0.offset_29| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_36|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|, ~#mutex~0.base=|v_~#mutex~0.base_29|, #memory_int=|v_#memory_int_87|, ~#mutex~0.offset=|v_~#mutex~0.offset_29|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|, ~ctr2~0=v_~ctr2~0_267} OutVars{#pthreadsMutex=|v_#pthreadsMutex_35|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_30|, ~#mutex~0.base=|v_~#mutex~0.base_29|, #memory_int=|v_#memory_int_87|, ~#mutex~0.offset=|v_~#mutex~0.offset_29|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_27|, qrcu_updaterThread1of1ForFork0_#t~mem19=|v_qrcu_updaterThread1of1ForFork0_#t~mem19_13|, ~ctr2~0=v_~ctr2~0_267} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork0_#t~mem19][424], [258#(= ~readerprogress2~0 2), 261#true, 391#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 137#L778-1true, Black: 263#(and (= ~ctr2~0 0) (<= ~ctr1~0 1)), Black: 265#(<= qrcu_updaterThread1of1ForFork0_~sum~0 1), 274#true, Black: 276#(= ~ctr2~0 0), Black: 277#(= |qrcu_updaterThread1of1ForFork0_#t~post15| 0), Black: 278#(<= 1 ~ctr2~0), Black: 405#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 282#(and (= |qrcu_updaterThread1of1ForFork0_#t~post15| 0) (<= 1 ~ctr2~0)), Black: 390#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 407#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 162#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), 291#(= ~idx~0 1), Black: 409#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 395#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 160#true, Black: 397#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 383#true, Black: 168#(= ~readerprogress1~0 0), Black: 173#(= ~readerprogress2~0 0), 433#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 304#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (= ~idx~0 0)), Black: 300#(and (= ~ctr2~0 0) (= ~idx~0 0)), Black: 178#(= ~ctr2~0 0), 186#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 316#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 183#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 65#L766true, Black: 184#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 190#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 198#true, Black: 320#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 322#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 324#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 308#true, Black: 326#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 310#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 328#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 330#(and (<= 3 ~ctr1~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), Black: 315#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 208#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 210#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 0)), Black: 334#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 318#(and (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0) (<= 1 ~ctr1~0)), Black: 200#(and (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), Black: 201#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), Black: 204#(not (= |qrcu_updaterThread1of1ForFork0_#t~mem19| 1)), Black: 206#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= ~idx~0 0) (<= 1 ~ctr1~0) (= ~readerprogress1~0 0)), 356#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), Black: 224#true, Black: 227#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 233#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 235#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 242#true, Black: 368#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 355#(and (<= 2 ~ctr1~0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), Black: 244#(= ~readerprogress2~0 0), Black: 358#(and (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 362#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 245#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), Black: 348#true, Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_updaterThread1of1ForFork0_~sum~0 0)), 253#(<= 2 ~readerprogress1~0), Black: 366#(and (<= 2 qrcu_updaterThread1of1ForFork0_~sum~0) (= ~ctr2~0 0) (= qrcu_reader2Thread1of1ForFork2_~myidx~1 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 351#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0))]) [2020-10-16 00:01:48,840 INFO L384 tUnfolder$Statistics]: this new event has 36 ancestors and is not cut-off event [2020-10-16 00:01:48,840 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is not cut-off event [2020-10-16 00:01:48,840 INFO L387 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2020-10-16 00:01:48,840 INFO L387 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2020-10-16 00:01:48,843 INFO L129 PetriNetUnfolder]: 3808/9642 cut-off events. [2020-10-16 00:01:48,844 INFO L130 PetriNetUnfolder]: For 154447/157779 co-relation queries the response was YES. [2020-10-16 00:01:49,167 INFO L80 FinitePrefix]: Finished finitePrefix Result has 58137 conditions, 9642 events. 3808/9642 cut-off events. For 154447/157779 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 103487 event pairs, 207 based on Foata normal form. 480/9290 useless extension candidates. Maximal degree in co-relation 57562. Up to 1680 conditions per place. [2020-10-16 00:01:49,196 INFO L132 encePairwiseOnDemand]: 279/287 looper letters, 31 selfloop transitions, 20 changer transitions 4/438 dead transitions. [2020-10-16 00:01:49,197 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 438 transitions, 7495 flow [2020-10-16 00:01:49,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 00:01:49,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 00:01:49,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1535 transitions. [2020-10-16 00:01:49,198 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7640617222498756 [2020-10-16 00:01:49,198 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1535 transitions. [2020-10-16 00:01:49,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1535 transitions. [2020-10-16 00:01:49,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:49,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1535 transitions. [2020-10-16 00:01:49,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 00:01:49,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 00:01:49,203 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 00:01:49,203 INFO L185 Difference]: Start difference. First operand has 187 places, 407 transitions, 7200 flow. Second operand 7 states and 1535 transitions. [2020-10-16 00:01:49,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 438 transitions, 7495 flow [2020-10-16 00:01:50,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 438 transitions, 7266 flow, removed 65 selfloop flow, removed 5 redundant places. [2020-10-16 00:01:50,916 INFO L241 Difference]: Finished difference. Result has 187 places, 418 transitions, 7182 flow [2020-10-16 00:01:50,917 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=6983, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7182, PETRI_PLACES=187, PETRI_TRANSITIONS=418} [2020-10-16 00:01:50,917 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 128 predicate places. [2020-10-16 00:01:50,917 INFO L481 AbstractCegarLoop]: Abstraction has has 187 places, 418 transitions, 7182 flow [2020-10-16 00:01:50,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 00:01:50,917 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:50,917 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:50,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 00:01:50,917 INFO L429 AbstractCegarLoop]: === Iteration 20 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:50,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:50,918 INFO L82 PathProgramCache]: Analyzing trace with hash -410396996, now seen corresponding path program 1 times [2020-10-16 00:01:50,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:50,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573180994] [2020-10-16 00:01:50,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:51,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:51,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573180994] [2020-10-16 00:01:51,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:51,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 00:01:51,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154273393] [2020-10-16 00:01:51,021 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 00:01:51,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:51,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 00:01:51,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-16 00:01:51,024 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 287 [2020-10-16 00:01:51,024 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 418 transitions, 7182 flow. Second operand 9 states. [2020-10-16 00:01:51,025 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:51,025 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 287 [2020-10-16 00:01:51,025 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:52,808 INFO L129 PetriNetUnfolder]: 3508/7570 cut-off events. [2020-10-16 00:01:52,808 INFO L130 PetriNetUnfolder]: For 101802/103452 co-relation queries the response was YES. [2020-10-16 00:01:52,855 INFO L80 FinitePrefix]: Finished finitePrefix Result has 45013 conditions, 7570 events. 3508/7570 cut-off events. For 101802/103452 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 67827 event pairs, 341 based on Foata normal form. 394/6831 useless extension candidates. Maximal degree in co-relation 44617. Up to 1600 conditions per place. [2020-10-16 00:01:52,867 INFO L132 encePairwiseOnDemand]: 270/287 looper letters, 205 selfloop transitions, 185 changer transitions 199/613 dead transitions. [2020-10-16 00:01:52,867 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 613 transitions, 11169 flow [2020-10-16 00:01:52,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 00:01:52,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 00:01:52,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1802 transitions. [2020-10-16 00:01:52,870 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6278745644599303 [2020-10-16 00:01:52,870 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1802 transitions. [2020-10-16 00:01:52,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1802 transitions. [2020-10-16 00:01:52,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:52,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1802 transitions. [2020-10-16 00:01:52,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 00:01:52,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 00:01:52,875 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 00:01:52,875 INFO L185 Difference]: Start difference. First operand has 187 places, 418 transitions, 7182 flow. Second operand 10 states and 1802 transitions. [2020-10-16 00:01:52,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 613 transitions, 11169 flow [2020-10-16 00:01:53,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 613 transitions, 11144 flow, removed 6 selfloop flow, removed 1 redundant places. [2020-10-16 00:01:53,715 INFO L241 Difference]: Finished difference. Result has 201 places, 343 transitions, 6473 flow [2020-10-16 00:01:53,716 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=7157, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6473, PETRI_PLACES=201, PETRI_TRANSITIONS=343} [2020-10-16 00:01:53,716 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 142 predicate places. [2020-10-16 00:01:53,716 INFO L481 AbstractCegarLoop]: Abstraction has has 201 places, 343 transitions, 6473 flow [2020-10-16 00:01:53,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 00:01:53,716 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:53,716 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:53,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 00:01:53,716 INFO L429 AbstractCegarLoop]: === Iteration 21 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:53,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:53,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1047377607, now seen corresponding path program 1 times [2020-10-16 00:01:53,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:53,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778673303] [2020-10-16 00:01:53,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:53,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:53,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778673303] [2020-10-16 00:01:53,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:53,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 00:01:53,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616309146] [2020-10-16 00:01:53,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 00:01:53,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:53,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 00:01:53,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-16 00:01:53,834 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 287 [2020-10-16 00:01:53,835 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 343 transitions, 6473 flow. Second operand 9 states. [2020-10-16 00:01:53,835 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:53,835 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 287 [2020-10-16 00:01:53,835 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:54,806 INFO L129 PetriNetUnfolder]: 1205/2923 cut-off events. [2020-10-16 00:01:54,807 INFO L130 PetriNetUnfolder]: For 44665/44895 co-relation queries the response was YES. [2020-10-16 00:01:54,827 INFO L80 FinitePrefix]: Finished finitePrefix Result has 18377 conditions, 2923 events. 1205/2923 cut-off events. For 44665/44895 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 23659 event pairs, 89 based on Foata normal form. 146/2703 useless extension candidates. Maximal degree in co-relation 18139. Up to 790 conditions per place. [2020-10-16 00:01:54,834 INFO L132 encePairwiseOnDemand]: 270/287 looper letters, 168 selfloop transitions, 164 changer transitions 71/427 dead transitions. [2020-10-16 00:01:54,834 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 427 transitions, 8113 flow [2020-10-16 00:01:54,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 00:01:54,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-16 00:01:54,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2439 transitions. [2020-10-16 00:01:54,837 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6070184171229467 [2020-10-16 00:01:54,837 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2439 transitions. [2020-10-16 00:01:54,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2439 transitions. [2020-10-16 00:01:54,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:54,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2439 transitions. [2020-10-16 00:01:54,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-16 00:01:54,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-16 00:01:54,843 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-16 00:01:54,843 INFO L185 Difference]: Start difference. First operand has 201 places, 343 transitions, 6473 flow. Second operand 14 states and 2439 transitions. [2020-10-16 00:01:54,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 427 transitions, 8113 flow [2020-10-16 00:01:55,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 427 transitions, 7852 flow, removed 114 selfloop flow, removed 8 redundant places. [2020-10-16 00:01:55,060 INFO L241 Difference]: Finished difference. Result has 206 places, 303 transitions, 5331 flow [2020-10-16 00:01:55,060 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=6196, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5331, PETRI_PLACES=206, PETRI_TRANSITIONS=303} [2020-10-16 00:01:55,060 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 147 predicate places. [2020-10-16 00:01:55,060 INFO L481 AbstractCegarLoop]: Abstraction has has 206 places, 303 transitions, 5331 flow [2020-10-16 00:01:55,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 00:01:55,060 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:55,061 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:55,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 00:01:55,061 INFO L429 AbstractCegarLoop]: === Iteration 22 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:55,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:55,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1697786663, now seen corresponding path program 1 times [2020-10-16 00:01:55,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:55,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118793054] [2020-10-16 00:01:55,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:55,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:55,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118793054] [2020-10-16 00:01:55,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:55,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 00:01:55,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940804965] [2020-10-16 00:01:55,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 00:01:55,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:55,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 00:01:55,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 00:01:55,101 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 287 [2020-10-16 00:01:55,101 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 303 transitions, 5331 flow. Second operand 4 states. [2020-10-16 00:01:55,102 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:55,102 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 287 [2020-10-16 00:01:55,102 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:55,393 INFO L129 PetriNetUnfolder]: 476/1566 cut-off events. [2020-10-16 00:01:55,393 INFO L130 PetriNetUnfolder]: For 27136/27340 co-relation queries the response was YES. [2020-10-16 00:01:55,404 INFO L80 FinitePrefix]: Finished finitePrefix Result has 9127 conditions, 1566 events. 476/1566 cut-off events. For 27136/27340 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13085 event pairs, 20 based on Foata normal form. 82/1487 useless extension candidates. Maximal degree in co-relation 9036. Up to 305 conditions per place. [2020-10-16 00:01:55,408 INFO L132 encePairwiseOnDemand]: 281/287 looper letters, 118 selfloop transitions, 24 changer transitions 12/330 dead transitions. [2020-10-16 00:01:55,408 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 330 transitions, 5875 flow [2020-10-16 00:01:55,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 00:01:55,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 00:01:55,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1145 transitions. [2020-10-16 00:01:55,410 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7979094076655052 [2020-10-16 00:01:55,410 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1145 transitions. [2020-10-16 00:01:55,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1145 transitions. [2020-10-16 00:01:55,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:55,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1145 transitions. [2020-10-16 00:01:55,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 00:01:55,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 00:01:55,412 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 00:01:55,412 INFO L185 Difference]: Start difference. First operand has 206 places, 303 transitions, 5331 flow. Second operand 5 states and 1145 transitions. [2020-10-16 00:01:55,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 330 transitions, 5875 flow [2020-10-16 00:01:55,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 330 transitions, 5157 flow, removed 30 selfloop flow, removed 18 redundant places. [2020-10-16 00:01:55,505 INFO L241 Difference]: Finished difference. Result has 191 places, 299 transitions, 4684 flow [2020-10-16 00:01:55,506 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=4641, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4684, PETRI_PLACES=191, PETRI_TRANSITIONS=299} [2020-10-16 00:01:55,506 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 132 predicate places. [2020-10-16 00:01:55,506 INFO L481 AbstractCegarLoop]: Abstraction has has 191 places, 299 transitions, 4684 flow [2020-10-16 00:01:55,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 00:01:55,506 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:55,507 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:55,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-16 00:01:55,507 INFO L429 AbstractCegarLoop]: === Iteration 23 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:55,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:55,507 INFO L82 PathProgramCache]: Analyzing trace with hash 378971994, now seen corresponding path program 1 times [2020-10-16 00:01:55,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:55,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850237093] [2020-10-16 00:01:55,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:55,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:55,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850237093] [2020-10-16 00:01:55,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:55,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 00:01:55,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436464808] [2020-10-16 00:01:55,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 00:01:55,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:55,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 00:01:55,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 00:01:55,583 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 287 [2020-10-16 00:01:55,584 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 299 transitions, 4684 flow. Second operand 7 states. [2020-10-16 00:01:55,584 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:55,584 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 287 [2020-10-16 00:01:55,584 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:56,026 INFO L129 PetriNetUnfolder]: 677/1920 cut-off events. [2020-10-16 00:01:56,026 INFO L130 PetriNetUnfolder]: For 25348/25597 co-relation queries the response was YES. [2020-10-16 00:01:56,040 INFO L80 FinitePrefix]: Finished finitePrefix Result has 10490 conditions, 1920 events. 677/1920 cut-off events. For 25348/25597 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 15384 event pairs, 25 based on Foata normal form. 49/1737 useless extension candidates. Maximal degree in co-relation 10252. Up to 425 conditions per place. [2020-10-16 00:01:56,045 INFO L132 encePairwiseOnDemand]: 278/287 looper letters, 139 selfloop transitions, 61 changer transitions 82/370 dead transitions. [2020-10-16 00:01:56,045 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 370 transitions, 5913 flow [2020-10-16 00:01:56,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 00:01:56,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 00:01:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1844 transitions. [2020-10-16 00:01:56,048 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7138985675571041 [2020-10-16 00:01:56,048 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1844 transitions. [2020-10-16 00:01:56,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1844 transitions. [2020-10-16 00:01:56,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:56,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1844 transitions. [2020-10-16 00:01:56,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 00:01:56,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 00:01:56,052 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 00:01:56,052 INFO L185 Difference]: Start difference. First operand has 191 places, 299 transitions, 4684 flow. Second operand 9 states and 1844 transitions. [2020-10-16 00:01:56,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 370 transitions, 5913 flow [2020-10-16 00:01:56,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 370 transitions, 5865 flow, removed 20 selfloop flow, removed 1 redundant places. [2020-10-16 00:01:56,193 INFO L241 Difference]: Finished difference. Result has 202 places, 235 transitions, 3358 flow [2020-10-16 00:01:56,193 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=4657, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3358, PETRI_PLACES=202, PETRI_TRANSITIONS=235} [2020-10-16 00:01:56,193 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 143 predicate places. [2020-10-16 00:01:56,193 INFO L481 AbstractCegarLoop]: Abstraction has has 202 places, 235 transitions, 3358 flow [2020-10-16 00:01:56,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 00:01:56,193 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:56,193 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:56,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-16 00:01:56,194 INFO L429 AbstractCegarLoop]: === Iteration 24 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:56,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:56,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1091387167, now seen corresponding path program 1 times [2020-10-16 00:01:56,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:56,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823628327] [2020-10-16 00:01:56,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:56,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:56,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823628327] [2020-10-16 00:01:56,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:56,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 00:01:56,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057885641] [2020-10-16 00:01:56,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 00:01:56,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:56,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 00:01:56,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-16 00:01:56,267 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 287 [2020-10-16 00:01:56,268 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 235 transitions, 3358 flow. Second operand 7 states. [2020-10-16 00:01:56,268 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:56,268 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 287 [2020-10-16 00:01:56,268 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:56,901 INFO L129 PetriNetUnfolder]: 635/1651 cut-off events. [2020-10-16 00:01:56,901 INFO L130 PetriNetUnfolder]: For 18580/18693 co-relation queries the response was YES. [2020-10-16 00:01:56,919 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8872 conditions, 1651 events. 635/1651 cut-off events. For 18580/18693 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 11653 event pairs, 72 based on Foata normal form. 24/1439 useless extension candidates. Maximal degree in co-relation 8802. Up to 325 conditions per place. [2020-10-16 00:01:56,925 INFO L132 encePairwiseOnDemand]: 275/287 looper letters, 130 selfloop transitions, 64 changer transitions 32/310 dead transitions. [2020-10-16 00:01:56,925 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 310 transitions, 4571 flow [2020-10-16 00:01:56,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 00:01:56,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 00:01:56,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1844 transitions. [2020-10-16 00:01:56,928 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7138985675571041 [2020-10-16 00:01:56,928 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1844 transitions. [2020-10-16 00:01:56,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1844 transitions. [2020-10-16 00:01:56,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:56,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1844 transitions. [2020-10-16 00:01:56,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 00:01:56,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 00:01:56,933 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 00:01:56,933 INFO L185 Difference]: Start difference. First operand has 202 places, 235 transitions, 3358 flow. Second operand 9 states and 1844 transitions. [2020-10-16 00:01:56,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 310 transitions, 4571 flow [2020-10-16 00:01:57,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 310 transitions, 3990 flow, removed 35 selfloop flow, removed 27 redundant places. [2020-10-16 00:01:57,033 INFO L241 Difference]: Finished difference. Result has 185 places, 232 transitions, 3025 flow [2020-10-16 00:01:57,034 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=2855, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3025, PETRI_PLACES=185, PETRI_TRANSITIONS=232} [2020-10-16 00:01:57,034 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 126 predicate places. [2020-10-16 00:01:57,034 INFO L481 AbstractCegarLoop]: Abstraction has has 185 places, 232 transitions, 3025 flow [2020-10-16 00:01:57,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 00:01:57,034 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:57,035 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:57,035 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-16 00:01:57,035 INFO L429 AbstractCegarLoop]: === Iteration 25 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:57,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:57,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1264653582, now seen corresponding path program 1 times [2020-10-16 00:01:57,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:57,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660344683] [2020-10-16 00:01:57,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:57,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:57,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660344683] [2020-10-16 00:01:57,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:57,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 00:01:57,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760560382] [2020-10-16 00:01:57,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 00:01:57,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:57,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 00:01:57,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-16 00:01:57,102 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 287 [2020-10-16 00:01:57,103 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 232 transitions, 3025 flow. Second operand 7 states. [2020-10-16 00:01:57,103 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:57,103 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 287 [2020-10-16 00:01:57,103 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:57,502 INFO L129 PetriNetUnfolder]: 643/1632 cut-off events. [2020-10-16 00:01:57,502 INFO L130 PetriNetUnfolder]: For 15204/15345 co-relation queries the response was YES. [2020-10-16 00:01:57,511 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8371 conditions, 1632 events. 643/1632 cut-off events. For 15204/15345 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 11526 event pairs, 47 based on Foata normal form. 26/1413 useless extension candidates. Maximal degree in co-relation 8315. Up to 389 conditions per place. [2020-10-16 00:01:57,514 INFO L132 encePairwiseOnDemand]: 275/287 looper letters, 94 selfloop transitions, 40 changer transitions 122/305 dead transitions. [2020-10-16 00:01:57,514 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 305 transitions, 4253 flow [2020-10-16 00:01:57,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 00:01:57,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 00:01:57,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1835 transitions. [2020-10-16 00:01:57,516 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7104142469996129 [2020-10-16 00:01:57,516 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1835 transitions. [2020-10-16 00:01:57,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1835 transitions. [2020-10-16 00:01:57,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:57,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1835 transitions. [2020-10-16 00:01:57,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 00:01:57,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 00:01:57,521 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 00:01:57,521 INFO L185 Difference]: Start difference. First operand has 185 places, 232 transitions, 3025 flow. Second operand 9 states and 1835 transitions. [2020-10-16 00:01:57,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 305 transitions, 4253 flow [2020-10-16 00:01:57,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 305 transitions, 4140 flow, removed 14 selfloop flow, removed 6 redundant places. [2020-10-16 00:01:57,590 INFO L241 Difference]: Finished difference. Result has 193 places, 154 transitions, 1867 flow [2020-10-16 00:01:57,590 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=2918, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1867, PETRI_PLACES=193, PETRI_TRANSITIONS=154} [2020-10-16 00:01:57,590 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 134 predicate places. [2020-10-16 00:01:57,591 INFO L481 AbstractCegarLoop]: Abstraction has has 193 places, 154 transitions, 1867 flow [2020-10-16 00:01:57,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 00:01:57,591 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:57,591 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:57,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-16 00:01:57,591 INFO L429 AbstractCegarLoop]: === Iteration 26 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:57,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:57,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1801325833, now seen corresponding path program 1 times [2020-10-16 00:01:57,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:57,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231628240] [2020-10-16 00:01:57,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:57,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:57,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231628240] [2020-10-16 00:01:57,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:57,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 00:01:57,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945858722] [2020-10-16 00:01:57,667 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 00:01:57,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:57,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 00:01:57,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-16 00:01:57,669 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 287 [2020-10-16 00:01:57,670 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 154 transitions, 1867 flow. Second operand 7 states. [2020-10-16 00:01:57,670 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:57,670 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 287 [2020-10-16 00:01:57,670 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:58,025 INFO L129 PetriNetUnfolder]: 461/1205 cut-off events. [2020-10-16 00:01:58,026 INFO L130 PetriNetUnfolder]: For 7979/8023 co-relation queries the response was YES. [2020-10-16 00:01:58,033 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6132 conditions, 1205 events. 461/1205 cut-off events. For 7979/8023 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7806 event pairs, 92 based on Foata normal form. 31/1011 useless extension candidates. Maximal degree in co-relation 6074. Up to 268 conditions per place. [2020-10-16 00:01:58,036 INFO L132 encePairwiseOnDemand]: 276/287 looper letters, 90 selfloop transitions, 42 changer transitions 46/227 dead transitions. [2020-10-16 00:01:58,036 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 227 transitions, 3158 flow [2020-10-16 00:01:58,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 00:01:58,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 00:01:58,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2219 transitions. [2020-10-16 00:01:58,038 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7028824833702882 [2020-10-16 00:01:58,038 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2219 transitions. [2020-10-16 00:01:58,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2219 transitions. [2020-10-16 00:01:58,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:58,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2219 transitions. [2020-10-16 00:01:58,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 00:01:58,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 00:01:58,044 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 00:01:58,044 INFO L185 Difference]: Start difference. First operand has 193 places, 154 transitions, 1867 flow. Second operand 11 states and 2219 transitions. [2020-10-16 00:01:58,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 227 transitions, 3158 flow [2020-10-16 00:01:58,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 227 transitions, 2763 flow, removed 93 selfloop flow, removed 25 redundant places. [2020-10-16 00:01:58,082 INFO L241 Difference]: Finished difference. Result has 173 places, 161 transitions, 1883 flow [2020-10-16 00:01:58,082 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=1605, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1883, PETRI_PLACES=173, PETRI_TRANSITIONS=161} [2020-10-16 00:01:58,083 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 114 predicate places. [2020-10-16 00:01:58,083 INFO L481 AbstractCegarLoop]: Abstraction has has 173 places, 161 transitions, 1883 flow [2020-10-16 00:01:58,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 00:01:58,083 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:58,083 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:58,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-16 00:01:58,083 INFO L429 AbstractCegarLoop]: === Iteration 27 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:58,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:58,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1726855465, now seen corresponding path program 1 times [2020-10-16 00:01:58,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:58,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307999257] [2020-10-16 00:01:58,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:58,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307999257] [2020-10-16 00:01:58,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:58,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 00:01:58,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741169478] [2020-10-16 00:01:58,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 00:01:58,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:58,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 00:01:58,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 00:01:58,136 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 287 [2020-10-16 00:01:58,137 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 161 transitions, 1883 flow. Second operand 6 states. [2020-10-16 00:01:58,137 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:58,137 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 287 [2020-10-16 00:01:58,137 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:58,391 INFO L129 PetriNetUnfolder]: 405/1041 cut-off events. [2020-10-16 00:01:58,392 INFO L130 PetriNetUnfolder]: For 6941/6989 co-relation queries the response was YES. [2020-10-16 00:01:58,397 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5644 conditions, 1041 events. 405/1041 cut-off events. For 6941/6989 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6482 event pairs, 67 based on Foata normal form. 21/852 useless extension candidates. Maximal degree in co-relation 5599. Up to 260 conditions per place. [2020-10-16 00:01:58,399 INFO L132 encePairwiseOnDemand]: 276/287 looper letters, 71 selfloop transitions, 11 changer transitions 91/213 dead transitions. [2020-10-16 00:01:58,399 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 213 transitions, 2841 flow [2020-10-16 00:01:58,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 00:01:58,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 00:01:58,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1436 transitions. [2020-10-16 00:01:58,401 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7147834743653559 [2020-10-16 00:01:58,401 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1436 transitions. [2020-10-16 00:01:58,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1436 transitions. [2020-10-16 00:01:58,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:58,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1436 transitions. [2020-10-16 00:01:58,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 00:01:58,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 00:01:58,404 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 00:01:58,404 INFO L185 Difference]: Start difference. First operand has 173 places, 161 transitions, 1883 flow. Second operand 7 states and 1436 transitions. [2020-10-16 00:01:58,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 213 transitions, 2841 flow [2020-10-16 00:01:58,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 213 transitions, 2698 flow, removed 41 selfloop flow, removed 7 redundant places. [2020-10-16 00:01:58,427 INFO L241 Difference]: Finished difference. Result has 171 places, 109 transitions, 1208 flow [2020-10-16 00:01:58,428 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=1774, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1208, PETRI_PLACES=171, PETRI_TRANSITIONS=109} [2020-10-16 00:01:58,428 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 112 predicate places. [2020-10-16 00:01:58,428 INFO L481 AbstractCegarLoop]: Abstraction has has 171 places, 109 transitions, 1208 flow [2020-10-16 00:01:58,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 00:01:58,428 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:58,428 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:58,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-16 00:01:58,429 INFO L429 AbstractCegarLoop]: === Iteration 28 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:58,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:58,429 INFO L82 PathProgramCache]: Analyzing trace with hash 375868710, now seen corresponding path program 2 times [2020-10-16 00:01:58,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:58,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853915720] [2020-10-16 00:01:58,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:58,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:58,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853915720] [2020-10-16 00:01:58,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:58,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 00:01:58,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451004637] [2020-10-16 00:01:58,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 00:01:58,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:58,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 00:01:58,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 00:01:58,466 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 287 [2020-10-16 00:01:58,466 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 109 transitions, 1208 flow. Second operand 4 states. [2020-10-16 00:01:58,466 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:58,467 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 287 [2020-10-16 00:01:58,467 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:58,565 INFO L129 PetriNetUnfolder]: 147/535 cut-off events. [2020-10-16 00:01:58,565 INFO L130 PetriNetUnfolder]: For 3396/3438 co-relation queries the response was YES. [2020-10-16 00:01:58,569 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2497 conditions, 535 events. 147/535 cut-off events. For 3396/3438 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3175 event pairs, 18 based on Foata normal form. 13/475 useless extension candidates. Maximal degree in co-relation 2450. Up to 97 conditions per place. [2020-10-16 00:01:58,571 INFO L132 encePairwiseOnDemand]: 282/287 looper letters, 46 selfloop transitions, 14 changer transitions 0/119 dead transitions. [2020-10-16 00:01:58,571 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 119 transitions, 1439 flow [2020-10-16 00:01:58,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 00:01:58,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 00:01:58,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 910 transitions. [2020-10-16 00:01:58,573 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7926829268292683 [2020-10-16 00:01:58,573 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 910 transitions. [2020-10-16 00:01:58,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 910 transitions. [2020-10-16 00:01:58,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:58,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 910 transitions. [2020-10-16 00:01:58,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 00:01:58,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 00:01:58,576 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 00:01:58,576 INFO L185 Difference]: Start difference. First operand has 171 places, 109 transitions, 1208 flow. Second operand 4 states and 910 transitions. [2020-10-16 00:01:58,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 119 transitions, 1439 flow [2020-10-16 00:01:58,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 119 transitions, 1186 flow, removed 25 selfloop flow, removed 29 redundant places. [2020-10-16 00:01:58,592 INFO L241 Difference]: Finished difference. Result has 131 places, 112 transitions, 1059 flow [2020-10-16 00:01:58,592 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1059, PETRI_PLACES=131, PETRI_TRANSITIONS=112} [2020-10-16 00:01:58,592 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 72 predicate places. [2020-10-16 00:01:58,592 INFO L481 AbstractCegarLoop]: Abstraction has has 131 places, 112 transitions, 1059 flow [2020-10-16 00:01:58,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 00:01:58,592 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:58,593 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:58,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-16 00:01:58,593 INFO L429 AbstractCegarLoop]: === Iteration 29 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:58,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:58,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1745199704, now seen corresponding path program 3 times [2020-10-16 00:01:58,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:58,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430242775] [2020-10-16 00:01:58,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:58,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:58,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430242775] [2020-10-16 00:01:58,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:58,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 00:01:58,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946282284] [2020-10-16 00:01:58,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 00:01:58,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:58,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 00:01:58,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 00:01:58,684 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 287 [2020-10-16 00:01:58,684 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 112 transitions, 1059 flow. Second operand 7 states. [2020-10-16 00:01:58,684 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:58,685 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 287 [2020-10-16 00:01:58,685 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:58,916 INFO L129 PetriNetUnfolder]: 326/771 cut-off events. [2020-10-16 00:01:58,916 INFO L130 PetriNetUnfolder]: For 3710/3727 co-relation queries the response was YES. [2020-10-16 00:01:58,920 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3722 conditions, 771 events. 326/771 cut-off events. For 3710/3727 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4047 event pairs, 59 based on Foata normal form. 6/644 useless extension candidates. Maximal degree in co-relation 3685. Up to 156 conditions per place. [2020-10-16 00:01:58,922 INFO L132 encePairwiseOnDemand]: 277/287 looper letters, 59 selfloop transitions, 25 changer transitions 40/163 dead transitions. [2020-10-16 00:01:58,922 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 163 transitions, 1923 flow [2020-10-16 00:01:58,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 00:01:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 00:01:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1817 transitions. [2020-10-16 00:01:58,924 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7034456058846302 [2020-10-16 00:01:58,924 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1817 transitions. [2020-10-16 00:01:58,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1817 transitions. [2020-10-16 00:01:58,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:58,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1817 transitions. [2020-10-16 00:01:58,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 00:01:58,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 00:01:58,928 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 00:01:58,928 INFO L185 Difference]: Start difference. First operand has 131 places, 112 transitions, 1059 flow. Second operand 9 states and 1817 transitions. [2020-10-16 00:01:58,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 163 transitions, 1923 flow [2020-10-16 00:01:58,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 163 transitions, 1867 flow, removed 24 selfloop flow, removed 1 redundant places. [2020-10-16 00:01:58,938 INFO L241 Difference]: Finished difference. Result has 141 places, 108 transitions, 1084 flow [2020-10-16 00:01:58,939 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1084, PETRI_PLACES=141, PETRI_TRANSITIONS=108} [2020-10-16 00:01:58,939 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 82 predicate places. [2020-10-16 00:01:58,939 INFO L481 AbstractCegarLoop]: Abstraction has has 141 places, 108 transitions, 1084 flow [2020-10-16 00:01:58,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 00:01:58,939 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:58,939 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:58,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-16 00:01:58,940 INFO L429 AbstractCegarLoop]: === Iteration 30 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:58,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:58,940 INFO L82 PathProgramCache]: Analyzing trace with hash -527707360, now seen corresponding path program 1 times [2020-10-16 00:01:58,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:58,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633991496] [2020-10-16 00:01:58,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:58,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633991496] [2020-10-16 00:01:58,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:58,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 00:01:58,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504527815] [2020-10-16 00:01:58,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 00:01:58,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:58,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 00:01:58,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 00:01:58,979 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 287 [2020-10-16 00:01:58,980 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 108 transitions, 1084 flow. Second operand 6 states. [2020-10-16 00:01:58,980 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:58,980 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 287 [2020-10-16 00:01:58,980 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:59,171 INFO L129 PetriNetUnfolder]: 210/608 cut-off events. [2020-10-16 00:01:59,171 INFO L130 PetriNetUnfolder]: For 3092/3120 co-relation queries the response was YES. [2020-10-16 00:01:59,174 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2988 conditions, 608 events. 210/608 cut-off events. For 3092/3120 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3492 event pairs, 36 based on Foata normal form. 7/516 useless extension candidates. Maximal degree in co-relation 2948. Up to 151 conditions per place. [2020-10-16 00:01:59,175 INFO L132 encePairwiseOnDemand]: 279/287 looper letters, 27 selfloop transitions, 6 changer transitions 79/140 dead transitions. [2020-10-16 00:01:59,175 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 140 transitions, 1660 flow [2020-10-16 00:01:59,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 00:01:59,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 00:01:59,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1431 transitions. [2020-10-16 00:01:59,177 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7122946739671479 [2020-10-16 00:01:59,177 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1431 transitions. [2020-10-16 00:01:59,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1431 transitions. [2020-10-16 00:01:59,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:59,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1431 transitions. [2020-10-16 00:01:59,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 00:01:59,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 00:01:59,180 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 00:01:59,180 INFO L185 Difference]: Start difference. First operand has 141 places, 108 transitions, 1084 flow. Second operand 7 states and 1431 transitions. [2020-10-16 00:01:59,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 140 transitions, 1660 flow [2020-10-16 00:01:59,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 140 transitions, 1576 flow, removed 16 selfloop flow, removed 7 redundant places. [2020-10-16 00:01:59,196 INFO L241 Difference]: Finished difference. Result has 141 places, 59 transitions, 461 flow [2020-10-16 00:01:59,197 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=461, PETRI_PLACES=141, PETRI_TRANSITIONS=59} [2020-10-16 00:01:59,197 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 82 predicate places. [2020-10-16 00:01:59,197 INFO L481 AbstractCegarLoop]: Abstraction has has 141 places, 59 transitions, 461 flow [2020-10-16 00:01:59,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 00:01:59,197 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 00:01:59,197 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 00:01:59,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-16 00:01:59,198 INFO L429 AbstractCegarLoop]: === Iteration 31 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 00:01:59,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 00:01:59,198 INFO L82 PathProgramCache]: Analyzing trace with hash -215825917, now seen corresponding path program 2 times [2020-10-16 00:01:59,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 00:01:59,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706717192] [2020-10-16 00:01:59,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 00:01:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 00:01:59,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 00:01:59,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706717192] [2020-10-16 00:01:59,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 00:01:59,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 00:01:59,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309211172] [2020-10-16 00:01:59,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 00:01:59,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 00:01:59,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 00:01:59,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-16 00:01:59,260 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 287 [2020-10-16 00:01:59,261 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 59 transitions, 461 flow. Second operand 7 states. [2020-10-16 00:01:59,261 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 00:01:59,261 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 287 [2020-10-16 00:01:59,261 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 00:01:59,372 INFO L129 PetriNetUnfolder]: 47/156 cut-off events. [2020-10-16 00:01:59,372 INFO L130 PetriNetUnfolder]: For 583/585 co-relation queries the response was YES. [2020-10-16 00:01:59,373 INFO L80 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 156 events. 47/156 cut-off events. For 583/585 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 490 event pairs, 12 based on Foata normal form. 2/146 useless extension candidates. Maximal degree in co-relation 584. Up to 36 conditions per place. [2020-10-16 00:01:59,373 INFO L132 encePairwiseOnDemand]: 279/287 looper letters, 0 selfloop transitions, 0 changer transitions 64/64 dead transitions. [2020-10-16 00:01:59,373 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 64 transitions, 584 flow [2020-10-16 00:01:59,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 00:01:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 00:01:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1590 transitions. [2020-10-16 00:01:59,375 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6925087108013938 [2020-10-16 00:01:59,375 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1590 transitions. [2020-10-16 00:01:59,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1590 transitions. [2020-10-16 00:01:59,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 00:01:59,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1590 transitions. [2020-10-16 00:01:59,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 00:01:59,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 00:01:59,378 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 00:01:59,378 INFO L185 Difference]: Start difference. First operand has 141 places, 59 transitions, 461 flow. Second operand 8 states and 1590 transitions. [2020-10-16 00:01:59,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 64 transitions, 584 flow [2020-10-16 00:01:59,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 64 transitions, 417 flow, removed 35 selfloop flow, removed 33 redundant places. [2020-10-16 00:01:59,381 INFO L241 Difference]: Finished difference. Result has 97 places, 0 transitions, 0 flow [2020-10-16 00:01:59,381 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=97, PETRI_TRANSITIONS=0} [2020-10-16 00:01:59,381 INFO L342 CegarLoopForPetriNet]: 59 programPoint places, 38 predicate places. [2020-10-16 00:01:59,382 INFO L481 AbstractCegarLoop]: Abstraction has has 97 places, 0 transitions, 0 flow [2020-10-16 00:01:59,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 00:01:59,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-16 00:01:59,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:01:59 BasicIcfg [2020-10-16 00:01:59,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 00:01:59,387 INFO L168 Benchmark]: Toolchain (without parser) took 33115.77 ms. Allocated memory was 251.1 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 206.2 MB in the beginning and 435.6 MB in the end (delta: -229.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 14.2 GB. [2020-10-16 00:01:59,387 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 251.1 MB. Free memory is still 227.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 00:01:59,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 678.22 ms. Allocated memory was 251.1 MB in the beginning and 314.6 MB in the end (delta: 63.4 MB). Free memory was 206.2 MB in the beginning and 265.3 MB in the end (delta: -59.1 MB). Peak memory consumption was 29.6 MB. Max. memory is 14.2 GB. [2020-10-16 00:01:59,388 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.62 ms. Allocated memory is still 314.6 MB. Free memory was 265.3 MB in the beginning and 262.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 00:01:59,389 INFO L168 Benchmark]: Boogie Preprocessor took 37.91 ms. Allocated memory is still 314.6 MB. Free memory was 262.8 MB in the beginning and 260.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 00:01:59,389 INFO L168 Benchmark]: RCFGBuilder took 1159.49 ms. Allocated memory was 314.6 MB in the beginning and 357.6 MB in the end (delta: 43.0 MB). Free memory was 260.3 MB in the beginning and 314.8 MB in the end (delta: -54.5 MB). Peak memory consumption was 99.7 MB. Max. memory is 14.2 GB. [2020-10-16 00:01:59,390 INFO L168 Benchmark]: TraceAbstraction took 31177.77 ms. Allocated memory was 357.6 MB in the beginning and 1.8 GB in the end (delta: 1.4 GB). Free memory was 314.8 MB in the beginning and 435.6 MB in the end (delta: -120.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 14.2 GB. [2020-10-16 00:01:59,393 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 251.1 MB. Free memory is still 227.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 678.22 ms. Allocated memory was 251.1 MB in the beginning and 314.6 MB in the end (delta: 63.4 MB). Free memory was 206.2 MB in the beginning and 265.3 MB in the end (delta: -59.1 MB). Peak memory consumption was 29.6 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 57.62 ms. Allocated memory is still 314.6 MB. Free memory was 265.3 MB in the beginning and 262.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 37.91 ms. Allocated memory is still 314.6 MB. Free memory was 262.8 MB in the beginning and 260.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1159.49 ms. Allocated memory was 314.6 MB in the beginning and 357.6 MB in the end (delta: 43.0 MB). Free memory was 260.3 MB in the beginning and 314.8 MB in the end (delta: -54.5 MB). Peak memory consumption was 99.7 MB. Max. memory is 14.2 GB. * TraceAbstraction took 31177.77 ms. Allocated memory was 357.6 MB in the beginning and 1.8 GB in the end (delta: 1.4 GB). Free memory was 314.8 MB in the beginning and 435.6 MB in the end (delta: -120.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 7010 VarBasedMoverChecksPositive, 141 VarBasedMoverChecksNegative, 36 SemBasedMoverChecksPositive, 105 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 1091 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.5s, 143 PlacesBefore, 59 PlacesAfterwards, 155 TransitionsBefore, 67 TransitionsAfterwards, 10120 CoEnabledTransitionPairs, 6 FixpointIterations, 20 TrivialSequentialCompositions, 77 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 4 ChoiceCompositions, 116 TotalNumberOfCompositions, 25903 MoverChecksTotal - PositiveResult [Line: 701]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 708]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 148 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 31.0s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 25.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 529 SDtfs, 1184 SDslu, 735 SDs, 0 SdLazy, 4745 SolverSat, 440 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7200occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 690 NumberOfCodeBlocks, 690 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 659 ConstructedInterpolants, 0 QuantifiedInterpolants, 71999 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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 correct! Received shutdown request...