/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/qrcu-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-3902331-m [2022-09-20 22:20:23,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 22:20:23,671 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 22:20:23,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 22:20:23,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 22:20:23,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 22:20:23,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 22:20:23,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 22:20:23,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 22:20:23,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 22:20:23,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 22:20:23,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 22:20:23,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 22:20:23,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 22:20:23,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 22:20:23,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 22:20:23,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 22:20:23,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 22:20:23,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 22:20:23,736 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 22:20:23,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 22:20:23,740 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 22:20:23,745 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 22:20:23,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 22:20:23,754 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 22:20:23,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 22:20:23,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 22:20:23,755 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 22:20:23,756 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 22:20:23,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 22:20:23,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 22:20:23,757 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 22:20:23,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 22:20:23,758 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 22:20:23,759 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 22:20:23,759 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 22:20:23,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 22:20:23,760 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 22:20:23,760 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 22:20:23,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 22:20:23,761 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 22:20:23,762 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-NoLbe.epf [2022-09-20 22:20:23,782 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 22:20:23,782 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 22:20:23,783 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 22:20:23,783 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 22:20:23,784 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 22:20:23,784 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 22:20:23,784 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 22:20:23,784 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 22:20:23,784 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 22:20:23,784 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 22:20:23,785 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 22:20:23,785 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 22:20:23,785 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 22:20:23,785 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 22:20:23,785 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 22:20:23,785 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 22:20:23,785 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 22:20:23,786 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 22:20:23,786 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 22:20:23,786 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 22:20:23,786 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 22:20:23,786 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 22:20:23,786 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 22:20:23,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:20:23,787 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 22:20:23,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 22:20:23,790 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 22:20:23,790 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 22:20:23,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 22:20:23,791 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 22:20:23,791 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 22:20:23,791 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-09-20 22:20:23,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 22:20:23,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 22:20:23,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 22:20:23,983 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 22:20:23,984 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 22:20:23,985 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/qrcu-1.i [2022-09-20 22:20:24,032 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89caba76f/69ba1dc9d33e46ba8f54838450dc9994/FLAG35fe0e42f [2022-09-20 22:20:24,426 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 22:20:24,426 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i [2022-09-20 22:20:24,435 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89caba76f/69ba1dc9d33e46ba8f54838450dc9994/FLAG35fe0e42f [2022-09-20 22:20:24,808 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89caba76f/69ba1dc9d33e46ba8f54838450dc9994 [2022-09-20 22:20:24,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 22:20:24,810 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 22:20:24,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 22:20:24,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 22:20:24,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 22:20:24,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:20:24" (1/1) ... [2022-09-20 22:20:24,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1640132c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:20:24, skipping insertion in model container [2022-09-20 22:20:24,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:20:24" (1/1) ... [2022-09-20 22:20:24,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 22:20:24,846 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 22:20:25,119 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i[30694,30707] [2022-09-20 22:20:25,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i[30916,30929] [2022-09-20 22:20:25,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:20:25,153 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 22:20:25,184 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i[30694,30707] [2022-09-20 22:20:25,185 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i[30916,30929] [2022-09-20 22:20:25,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:20:25,236 INFO L208 MainTranslator]: Completed translation [2022-09-20 22:20:25,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:20:25 WrapperNode [2022-09-20 22:20:25,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 22:20:25,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 22:20:25,238 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 22:20:25,238 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 22:20:25,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:20:25" (1/1) ... [2022-09-20 22:20:25,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:20:25" (1/1) ... [2022-09-20 22:20:25,300 INFO L138 Inliner]: procedures = 177, calls = 54, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 270 [2022-09-20 22:20:25,300 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 22:20:25,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 22:20:25,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 22:20:25,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 22:20:25,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:20:25" (1/1) ... [2022-09-20 22:20:25,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:20:25" (1/1) ... [2022-09-20 22:20:25,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:20:25" (1/1) ... [2022-09-20 22:20:25,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:20:25" (1/1) ... [2022-09-20 22:20:25,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:20:25" (1/1) ... [2022-09-20 22:20:25,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:20:25" (1/1) ... [2022-09-20 22:20:25,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:20:25" (1/1) ... [2022-09-20 22:20:25,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 22:20:25,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 22:20:25,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 22:20:25,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 22:20:25,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:20:25" (1/1) ... [2022-09-20 22:20:25,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:20:25,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:20:25,376 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-09-20 22:20:25,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-09-20 22:20:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader1 [2022-09-20 22:20:25,406 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader1 [2022-09-20 22:20:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader2 [2022-09-20 22:20:25,406 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader2 [2022-09-20 22:20:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-20 22:20:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 22:20:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_updater [2022-09-20 22:20:25,406 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_updater [2022-09-20 22:20:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-09-20 22:20:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 22:20:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 22:20:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 22:20:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 22:20:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 22:20:25,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 22:20:25,408 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-20 22:20:25,482 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 22:20:25,482 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 22:20:25,776 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 22:20:25,944 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 22:20:25,944 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-09-20 22:20:25,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:20:25 BoogieIcfgContainer [2022-09-20 22:20:25,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 22:20:25,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 22:20:25,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 22:20:25,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 22:20:25,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 10:20:24" (1/3) ... [2022-09-20 22:20:25,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3868786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:20:25, skipping insertion in model container [2022-09-20 22:20:25,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:20:25" (2/3) ... [2022-09-20 22:20:25,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3868786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:20:25, skipping insertion in model container [2022-09-20 22:20:25,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:20:25" (3/3) ... [2022-09-20 22:20:25,953 INFO L112 eAbstractionObserver]: Analyzing ICFG qrcu-1.i [2022-09-20 22:20:25,986 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 22:20:25,986 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-09-20 22:20:25,986 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 22:20:26,072 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-09-20 22:20:26,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 183 transitions, 390 flow [2022-09-20 22:20:26,169 INFO L130 PetriNetUnfolder]: 18/180 cut-off events. [2022-09-20 22:20:26,169 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-09-20 22:20:26,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 180 events. 18/180 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 353 event pairs, 0 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 134. Up to 4 conditions per place. [2022-09-20 22:20:26,180 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 183 transitions, 390 flow [2022-09-20 22:20:26,184 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 168 transitions, 351 flow [2022-09-20 22:20:26,191 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 22:20:26,195 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@44e4f6f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 22:20:26,195 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-09-20 22:20:26,219 INFO L130 PetriNetUnfolder]: 9/123 cut-off events. [2022-09-20 22:20:26,220 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-09-20 22:20:26,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:26,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:26,221 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:26,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:26,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1952592501, now seen corresponding path program 1 times [2022-09-20 22:20:26,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:26,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454960881] [2022-09-20 22:20:26,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:26,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:26,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:26,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:26,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454960881] [2022-09-20 22:20:26,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454960881] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:26,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:26,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-20 22:20:26,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666484395] [2022-09-20 22:20:26,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:26,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 22:20:26,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:26,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 22:20:26,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 22:20:26,503 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 183 [2022-09-20 22:20:26,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 168 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:26,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:26,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 183 [2022-09-20 22:20:26,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:26,861 INFO L130 PetriNetUnfolder]: 629/1791 cut-off events. [2022-09-20 22:20:26,862 INFO L131 PetriNetUnfolder]: For 265/265 co-relation queries the response was YES. [2022-09-20 22:20:26,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2764 conditions, 1791 events. 629/1791 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 12325 event pairs, 272 based on Foata normal form. 180/1804 useless extension candidates. Maximal degree in co-relation 1910. Up to 618 conditions per place. [2022-09-20 22:20:26,878 INFO L137 encePairwiseOnDemand]: 174/183 looper letters, 40 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2022-09-20 22:20:26,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 175 transitions, 455 flow [2022-09-20 22:20:26,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 22:20:26,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 22:20:26,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2022-09-20 22:20:26,892 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8998178506375227 [2022-09-20 22:20:26,893 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2022-09-20 22:20:26,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2022-09-20 22:20:26,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:26,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2022-09-20 22:20:26,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:26,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:26,906 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:26,907 INFO L175 Difference]: Start difference. First operand has 160 places, 168 transitions, 351 flow. Second operand 3 states and 494 transitions. [2022-09-20 22:20:26,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 175 transitions, 455 flow [2022-09-20 22:20:26,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 175 transitions, 442 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-09-20 22:20:26,915 INFO L231 Difference]: Finished difference. Result has 159 places, 163 transitions, 344 flow [2022-09-20 22:20:26,917 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=159, PETRI_TRANSITIONS=163} [2022-09-20 22:20:26,919 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, -1 predicate places. [2022-09-20 22:20:26,919 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 163 transitions, 344 flow [2022-09-20 22:20:26,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:26,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:26,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:26,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 22:20:26,921 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:26,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:26,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1903131369, now seen corresponding path program 1 times [2022-09-20 22:20:26,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:26,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915787018] [2022-09-20 22:20:26,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:26,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:27,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:27,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:27,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915787018] [2022-09-20 22:20:27,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915787018] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:27,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:27,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 22:20:27,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804313764] [2022-09-20 22:20:27,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:27,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 22:20:27,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:27,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 22:20:27,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 22:20:27,061 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 183 [2022-09-20 22:20:27,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 163 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:27,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:27,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 183 [2022-09-20 22:20:27,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:27,225 INFO L130 PetriNetUnfolder]: 402/1255 cut-off events. [2022-09-20 22:20:27,226 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-09-20 22:20:27,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1887 conditions, 1255 events. 402/1255 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 8063 event pairs, 79 based on Foata normal form. 0/1101 useless extension candidates. Maximal degree in co-relation 1163. Up to 395 conditions per place. [2022-09-20 22:20:27,232 INFO L137 encePairwiseOnDemand]: 180/183 looper letters, 26 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2022-09-20 22:20:27,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 172 transitions, 421 flow [2022-09-20 22:20:27,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 22:20:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 22:20:27,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2022-09-20 22:20:27,234 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9107468123861566 [2022-09-20 22:20:27,234 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2022-09-20 22:20:27,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2022-09-20 22:20:27,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:27,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2022-09-20 22:20:27,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:27,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:27,237 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:27,237 INFO L175 Difference]: Start difference. First operand has 159 places, 163 transitions, 344 flow. Second operand 3 states and 500 transitions. [2022-09-20 22:20:27,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 172 transitions, 421 flow [2022-09-20 22:20:27,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 172 transitions, 419 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-09-20 22:20:27,241 INFO L231 Difference]: Finished difference. Result has 161 places, 163 transitions, 350 flow [2022-09-20 22:20:27,242 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=161, PETRI_TRANSITIONS=163} [2022-09-20 22:20:27,242 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 1 predicate places. [2022-09-20 22:20:27,242 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 163 transitions, 350 flow [2022-09-20 22:20:27,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:27,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:27,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:27,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 22:20:27,244 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:27,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:27,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1794772677, now seen corresponding path program 1 times [2022-09-20 22:20:27,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:27,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820702331] [2022-09-20 22:20:27,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:27,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:27,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:27,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:27,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820702331] [2022-09-20 22:20:27,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820702331] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:27,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:27,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-09-20 22:20:27,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751305333] [2022-09-20 22:20:27,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:27,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-09-20 22:20:27,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:27,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-09-20 22:20:27,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-09-20 22:20:27,384 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-09-20 22:20:27,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 163 transitions, 350 flow. Second operand has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:27,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:27,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-09-20 22:20:27,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:28,152 INFO L130 PetriNetUnfolder]: 2951/6671 cut-off events. [2022-09-20 22:20:28,152 INFO L131 PetriNetUnfolder]: For 215/215 co-relation queries the response was YES. [2022-09-20 22:20:28,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10975 conditions, 6671 events. 2951/6671 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 56535 event pairs, 405 based on Foata normal form. 0/6217 useless extension candidates. Maximal degree in co-relation 7824. Up to 1682 conditions per place. [2022-09-20 22:20:28,190 INFO L137 encePairwiseOnDemand]: 176/183 looper letters, 84 selfloop transitions, 11 changer transitions 7/227 dead transitions. [2022-09-20 22:20:28,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 227 transitions, 695 flow [2022-09-20 22:20:28,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 22:20:28,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 22:20:28,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1070 transitions. [2022-09-20 22:20:28,193 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8352849336455894 [2022-09-20 22:20:28,193 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1070 transitions. [2022-09-20 22:20:28,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1070 transitions. [2022-09-20 22:20:28,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:28,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1070 transitions. [2022-09-20 22:20:28,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 152.85714285714286) internal successors, (1070), 7 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:28,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:28,198 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:28,198 INFO L175 Difference]: Start difference. First operand has 161 places, 163 transitions, 350 flow. Second operand 7 states and 1070 transitions. [2022-09-20 22:20:28,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 227 transitions, 695 flow [2022-09-20 22:20:28,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 227 transitions, 691 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 22:20:28,206 INFO L231 Difference]: Finished difference. Result has 168 places, 172 transitions, 408 flow [2022-09-20 22:20:28,207 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=408, PETRI_PLACES=168, PETRI_TRANSITIONS=172} [2022-09-20 22:20:28,208 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 8 predicate places. [2022-09-20 22:20:28,208 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 172 transitions, 408 flow [2022-09-20 22:20:28,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:28,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:28,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:28,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 22:20:28,210 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:28,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:28,210 INFO L85 PathProgramCache]: Analyzing trace with hash -2102848707, now seen corresponding path program 1 times [2022-09-20 22:20:28,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:28,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500252201] [2022-09-20 22:20:28,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:28,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:28,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:28,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:28,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500252201] [2022-09-20 22:20:28,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500252201] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:28,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:28,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:20:28,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242437964] [2022-09-20 22:20:28,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:28,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:20:28,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:28,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:20:28,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:20:28,346 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183 [2022-09-20 22:20:28,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 172 transitions, 408 flow. Second operand has 7 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:28,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:28,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183 [2022-09-20 22:20:28,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:28,874 INFO L130 PetriNetUnfolder]: 1247/3138 cut-off events. [2022-09-20 22:20:28,875 INFO L131 PetriNetUnfolder]: For 424/435 co-relation queries the response was YES. [2022-09-20 22:20:28,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5547 conditions, 3138 events. 1247/3138 cut-off events. For 424/435 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 25393 event pairs, 89 based on Foata normal form. 124/3132 useless extension candidates. Maximal degree in co-relation 5389. Up to 1003 conditions per place. [2022-09-20 22:20:28,897 INFO L137 encePairwiseOnDemand]: 160/183 looper letters, 104 selfloop transitions, 35 changer transitions 0/266 dead transitions. [2022-09-20 22:20:28,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 266 transitions, 930 flow [2022-09-20 22:20:28,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 22:20:28,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 22:20:28,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1479 transitions. [2022-09-20 22:20:28,900 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8081967213114755 [2022-09-20 22:20:28,900 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1479 transitions. [2022-09-20 22:20:28,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1479 transitions. [2022-09-20 22:20:28,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:28,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1479 transitions. [2022-09-20 22:20:28,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 147.9) internal successors, (1479), 10 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:28,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:28,906 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:28,906 INFO L175 Difference]: Start difference. First operand has 168 places, 172 transitions, 408 flow. Second operand 10 states and 1479 transitions. [2022-09-20 22:20:28,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 266 transitions, 930 flow [2022-09-20 22:20:28,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 266 transitions, 930 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-09-20 22:20:28,912 INFO L231 Difference]: Finished difference. Result has 184 places, 209 transitions, 713 flow [2022-09-20 22:20:28,912 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=713, PETRI_PLACES=184, PETRI_TRANSITIONS=209} [2022-09-20 22:20:28,913 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 24 predicate places. [2022-09-20 22:20:28,913 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 209 transitions, 713 flow [2022-09-20 22:20:28,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:28,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:28,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:28,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 22:20:28,914 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:28,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:28,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1109738777, now seen corresponding path program 1 times [2022-09-20 22:20:28,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:28,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527229970] [2022-09-20 22:20:28,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:28,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:28,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:28,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527229970] [2022-09-20 22:20:28,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527229970] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:28,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:28,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:20:28,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353542227] [2022-09-20 22:20:28,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:28,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:20:28,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:28,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:20:28,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:20:28,989 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 183 [2022-09-20 22:20:28,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 209 transitions, 713 flow. Second operand has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:28,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:28,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 183 [2022-09-20 22:20:28,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:29,936 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|) |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][230], [Black: 218#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= (+ (- 1) ~ctr1~0) 0)), Black: 216#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 212#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 210#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 102#L786-4true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, 119#L738true, 51#L744-3true, 195#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), 241#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 178#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), Black: 186#(= ~readerprogress1~0 0), Black: 214#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 92#L777true, Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0))]) [2022-09-20 22:20:29,936 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is not cut-off event [2022-09-20 22:20:29,937 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2022-09-20 22:20:29,937 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2022-09-20 22:20:29,937 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2022-09-20 22:20:30,044 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|) |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][230], [Black: 218#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= (+ (- 1) ~ctr1~0) 0)), Black: 216#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 212#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 210#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 102#L786-4true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, 51#L744-3true, 195#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), 241#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 178#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 21#L739true, Black: 186#(= ~readerprogress1~0 0), Black: 214#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 92#L777true, Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0))]) [2022-09-20 22:20:30,045 INFO L383 tUnfolder$Statistics]: this new event has 89 ancestors and is not cut-off event [2022-09-20 22:20:30,045 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is not cut-off event [2022-09-20 22:20:30,045 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is not cut-off event [2022-09-20 22:20:30,045 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2022-09-20 22:20:30,133 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|) |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][230], [Black: 218#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= (+ (- 1) ~ctr1~0) 0)), Black: 216#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 212#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 210#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, 119#L738true, 51#L744-3true, 195#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), 85#L787-1true, 241#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 178#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), Black: 214#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 92#L777true, Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0))]) [2022-09-20 22:20:30,133 INFO L383 tUnfolder$Statistics]: this new event has 91 ancestors and is not cut-off event [2022-09-20 22:20:30,133 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2022-09-20 22:20:30,133 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2022-09-20 22:20:30,133 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is not cut-off event [2022-09-20 22:20:30,179 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|) |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][230], [Black: 218#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= (+ (- 1) ~ctr1~0) 0)), Black: 216#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 212#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 210#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, 51#L744-3true, 195#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), 85#L787-1true, 241#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 178#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 21#L739true, Black: 214#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 92#L777true, Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0))]) [2022-09-20 22:20:30,179 INFO L383 tUnfolder$Statistics]: this new event has 92 ancestors and is not cut-off event [2022-09-20 22:20:30,180 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2022-09-20 22:20:30,180 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is not cut-off event [2022-09-20 22:20:30,180 INFO L386 tUnfolder$Statistics]: existing Event has 98 ancestors and is not cut-off event [2022-09-20 22:20:30,185 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|) |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][230], [Black: 218#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= (+ (- 1) ~ctr1~0) 0)), Black: 216#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 212#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 102#L786-4true, 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 210#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, 54#L758-3true, 241#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 178#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 21#L739true, Black: 214#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 92#L777true, Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0))]) [2022-09-20 22:20:30,185 INFO L383 tUnfolder$Statistics]: this new event has 92 ancestors and is not cut-off event [2022-09-20 22:20:30,185 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2022-09-20 22:20:30,185 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2022-09-20 22:20:30,185 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2022-09-20 22:20:30,353 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|) |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][230], [Black: 218#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= (+ (- 1) ~ctr1~0) 0)), Black: 216#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 212#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 210#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, 54#L758-3true, 85#L787-1true, 241#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 178#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 21#L739true, Black: 186#(= ~readerprogress1~0 0), Black: 214#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 92#L777true, Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0))]) [2022-09-20 22:20:30,353 INFO L383 tUnfolder$Statistics]: this new event has 95 ancestors and is not cut-off event [2022-09-20 22:20:30,353 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is not cut-off event [2022-09-20 22:20:30,353 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is not cut-off event [2022-09-20 22:20:30,353 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is not cut-off event [2022-09-20 22:20:30,558 INFO L130 PetriNetUnfolder]: 5391/12018 cut-off events. [2022-09-20 22:20:30,558 INFO L131 PetriNetUnfolder]: For 15566/15784 co-relation queries the response was YES. [2022-09-20 22:20:30,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29524 conditions, 12018 events. 5391/12018 cut-off events. For 15566/15784 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 115808 event pairs, 983 based on Foata normal form. 141/11503 useless extension candidates. Maximal degree in co-relation 26864. Up to 3025 conditions per place. [2022-09-20 22:20:30,645 INFO L137 encePairwiseOnDemand]: 173/183 looper letters, 164 selfloop transitions, 18 changer transitions 6/328 dead transitions. [2022-09-20 22:20:30,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 328 transitions, 1686 flow [2022-09-20 22:20:30,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 22:20:30,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 22:20:30,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1381 transitions. [2022-09-20 22:20:30,648 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7546448087431694 [2022-09-20 22:20:30,648 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1381 transitions. [2022-09-20 22:20:30,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1381 transitions. [2022-09-20 22:20:30,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:30,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1381 transitions. [2022-09-20 22:20:30,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 138.1) internal successors, (1381), 10 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:30,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:30,653 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:30,653 INFO L175 Difference]: Start difference. First operand has 184 places, 209 transitions, 713 flow. Second operand 10 states and 1381 transitions. [2022-09-20 22:20:30,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 328 transitions, 1686 flow [2022-09-20 22:20:30,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 328 transitions, 1684 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-09-20 22:20:30,683 INFO L231 Difference]: Finished difference. Result has 197 places, 225 transitions, 827 flow [2022-09-20 22:20:30,683 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=827, PETRI_PLACES=197, PETRI_TRANSITIONS=225} [2022-09-20 22:20:30,684 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 37 predicate places. [2022-09-20 22:20:30,684 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 225 transitions, 827 flow [2022-09-20 22:20:30,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:30,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:30,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:30,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-20 22:20:30,684 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:30,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:30,685 INFO L85 PathProgramCache]: Analyzing trace with hash -215654663, now seen corresponding path program 1 times [2022-09-20 22:20:30,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:30,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036367227] [2022-09-20 22:20:30,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:30,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:30,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:30,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:30,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036367227] [2022-09-20 22:20:30,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036367227] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:30,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:30,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 22:20:30,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082184165] [2022-09-20 22:20:30,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:30,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 22:20:30,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:30,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 22:20:30,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 22:20:30,722 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 183 [2022-09-20 22:20:30,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 225 transitions, 827 flow. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:30,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:30,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 183 [2022-09-20 22:20:30,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:31,198 INFO L130 PetriNetUnfolder]: 1350/4352 cut-off events. [2022-09-20 22:20:31,198 INFO L131 PetriNetUnfolder]: For 4710/4937 co-relation queries the response was YES. [2022-09-20 22:20:31,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9925 conditions, 4352 events. 1350/4352 cut-off events. For 4710/4937 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 41216 event pairs, 214 based on Foata normal form. 131/4139 useless extension candidates. Maximal degree in co-relation 9071. Up to 1071 conditions per place. [2022-09-20 22:20:31,224 INFO L137 encePairwiseOnDemand]: 181/183 looper letters, 57 selfloop transitions, 1 changer transitions 0/240 dead transitions. [2022-09-20 22:20:31,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 240 transitions, 1025 flow [2022-09-20 22:20:31,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 22:20:31,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 22:20:31,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2022-09-20 22:20:31,225 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9107468123861566 [2022-09-20 22:20:31,225 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2022-09-20 22:20:31,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2022-09-20 22:20:31,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:31,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2022-09-20 22:20:31,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:31,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:31,228 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:31,229 INFO L175 Difference]: Start difference. First operand has 197 places, 225 transitions, 827 flow. Second operand 3 states and 500 transitions. [2022-09-20 22:20:31,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 240 transitions, 1025 flow [2022-09-20 22:20:31,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 240 transitions, 1025 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-09-20 22:20:31,250 INFO L231 Difference]: Finished difference. Result has 200 places, 225 transitions, 832 flow [2022-09-20 22:20:31,250 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=200, PETRI_TRANSITIONS=225} [2022-09-20 22:20:31,251 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 40 predicate places. [2022-09-20 22:20:31,251 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 225 transitions, 832 flow [2022-09-20 22:20:31,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:31,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:31,251 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:31,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-20 22:20:31,251 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:31,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:31,252 INFO L85 PathProgramCache]: Analyzing trace with hash 746303518, now seen corresponding path program 1 times [2022-09-20 22:20:31,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:31,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314117143] [2022-09-20 22:20:31,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:31,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:31,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:31,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:31,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314117143] [2022-09-20 22:20:31,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314117143] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:31,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:31,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 22:20:31,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148546299] [2022-09-20 22:20:31,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:31,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 22:20:31,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:31,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 22:20:31,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 22:20:31,309 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 183 [2022-09-20 22:20:31,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 225 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:31,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:31,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 183 [2022-09-20 22:20:31,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:31,620 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1| |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|) (= v_~ctr1~0_87 v_~ctr1~0_86) (not .cse0)) (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1| |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|) .cse0 (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) (= v_~ctr2~0_89 v_~ctr2~0_88))))) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][203], [210#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 109#L787-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 54#L758-3true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 257#(= ~readerprogress2~0 2), Black: 214#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 218#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= (+ (- 1) ~ctr1~0) 0)), Black: 216#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 212#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 252#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, 227#true, Black: 235#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 241#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 178#true, Black: 229#(= ~readerprogress1~0 0), Black: 230#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 237#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 93#L767-10true, Black: 186#(= ~readerprogress1~0 0)]) [2022-09-20 22:20:31,620 INFO L383 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-09-20 22:20:31,620 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-09-20 22:20:31,620 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-09-20 22:20:31,620 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-09-20 22:20:31,681 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1| |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|) (= v_~ctr1~0_87 v_~ctr1~0_86) (not .cse0)) (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1| |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|) .cse0 (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) (= v_~ctr2~0_89 v_~ctr2~0_88))))) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][203], [210#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 50#L772-2true, 109#L787-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 54#L758-3true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 257#(= ~readerprogress2~0 2), Black: 214#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 218#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= (+ (- 1) ~ctr1~0) 0)), Black: 216#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 212#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 252#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, 227#true, Black: 235#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 241#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 178#true, Black: 229#(= ~readerprogress1~0 0), Black: 230#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 237#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 186#(= ~readerprogress1~0 0)]) [2022-09-20 22:20:31,682 INFO L383 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-09-20 22:20:31,682 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-09-20 22:20:31,682 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-09-20 22:20:31,682 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-09-20 22:20:31,682 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1| |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|) (= v_~ctr1~0_87 v_~ctr1~0_86) (not .cse0)) (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1| |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|) .cse0 (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) (= v_~ctr2~0_89 v_~ctr2~0_88))))) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][203], [210#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 109#L787-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 54#L758-3true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 165#L771-3true, 257#(= ~readerprogress2~0 2), Black: 214#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 218#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= (+ (- 1) ~ctr1~0) 0)), Black: 216#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 212#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 252#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, 227#true, Black: 235#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 241#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 178#true, Black: 229#(= ~readerprogress1~0 0), Black: 230#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 237#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 186#(= ~readerprogress1~0 0)]) [2022-09-20 22:20:31,682 INFO L383 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-09-20 22:20:31,682 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-09-20 22:20:31,683 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-09-20 22:20:31,683 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-09-20 22:20:31,762 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1| |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|) (= v_~ctr1~0_87 v_~ctr1~0_86) (not .cse0)) (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1| |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|) .cse0 (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) (= v_~ctr2~0_89 v_~ctr2~0_88))))) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][203], [210#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 50#L772-2true, Black: 191#(= ~readerprogress2~0 0), 109#L787-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 54#L758-3true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 257#(= ~readerprogress2~0 2), Black: 214#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 218#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= (+ (- 1) ~ctr1~0) 0)), Black: 216#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 212#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 252#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, 227#true, Black: 235#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 241#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 178#true, Black: 229#(= ~readerprogress1~0 0), Black: 230#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 237#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 186#(= ~readerprogress1~0 0)]) [2022-09-20 22:20:31,762 INFO L383 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-09-20 22:20:31,762 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-09-20 22:20:31,762 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-09-20 22:20:31,762 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-09-20 22:20:31,762 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-09-20 22:20:31,763 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1| |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|) (= v_~ctr1~0_87 v_~ctr1~0_86) (not .cse0)) (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1| |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|) .cse0 (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) (= v_~ctr2~0_89 v_~ctr2~0_88))))) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][203], [192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 210#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 191#(= ~readerprogress2~0 0), 109#L787-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 54#L758-3true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 165#L771-3true, 257#(= ~readerprogress2~0 2), Black: 214#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 218#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= (+ (- 1) ~ctr1~0) 0)), Black: 216#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 212#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 252#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, 227#true, Black: 235#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 241#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 178#true, Black: 229#(= ~readerprogress1~0 0), Black: 230#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 237#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 186#(= ~readerprogress1~0 0)]) [2022-09-20 22:20:31,763 INFO L383 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-09-20 22:20:31,763 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-09-20 22:20:31,763 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-09-20 22:20:31,763 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-09-20 22:20:31,763 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-09-20 22:20:31,786 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([839] L777-->L777-3: Formula: (and (= |v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1_3| |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_5|) (= |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_4| |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (= |v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1_3| |v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1_3|) (= |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_4| |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_3|)) InVars {qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_3|, qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_5|} OutVars{qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_4|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_5|, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1=|v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1_3|, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1=|v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1_3|, qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1=|v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1_3|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1, qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1][202], [192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 210#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 109#L787-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 257#(= ~readerprogress2~0 2), 128#L777-3true, 58#L758true, Black: 214#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 218#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= (+ (- 1) ~ctr1~0) 0)), Black: 216#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 212#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 252#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, 227#true, Black: 235#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 241#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 178#true, Black: 229#(= ~readerprogress1~0 0), Black: 230#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 237#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 186#(= ~readerprogress1~0 0)]) [2022-09-20 22:20:31,786 INFO L383 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event [2022-09-20 22:20:31,786 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-09-20 22:20:31,786 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-09-20 22:20:31,786 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-09-20 22:20:31,818 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([839] L777-->L777-3: Formula: (and (= |v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1_3| |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_5|) (= |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_4| |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (= |v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1_3| |v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1_3|) (= |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_4| |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_3|)) InVars {qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_3|, qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_5|} OutVars{qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_4|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_5|, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1=|v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1_3|, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1=|v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1_3|, qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1=|v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1_3|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1, qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1][164], [192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 210#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 191#(= ~readerprogress2~0 0), 109#L787-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 128#L777-3true, Black: 214#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 218#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= (+ (- 1) ~ctr1~0) 0)), Black: 216#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 212#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 252#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, 227#true, Black: 235#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 241#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 178#true, Black: 229#(= ~readerprogress1~0 0), 255#true, 28#L757true, Black: 230#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 237#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 186#(= ~readerprogress1~0 0)]) [2022-09-20 22:20:31,818 INFO L383 tUnfolder$Statistics]: this new event has 106 ancestors and is cut-off event [2022-09-20 22:20:31,818 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-09-20 22:20:31,818 INFO L386 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-09-20 22:20:31,818 INFO L386 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-09-20 22:20:31,818 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([839] L777-->L777-3: Formula: (and (= |v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1_3| |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_5|) (= |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_4| |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (= |v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1_3| |v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1_3|) (= |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_4| |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_3|)) InVars {qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_3|, qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_5|} OutVars{qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_4|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_5|, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1=|v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1_3|, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1=|v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1_3|, qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1=|v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1_3|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1, qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1][202], [192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 210#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 191#(= ~readerprogress2~0 0), 109#L787-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 257#(= ~readerprogress2~0 2), 128#L777-3true, 58#L758true, Black: 214#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 218#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= (+ (- 1) ~ctr1~0) 0)), Black: 216#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 212#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 252#(= ~readerprogress1~0 2), qrcu_updaterThread1of1ForFork0InUse, 227#true, Black: 235#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 241#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 178#true, Black: 229#(= ~readerprogress1~0 0), Black: 230#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 237#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 186#(= ~readerprogress1~0 0)]) [2022-09-20 22:20:31,818 INFO L383 tUnfolder$Statistics]: this new event has 107 ancestors and is cut-off event [2022-09-20 22:20:31,818 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-09-20 22:20:31,818 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-09-20 22:20:31,818 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-09-20 22:20:31,818 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-09-20 22:20:31,827 INFO L130 PetriNetUnfolder]: 1504/4658 cut-off events. [2022-09-20 22:20:31,827 INFO L131 PetriNetUnfolder]: For 4764/5026 co-relation queries the response was YES. [2022-09-20 22:20:31,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10486 conditions, 4658 events. 1504/4658 cut-off events. For 4764/5026 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 44390 event pairs, 228 based on Foata normal form. 126/4405 useless extension candidates. Maximal degree in co-relation 9655. Up to 1075 conditions per place. [2022-09-20 22:20:31,868 INFO L137 encePairwiseOnDemand]: 181/183 looper letters, 54 selfloop transitions, 1 changer transitions 0/240 dead transitions. [2022-09-20 22:20:31,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 240 transitions, 1027 flow [2022-09-20 22:20:31,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 22:20:31,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 22:20:31,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2022-09-20 22:20:31,870 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9107468123861566 [2022-09-20 22:20:31,870 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2022-09-20 22:20:31,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2022-09-20 22:20:31,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:31,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2022-09-20 22:20:31,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:31,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:31,872 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:31,872 INFO L175 Difference]: Start difference. First operand has 200 places, 225 transitions, 832 flow. Second operand 3 states and 500 transitions. [2022-09-20 22:20:31,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 240 transitions, 1027 flow [2022-09-20 22:20:31,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 240 transitions, 1026 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-09-20 22:20:31,884 INFO L231 Difference]: Finished difference. Result has 202 places, 225 transitions, 836 flow [2022-09-20 22:20:31,884 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=836, PETRI_PLACES=202, PETRI_TRANSITIONS=225} [2022-09-20 22:20:31,885 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 42 predicate places. [2022-09-20 22:20:31,885 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 225 transitions, 836 flow [2022-09-20 22:20:31,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:31,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:31,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:31,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-20 22:20:31,885 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:31,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:31,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1296054020, now seen corresponding path program 1 times [2022-09-20 22:20:31,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:31,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575812482] [2022-09-20 22:20:31,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:31,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:31,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:31,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:31,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575812482] [2022-09-20 22:20:31,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575812482] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:31,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:31,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-20 22:20:31,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246812589] [2022-09-20 22:20:31,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:31,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 22:20:31,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:31,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 22:20:31,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 22:20:31,923 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183 [2022-09-20 22:20:31,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 225 transitions, 836 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:31,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:31,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183 [2022-09-20 22:20:31,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:32,339 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([827] L766-8-->L767-10: Formula: (not (<= |v_qrcu_updaterThread1of1ForFork0_~sum~0#1_17| 1)) InVars {qrcu_updaterThread1of1ForFork0_~sum~0#1=|v_qrcu_updaterThread1of1ForFork0_~sum~0#1_17|} OutVars{qrcu_updaterThread1of1ForFork0_~sum~0#1=|v_qrcu_updaterThread1of1ForFork0_~sum~0#1_17|} AuxVars[] AssignedVars[][163], [262#(= ~idx~0 0), 210#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 109#L787-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 54#L758-3true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 257#(= ~readerprogress2~0 2), Black: 214#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 218#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= (+ (- 1) ~ctr1~0) 0)), Black: 216#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 212#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), qrcu_updaterThread1of1ForFork0InUse, 252#(= ~readerprogress1~0 2), 227#true, Black: 235#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 241#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 178#true, Black: 229#(= ~readerprogress1~0 0), Black: 230#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 237#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 93#L767-10true, Black: 186#(= ~readerprogress1~0 0)]) [2022-09-20 22:20:32,339 INFO L383 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-09-20 22:20:32,339 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-09-20 22:20:32,339 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-09-20 22:20:32,339 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-09-20 22:20:32,526 INFO L130 PetriNetUnfolder]: 1841/5595 cut-off events. [2022-09-20 22:20:32,526 INFO L131 PetriNetUnfolder]: For 6029/6248 co-relation queries the response was YES. [2022-09-20 22:20:32,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12385 conditions, 5595 events. 1841/5595 cut-off events. For 6029/6248 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 52849 event pairs, 348 based on Foata normal form. 41/5179 useless extension candidates. Maximal degree in co-relation 12013. Up to 1241 conditions per place. [2022-09-20 22:20:32,562 INFO L137 encePairwiseOnDemand]: 180/183 looper letters, 45 selfloop transitions, 2 changer transitions 43/233 dead transitions. [2022-09-20 22:20:32,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 233 transitions, 1028 flow [2022-09-20 22:20:32,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 22:20:32,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 22:20:32,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2022-09-20 22:20:32,564 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8943533697632058 [2022-09-20 22:20:32,564 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 491 transitions. [2022-09-20 22:20:32,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 491 transitions. [2022-09-20 22:20:32,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:32,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 491 transitions. [2022-09-20 22:20:32,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:32,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:32,566 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:32,566 INFO L175 Difference]: Start difference. First operand has 202 places, 225 transitions, 836 flow. Second operand 3 states and 491 transitions. [2022-09-20 22:20:32,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 233 transitions, 1028 flow [2022-09-20 22:20:32,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 233 transitions, 1027 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-09-20 22:20:32,579 INFO L231 Difference]: Finished difference. Result has 196 places, 177 transitions, 601 flow [2022-09-20 22:20:32,579 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=601, PETRI_PLACES=196, PETRI_TRANSITIONS=177} [2022-09-20 22:20:32,580 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 36 predicate places. [2022-09-20 22:20:32,580 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 177 transitions, 601 flow [2022-09-20 22:20:32,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:32,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:32,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:32,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-20 22:20:32,580 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:32,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:32,581 INFO L85 PathProgramCache]: Analyzing trace with hash 398592542, now seen corresponding path program 1 times [2022-09-20 22:20:32,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:32,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972633559] [2022-09-20 22:20:32,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:32,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:32,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:32,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972633559] [2022-09-20 22:20:32,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972633559] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:32,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:32,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-20 22:20:32,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535515083] [2022-09-20 22:20:32,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:32,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 22:20:32,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:32,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 22:20:32,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 22:20:32,606 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183 [2022-09-20 22:20:32,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 177 transitions, 601 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:32,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:32,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183 [2022-09-20 22:20:32,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:32,755 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([827] L766-8-->L767-10: Formula: (not (<= |v_qrcu_updaterThread1of1ForFork0_~sum~0#1_17| 1)) InVars {qrcu_updaterThread1of1ForFork0_~sum~0#1=|v_qrcu_updaterThread1of1ForFork0_~sum~0#1_17|} OutVars{qrcu_updaterThread1of1ForFork0_~sum~0#1=|v_qrcu_updaterThread1of1ForFork0_~sum~0#1_17|} AuxVars[] AssignedVars[][127], [262#(= ~idx~0 0), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 210#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 109#L787-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 54#L758-3true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 257#(= ~readerprogress2~0 2), Black: 214#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 264#true, Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 218#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= (+ (- 1) ~ctr1~0) 0)), Black: 216#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 212#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), qrcu_updaterThread1of1ForFork0InUse, 252#(= ~readerprogress1~0 2), 227#true, Black: 235#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 241#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 178#true, Black: 229#(= ~readerprogress1~0 0), Black: 230#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 237#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 93#L767-10true, Black: 186#(= ~readerprogress1~0 0)]) [2022-09-20 22:20:32,756 INFO L383 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-09-20 22:20:32,756 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-09-20 22:20:32,756 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-09-20 22:20:32,756 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-09-20 22:20:32,824 INFO L130 PetriNetUnfolder]: 623/2309 cut-off events. [2022-09-20 22:20:32,824 INFO L131 PetriNetUnfolder]: For 2073/2112 co-relation queries the response was YES. [2022-09-20 22:20:32,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4993 conditions, 2309 events. 623/2309 cut-off events. For 2073/2112 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 18924 event pairs, 124 based on Foata normal form. 10/2163 useless extension candidates. Maximal degree in co-relation 4748. Up to 502 conditions per place. [2022-09-20 22:20:32,841 INFO L137 encePairwiseOnDemand]: 181/183 looper letters, 45 selfloop transitions, 1 changer transitions 0/187 dead transitions. [2022-09-20 22:20:32,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 187 transitions, 763 flow [2022-09-20 22:20:32,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 22:20:32,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 22:20:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2022-09-20 22:20:32,842 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2022-09-20 22:20:32,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 488 transitions. [2022-09-20 22:20:32,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 488 transitions. [2022-09-20 22:20:32,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:32,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 488 transitions. [2022-09-20 22:20:32,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:32,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:32,844 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:32,844 INFO L175 Difference]: Start difference. First operand has 196 places, 177 transitions, 601 flow. Second operand 3 states and 488 transitions. [2022-09-20 22:20:32,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 187 transitions, 763 flow [2022-09-20 22:20:32,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 187 transitions, 729 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-09-20 22:20:32,851 INFO L231 Difference]: Finished difference. Result has 178 places, 174 transitions, 575 flow [2022-09-20 22:20:32,852 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=575, PETRI_PLACES=178, PETRI_TRANSITIONS=174} [2022-09-20 22:20:32,852 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 18 predicate places. [2022-09-20 22:20:32,852 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 174 transitions, 575 flow [2022-09-20 22:20:32,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:32,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:32,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:32,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-20 22:20:32,853 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:32,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:32,853 INFO L85 PathProgramCache]: Analyzing trace with hash 399605436, now seen corresponding path program 1 times [2022-09-20 22:20:32,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:32,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125238190] [2022-09-20 22:20:32,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:32,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:32,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:32,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:32,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125238190] [2022-09-20 22:20:32,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125238190] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:32,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:32,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-09-20 22:20:32,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327773867] [2022-09-20 22:20:32,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:32,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-09-20 22:20:32,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:32,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-09-20 22:20:32,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-09-20 22:20:32,895 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 183 [2022-09-20 22:20:32,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 174 transitions, 575 flow. Second operand has 5 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:32,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:32,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 183 [2022-09-20 22:20:32,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:33,293 INFO L130 PetriNetUnfolder]: 768/2673 cut-off events. [2022-09-20 22:20:33,293 INFO L131 PetriNetUnfolder]: For 2032/2075 co-relation queries the response was YES. [2022-09-20 22:20:33,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5954 conditions, 2673 events. 768/2673 cut-off events. For 2032/2075 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 23715 event pairs, 188 based on Foata normal form. 7/2589 useless extension candidates. Maximal degree in co-relation 5615. Up to 779 conditions per place. [2022-09-20 22:20:33,311 INFO L137 encePairwiseOnDemand]: 173/183 looper letters, 61 selfloop transitions, 24 changer transitions 15/233 dead transitions. [2022-09-20 22:20:33,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 233 transitions, 1067 flow [2022-09-20 22:20:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 22:20:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 22:20:33,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1118 transitions. [2022-09-20 22:20:33,330 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8727556596409055 [2022-09-20 22:20:33,330 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1118 transitions. [2022-09-20 22:20:33,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1118 transitions. [2022-09-20 22:20:33,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:33,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1118 transitions. [2022-09-20 22:20:33,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 159.71428571428572) internal successors, (1118), 7 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:33,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:33,335 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:33,335 INFO L175 Difference]: Start difference. First operand has 178 places, 174 transitions, 575 flow. Second operand 7 states and 1118 transitions. [2022-09-20 22:20:33,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 233 transitions, 1067 flow [2022-09-20 22:20:33,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 233 transitions, 1066 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-09-20 22:20:33,342 INFO L231 Difference]: Finished difference. Result has 187 places, 189 transitions, 753 flow [2022-09-20 22:20:33,359 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=753, PETRI_PLACES=187, PETRI_TRANSITIONS=189} [2022-09-20 22:20:33,361 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 27 predicate places. [2022-09-20 22:20:33,361 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 189 transitions, 753 flow [2022-09-20 22:20:33,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:33,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:33,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:33,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-20 22:20:33,364 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:33,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:33,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1200209448, now seen corresponding path program 1 times [2022-09-20 22:20:33,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:33,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269936540] [2022-09-20 22:20:33,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:33,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:33,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:33,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:33,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269936540] [2022-09-20 22:20:33,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269936540] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:33,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:33,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-20 22:20:33,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193496533] [2022-09-20 22:20:33,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:33,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 22:20:33,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:33,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 22:20:33,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-09-20 22:20:33,520 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-09-20 22:20:33,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 189 transitions, 753 flow. Second operand has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:33,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:33,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-09-20 22:20:33,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:34,347 INFO L130 PetriNetUnfolder]: 1747/4258 cut-off events. [2022-09-20 22:20:34,347 INFO L131 PetriNetUnfolder]: For 6743/6828 co-relation queries the response was YES. [2022-09-20 22:20:34,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12029 conditions, 4258 events. 1747/4258 cut-off events. For 6743/6828 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 35410 event pairs, 341 based on Foata normal form. 58/4206 useless extension candidates. Maximal degree in co-relation 11685. Up to 1767 conditions per place. [2022-09-20 22:20:34,380 INFO L137 encePairwiseOnDemand]: 169/183 looper letters, 125 selfloop transitions, 45 changer transitions 16/296 dead transitions. [2022-09-20 22:20:34,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 296 transitions, 1707 flow [2022-09-20 22:20:34,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-20 22:20:34,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-09-20 22:20:34,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1861 transitions. [2022-09-20 22:20:34,383 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7263856362217018 [2022-09-20 22:20:34,383 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1861 transitions. [2022-09-20 22:20:34,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1861 transitions. [2022-09-20 22:20:34,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:34,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1861 transitions. [2022-09-20 22:20:34,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 132.92857142857142) internal successors, (1861), 14 states have internal predecessors, (1861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:34,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 183.0) internal successors, (2745), 15 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:34,390 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 183.0) internal successors, (2745), 15 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:34,390 INFO L175 Difference]: Start difference. First operand has 187 places, 189 transitions, 753 flow. Second operand 14 states and 1861 transitions. [2022-09-20 22:20:34,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 296 transitions, 1707 flow [2022-09-20 22:20:34,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 296 transitions, 1699 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-09-20 22:20:34,410 INFO L231 Difference]: Finished difference. Result has 206 places, 214 transitions, 1085 flow [2022-09-20 22:20:34,410 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1085, PETRI_PLACES=206, PETRI_TRANSITIONS=214} [2022-09-20 22:20:34,411 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 46 predicate places. [2022-09-20 22:20:34,411 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 214 transitions, 1085 flow [2022-09-20 22:20:34,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:34,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:34,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:34,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-20 22:20:34,411 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:34,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:34,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1442984104, now seen corresponding path program 2 times [2022-09-20 22:20:34,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:34,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995004525] [2022-09-20 22:20:34,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:34,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:34,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:34,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:34,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995004525] [2022-09-20 22:20:34,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995004525] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:34,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:34,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-20 22:20:34,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884254373] [2022-09-20 22:20:34,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:34,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 22:20:34,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:34,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 22:20:34,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-09-20 22:20:34,573 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-09-20 22:20:34,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 214 transitions, 1085 flow. Second operand has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:34,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:34,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-09-20 22:20:34,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:35,334 INFO L130 PetriNetUnfolder]: 1740/4312 cut-off events. [2022-09-20 22:20:35,334 INFO L131 PetriNetUnfolder]: For 10100/10227 co-relation queries the response was YES. [2022-09-20 22:20:35,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13406 conditions, 4312 events. 1740/4312 cut-off events. For 10100/10227 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 36226 event pairs, 412 based on Foata normal form. 82/4255 useless extension candidates. Maximal degree in co-relation 13059. Up to 1655 conditions per place. [2022-09-20 22:20:35,367 INFO L137 encePairwiseOnDemand]: 168/183 looper letters, 122 selfloop transitions, 64 changer transitions 39/335 dead transitions. [2022-09-20 22:20:35,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 335 transitions, 2356 flow [2022-09-20 22:20:35,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-09-20 22:20:35,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-09-20 22:20:35,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2120 transitions. [2022-09-20 22:20:35,371 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7240437158469946 [2022-09-20 22:20:35,371 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2120 transitions. [2022-09-20 22:20:35,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2120 transitions. [2022-09-20 22:20:35,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:35,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2120 transitions. [2022-09-20 22:20:35,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 132.5) internal successors, (2120), 16 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:35,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 183.0) internal successors, (3111), 17 states have internal predecessors, (3111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:35,379 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 183.0) internal successors, (3111), 17 states have internal predecessors, (3111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:35,379 INFO L175 Difference]: Start difference. First operand has 206 places, 214 transitions, 1085 flow. Second operand 16 states and 2120 transitions. [2022-09-20 22:20:35,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 335 transitions, 2356 flow [2022-09-20 22:20:35,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 335 transitions, 2293 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-09-20 22:20:35,407 INFO L231 Difference]: Finished difference. Result has 223 places, 236 transitions, 1467 flow [2022-09-20 22:20:35,408 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1467, PETRI_PLACES=223, PETRI_TRANSITIONS=236} [2022-09-20 22:20:35,408 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 63 predicate places. [2022-09-20 22:20:35,408 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 236 transitions, 1467 flow [2022-09-20 22:20:35,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:35,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:35,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:35,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-09-20 22:20:35,409 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:35,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:35,409 INFO L85 PathProgramCache]: Analyzing trace with hash -2015600652, now seen corresponding path program 3 times [2022-09-20 22:20:35,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:35,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980871746] [2022-09-20 22:20:35,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:35,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:35,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:35,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:35,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980871746] [2022-09-20 22:20:35,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980871746] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:35,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:35,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-20 22:20:35,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674231598] [2022-09-20 22:20:35,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:35,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 22:20:35,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:35,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 22:20:35,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-09-20 22:20:35,514 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-09-20 22:20:35,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 236 transitions, 1467 flow. Second operand has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:35,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:35,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-09-20 22:20:35,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:36,264 INFO L130 PetriNetUnfolder]: 1400/3704 cut-off events. [2022-09-20 22:20:36,265 INFO L131 PetriNetUnfolder]: For 12119/12309 co-relation queries the response was YES. [2022-09-20 22:20:36,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11872 conditions, 3704 events. 1400/3704 cut-off events. For 12119/12309 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 31352 event pairs, 277 based on Foata normal form. 161/3743 useless extension candidates. Maximal degree in co-relation 11589. Up to 772 conditions per place. [2022-09-20 22:20:36,297 INFO L137 encePairwiseOnDemand]: 160/183 looper letters, 134 selfloop transitions, 58 changer transitions 44/346 dead transitions. [2022-09-20 22:20:36,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 346 transitions, 2615 flow [2022-09-20 22:20:36,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-09-20 22:20:36,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-09-20 22:20:36,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2144 transitions. [2022-09-20 22:20:36,303 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.73224043715847 [2022-09-20 22:20:36,303 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2144 transitions. [2022-09-20 22:20:36,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2144 transitions. [2022-09-20 22:20:36,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:36,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2144 transitions. [2022-09-20 22:20:36,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 134.0) internal successors, (2144), 16 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:36,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 183.0) internal successors, (3111), 17 states have internal predecessors, (3111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:36,324 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 183.0) internal successors, (3111), 17 states have internal predecessors, (3111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:36,324 INFO L175 Difference]: Start difference. First operand has 223 places, 236 transitions, 1467 flow. Second operand 16 states and 2144 transitions. [2022-09-20 22:20:36,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 346 transitions, 2615 flow [2022-09-20 22:20:36,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 346 transitions, 2529 flow, removed 40 selfloop flow, removed 2 redundant places. [2022-09-20 22:20:36,380 INFO L231 Difference]: Finished difference. Result has 242 places, 241 transitions, 1636 flow [2022-09-20 22:20:36,380 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1395, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1636, PETRI_PLACES=242, PETRI_TRANSITIONS=241} [2022-09-20 22:20:36,381 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 82 predicate places. [2022-09-20 22:20:36,381 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 241 transitions, 1636 flow [2022-09-20 22:20:36,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:36,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:36,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:36,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-09-20 22:20:36,382 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:36,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:36,382 INFO L85 PathProgramCache]: Analyzing trace with hash 785633974, now seen corresponding path program 1 times [2022-09-20 22:20:36,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:36,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198764617] [2022-09-20 22:20:36,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:36,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:36,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:36,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:36,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198764617] [2022-09-20 22:20:36,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198764617] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:36,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:36,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-20 22:20:36,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613964558] [2022-09-20 22:20:36,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:36,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 22:20:36,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:36,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 22:20:36,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-09-20 22:20:36,510 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-09-20 22:20:36,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 241 transitions, 1636 flow. Second operand has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:36,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:36,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-09-20 22:20:36,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:37,328 INFO L130 PetriNetUnfolder]: 1294/3617 cut-off events. [2022-09-20 22:20:37,329 INFO L131 PetriNetUnfolder]: For 13693/13814 co-relation queries the response was YES. [2022-09-20 22:20:37,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11883 conditions, 3617 events. 1294/3617 cut-off events. For 13693/13814 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 30677 event pairs, 124 based on Foata normal form. 132/3630 useless extension candidates. Maximal degree in co-relation 11837. Up to 507 conditions per place. [2022-09-20 22:20:37,366 INFO L137 encePairwiseOnDemand]: 160/183 looper letters, 145 selfloop transitions, 65 changer transitions 48/368 dead transitions. [2022-09-20 22:20:37,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 368 transitions, 3010 flow [2022-09-20 22:20:37,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-09-20 22:20:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-09-20 22:20:37,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2152 transitions. [2022-09-20 22:20:37,369 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7349726775956285 [2022-09-20 22:20:37,369 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2152 transitions. [2022-09-20 22:20:37,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2152 transitions. [2022-09-20 22:20:37,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:37,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2152 transitions. [2022-09-20 22:20:37,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 134.5) internal successors, (2152), 16 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:37,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 183.0) internal successors, (3111), 17 states have internal predecessors, (3111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:37,376 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 183.0) internal successors, (3111), 17 states have internal predecessors, (3111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:37,376 INFO L175 Difference]: Start difference. First operand has 242 places, 241 transitions, 1636 flow. Second operand 16 states and 2152 transitions. [2022-09-20 22:20:37,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 368 transitions, 3010 flow [2022-09-20 22:20:37,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 368 transitions, 2873 flow, removed 42 selfloop flow, removed 6 redundant places. [2022-09-20 22:20:37,420 INFO L231 Difference]: Finished difference. Result has 259 places, 254 transitions, 1929 flow [2022-09-20 22:20:37,420 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1929, PETRI_PLACES=259, PETRI_TRANSITIONS=254} [2022-09-20 22:20:37,421 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 99 predicate places. [2022-09-20 22:20:37,421 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 254 transitions, 1929 flow [2022-09-20 22:20:37,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:37,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:37,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:37,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-09-20 22:20:37,421 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:37,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:37,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1687003644, now seen corresponding path program 1 times [2022-09-20 22:20:37,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:37,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502843959] [2022-09-20 22:20:37,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:37,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:37,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:37,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:37,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502843959] [2022-09-20 22:20:37,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502843959] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:37,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:37,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-20 22:20:37,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280495678] [2022-09-20 22:20:37,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:37,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-20 22:20:37,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:37,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-20 22:20:37,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-09-20 22:20:37,541 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-09-20 22:20:37,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 254 transitions, 1929 flow. Second operand has 10 states, 10 states have (on average 125.2) internal successors, (1252), 10 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:37,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:37,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-09-20 22:20:37,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:38,295 INFO L130 PetriNetUnfolder]: 1111/3214 cut-off events. [2022-09-20 22:20:38,295 INFO L131 PetriNetUnfolder]: For 16752/16798 co-relation queries the response was YES. [2022-09-20 22:20:38,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11863 conditions, 3214 events. 1111/3214 cut-off events. For 16752/16798 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 26894 event pairs, 231 based on Foata normal form. 52/3145 useless extension candidates. Maximal degree in co-relation 11809. Up to 954 conditions per place. [2022-09-20 22:20:38,323 INFO L137 encePairwiseOnDemand]: 167/183 looper letters, 150 selfloop transitions, 68 changer transitions 18/346 dead transitions. [2022-09-20 22:20:38,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 346 transitions, 3105 flow [2022-09-20 22:20:38,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-20 22:20:38,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-09-20 22:20:38,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1618 transitions. [2022-09-20 22:20:38,343 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7367941712204007 [2022-09-20 22:20:38,344 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1618 transitions. [2022-09-20 22:20:38,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1618 transitions. [2022-09-20 22:20:38,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:38,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1618 transitions. [2022-09-20 22:20:38,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 134.83333333333334) internal successors, (1618), 12 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:38,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:38,349 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:38,349 INFO L175 Difference]: Start difference. First operand has 259 places, 254 transitions, 1929 flow. Second operand 12 states and 1618 transitions. [2022-09-20 22:20:38,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 346 transitions, 3105 flow [2022-09-20 22:20:38,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 346 transitions, 3036 flow, removed 33 selfloop flow, removed 2 redundant places. [2022-09-20 22:20:38,464 INFO L231 Difference]: Finished difference. Result has 272 places, 268 transitions, 2288 flow [2022-09-20 22:20:38,464 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1884, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2288, PETRI_PLACES=272, PETRI_TRANSITIONS=268} [2022-09-20 22:20:38,465 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 112 predicate places. [2022-09-20 22:20:38,465 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 268 transitions, 2288 flow [2022-09-20 22:20:38,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 125.2) internal successors, (1252), 10 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:38,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:38,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:38,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-09-20 22:20:38,465 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:38,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:38,466 INFO L85 PathProgramCache]: Analyzing trace with hash 965053244, now seen corresponding path program 2 times [2022-09-20 22:20:38,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:38,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905909904] [2022-09-20 22:20:38,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:38,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:38,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:38,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:38,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905909904] [2022-09-20 22:20:38,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905909904] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:38,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:38,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-20 22:20:38,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211977730] [2022-09-20 22:20:38,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:38,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 22:20:38,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:38,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 22:20:38,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-09-20 22:20:38,647 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-09-20 22:20:38,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 268 transitions, 2288 flow. Second operand has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:38,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:38,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-09-20 22:20:38,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:39,408 INFO L130 PetriNetUnfolder]: 942/2877 cut-off events. [2022-09-20 22:20:39,409 INFO L131 PetriNetUnfolder]: For 17171/17311 co-relation queries the response was YES. [2022-09-20 22:20:39,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10924 conditions, 2877 events. 942/2877 cut-off events. For 17171/17311 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 24036 event pairs, 159 based on Foata normal form. 103/2860 useless extension candidates. Maximal degree in co-relation 10866. Up to 767 conditions per place. [2022-09-20 22:20:39,447 INFO L137 encePairwiseOnDemand]: 169/183 looper letters, 134 selfloop transitions, 74 changer transitions 22/335 dead transitions. [2022-09-20 22:20:39,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 335 transitions, 3159 flow [2022-09-20 22:20:39,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-20 22:20:39,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-09-20 22:20:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1982 transitions. [2022-09-20 22:20:39,450 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.722040072859745 [2022-09-20 22:20:39,450 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1982 transitions. [2022-09-20 22:20:39,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1982 transitions. [2022-09-20 22:20:39,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:39,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1982 transitions. [2022-09-20 22:20:39,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 132.13333333333333) internal successors, (1982), 15 states have internal predecessors, (1982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:39,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 183.0) internal successors, (2928), 16 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:39,467 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 183.0) internal successors, (2928), 16 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:39,468 INFO L175 Difference]: Start difference. First operand has 272 places, 268 transitions, 2288 flow. Second operand 15 states and 1982 transitions. [2022-09-20 22:20:39,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 335 transitions, 3159 flow [2022-09-20 22:20:39,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 335 transitions, 3084 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-09-20 22:20:39,529 INFO L231 Difference]: Finished difference. Result has 279 places, 254 transitions, 2264 flow [2022-09-20 22:20:39,530 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2191, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2264, PETRI_PLACES=279, PETRI_TRANSITIONS=254} [2022-09-20 22:20:39,530 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 119 predicate places. [2022-09-20 22:20:39,530 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 254 transitions, 2264 flow [2022-09-20 22:20:39,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:39,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:39,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:39,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-09-20 22:20:39,531 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:39,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:39,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1790395869, now seen corresponding path program 1 times [2022-09-20 22:20:39,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:39,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532169450] [2022-09-20 22:20:39,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:39,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:39,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:39,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532169450] [2022-09-20 22:20:39,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532169450] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:39,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:39,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:20:39,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688486731] [2022-09-20 22:20:39,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:39,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:20:39,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:39,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:20:39,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:20:39,618 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-09-20 22:20:39,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 254 transitions, 2264 flow. Second operand has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:39,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:39,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-09-20 22:20:39,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:40,062 INFO L130 PetriNetUnfolder]: 592/2066 cut-off events. [2022-09-20 22:20:40,063 INFO L131 PetriNetUnfolder]: For 12665/12739 co-relation queries the response was YES. [2022-09-20 22:20:40,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7621 conditions, 2066 events. 592/2066 cut-off events. For 12665/12739 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 15955 event pairs, 72 based on Foata normal form. 39/2032 useless extension candidates. Maximal degree in co-relation 7564. Up to 299 conditions per place. [2022-09-20 22:20:40,088 INFO L137 encePairwiseOnDemand]: 173/183 looper letters, 107 selfloop transitions, 36 changer transitions 47/322 dead transitions. [2022-09-20 22:20:40,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 322 transitions, 3174 flow [2022-09-20 22:20:40,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 22:20:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 22:20:40,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1626 transitions. [2022-09-20 22:20:40,090 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8077496274217586 [2022-09-20 22:20:40,091 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1626 transitions. [2022-09-20 22:20:40,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1626 transitions. [2022-09-20 22:20:40,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:40,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1626 transitions. [2022-09-20 22:20:40,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 147.8181818181818) internal successors, (1626), 11 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:40,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:40,094 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:40,094 INFO L175 Difference]: Start difference. First operand has 279 places, 254 transitions, 2264 flow. Second operand 11 states and 1626 transitions. [2022-09-20 22:20:40,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 322 transitions, 3174 flow [2022-09-20 22:20:40,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 322 transitions, 2997 flow, removed 11 selfloop flow, removed 13 redundant places. [2022-09-20 22:20:40,133 INFO L231 Difference]: Finished difference. Result has 274 places, 235 transitions, 1938 flow [2022-09-20 22:20:40,134 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2110, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1938, PETRI_PLACES=274, PETRI_TRANSITIONS=235} [2022-09-20 22:20:40,134 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 114 predicate places. [2022-09-20 22:20:40,134 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 235 transitions, 1938 flow [2022-09-20 22:20:40,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:40,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:40,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:40,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-09-20 22:20:40,135 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:40,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:40,135 INFO L85 PathProgramCache]: Analyzing trace with hash 988357513, now seen corresponding path program 1 times [2022-09-20 22:20:40,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:40,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547788997] [2022-09-20 22:20:40,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:40,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:40,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:40,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:40,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547788997] [2022-09-20 22:20:40,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547788997] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:40,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:40,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:20:40,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478406266] [2022-09-20 22:20:40,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:40,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:20:40,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:40,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:20:40,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:20:40,209 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-09-20 22:20:40,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 235 transitions, 1938 flow. Second operand has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:40,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:40,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-09-20 22:20:40,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:40,669 INFO L130 PetriNetUnfolder]: 557/1911 cut-off events. [2022-09-20 22:20:40,669 INFO L131 PetriNetUnfolder]: For 10165/10216 co-relation queries the response was YES. [2022-09-20 22:20:40,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6975 conditions, 1911 events. 557/1911 cut-off events. For 10165/10216 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 14191 event pairs, 92 based on Foata normal form. 25/1857 useless extension candidates. Maximal degree in co-relation 6916. Up to 314 conditions per place. [2022-09-20 22:20:40,689 INFO L137 encePairwiseOnDemand]: 171/183 looper letters, 110 selfloop transitions, 44 changer transitions 23/309 dead transitions. [2022-09-20 22:20:40,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 309 transitions, 2965 flow [2022-09-20 22:20:40,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-20 22:20:40,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-09-20 22:20:40,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1767 transitions. [2022-09-20 22:20:40,695 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8046448087431693 [2022-09-20 22:20:40,695 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1767 transitions. [2022-09-20 22:20:40,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1767 transitions. [2022-09-20 22:20:40,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:40,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1767 transitions. [2022-09-20 22:20:40,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 147.25) internal successors, (1767), 12 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:40,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:40,699 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:40,699 INFO L175 Difference]: Start difference. First operand has 274 places, 235 transitions, 1938 flow. Second operand 12 states and 1767 transitions. [2022-09-20 22:20:40,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 309 transitions, 2965 flow [2022-09-20 22:20:40,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 309 transitions, 2640 flow, removed 29 selfloop flow, removed 26 redundant places. [2022-09-20 22:20:40,725 INFO L231 Difference]: Finished difference. Result has 265 places, 248 transitions, 1973 flow [2022-09-20 22:20:40,725 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1713, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1973, PETRI_PLACES=265, PETRI_TRANSITIONS=248} [2022-09-20 22:20:40,726 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 105 predicate places. [2022-09-20 22:20:40,726 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 248 transitions, 1973 flow [2022-09-20 22:20:40,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:40,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:40,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:40,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-09-20 22:20:40,726 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:40,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:40,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1814913113, now seen corresponding path program 2 times [2022-09-20 22:20:40,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:40,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393646037] [2022-09-20 22:20:40,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:40,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:40,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:40,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393646037] [2022-09-20 22:20:40,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393646037] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:40,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:40,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:20:40,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540468137] [2022-09-20 22:20:40,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:40,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:20:40,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:40,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:20:40,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:20:40,805 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-09-20 22:20:40,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 248 transitions, 1973 flow. Second operand has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:40,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:40,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-09-20 22:20:40,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:41,178 INFO L130 PetriNetUnfolder]: 580/2032 cut-off events. [2022-09-20 22:20:41,179 INFO L131 PetriNetUnfolder]: For 9553/9652 co-relation queries the response was YES. [2022-09-20 22:20:41,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7159 conditions, 2032 events. 580/2032 cut-off events. For 9553/9652 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 15682 event pairs, 91 based on Foata normal form. 57/1990 useless extension candidates. Maximal degree in co-relation 7108. Up to 310 conditions per place. [2022-09-20 22:20:41,201 INFO L137 encePairwiseOnDemand]: 172/183 looper letters, 103 selfloop transitions, 52 changer transitions 40/327 dead transitions. [2022-09-20 22:20:41,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 327 transitions, 3071 flow [2022-09-20 22:20:41,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-20 22:20:41,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-09-20 22:20:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1770 transitions. [2022-09-20 22:20:41,203 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8060109289617486 [2022-09-20 22:20:41,203 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1770 transitions. [2022-09-20 22:20:41,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1770 transitions. [2022-09-20 22:20:41,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:41,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1770 transitions. [2022-09-20 22:20:41,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 147.5) internal successors, (1770), 12 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:41,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:41,207 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:41,207 INFO L175 Difference]: Start difference. First operand has 265 places, 248 transitions, 1973 flow. Second operand 12 states and 1770 transitions. [2022-09-20 22:20:41,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 327 transitions, 3071 flow [2022-09-20 22:20:41,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 327 transitions, 3027 flow, removed 18 selfloop flow, removed 1 redundant places. [2022-09-20 22:20:41,235 INFO L231 Difference]: Finished difference. Result has 280 places, 253 transitions, 2158 flow [2022-09-20 22:20:41,235 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1939, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2158, PETRI_PLACES=280, PETRI_TRANSITIONS=253} [2022-09-20 22:20:41,236 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 120 predicate places. [2022-09-20 22:20:41,237 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 253 transitions, 2158 flow [2022-09-20 22:20:41,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:41,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:41,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:41,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-09-20 22:20:41,237 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:41,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:41,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2050046725, now seen corresponding path program 2 times [2022-09-20 22:20:41,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:41,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240518723] [2022-09-20 22:20:41,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:41,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:41,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:41,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240518723] [2022-09-20 22:20:41,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240518723] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:41,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:41,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-09-20 22:20:41,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238131110] [2022-09-20 22:20:41,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:41,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-20 22:20:41,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:41,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-20 22:20:41,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-20 22:20:41,276 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2022-09-20 22:20:41,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 253 transitions, 2158 flow. Second operand has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:41,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:41,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2022-09-20 22:20:41,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:41,559 INFO L130 PetriNetUnfolder]: 461/1986 cut-off events. [2022-09-20 22:20:41,559 INFO L131 PetriNetUnfolder]: For 11319/11402 co-relation queries the response was YES. [2022-09-20 22:20:41,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6919 conditions, 1986 events. 461/1986 cut-off events. For 11319/11402 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 15732 event pairs, 98 based on Foata normal form. 50/1921 useless extension candidates. Maximal degree in co-relation 6862. Up to 363 conditions per place. [2022-09-20 22:20:41,578 INFO L137 encePairwiseOnDemand]: 180/183 looper letters, 89 selfloop transitions, 10 changer transitions 9/274 dead transitions. [2022-09-20 22:20:41,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 274 transitions, 2571 flow [2022-09-20 22:20:41,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-20 22:20:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-09-20 22:20:41,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 643 transitions. [2022-09-20 22:20:41,579 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8784153005464481 [2022-09-20 22:20:41,579 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 643 transitions. [2022-09-20 22:20:41,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 643 transitions. [2022-09-20 22:20:41,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:41,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 643 transitions. [2022-09-20 22:20:41,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.75) internal successors, (643), 4 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:41,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:41,581 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:41,581 INFO L175 Difference]: Start difference. First operand has 280 places, 253 transitions, 2158 flow. Second operand 4 states and 643 transitions. [2022-09-20 22:20:41,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 274 transitions, 2571 flow [2022-09-20 22:20:41,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 274 transitions, 2435 flow, removed 17 selfloop flow, removed 8 redundant places. [2022-09-20 22:20:41,610 INFO L231 Difference]: Finished difference. Result has 277 places, 252 transitions, 2068 flow [2022-09-20 22:20:41,610 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2032, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2068, PETRI_PLACES=277, PETRI_TRANSITIONS=252} [2022-09-20 22:20:41,610 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 117 predicate places. [2022-09-20 22:20:41,610 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 252 transitions, 2068 flow [2022-09-20 22:20:41,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:41,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:41,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:41,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-09-20 22:20:41,611 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:41,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:41,611 INFO L85 PathProgramCache]: Analyzing trace with hash 437814293, now seen corresponding path program 3 times [2022-09-20 22:20:41,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:41,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606980826] [2022-09-20 22:20:41,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:41,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:41,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:41,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:41,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606980826] [2022-09-20 22:20:41,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606980826] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:41,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:41,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:20:41,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357300199] [2022-09-20 22:20:41,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:41,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:20:41,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:41,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:20:41,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:20:41,682 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-09-20 22:20:41,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 252 transitions, 2068 flow. Second operand has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:41,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:41,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-09-20 22:20:41,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:42,087 INFO L130 PetriNetUnfolder]: 528/2045 cut-off events. [2022-09-20 22:20:42,087 INFO L131 PetriNetUnfolder]: For 11747/11937 co-relation queries the response was YES. [2022-09-20 22:20:42,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7317 conditions, 2045 events. 528/2045 cut-off events. For 11747/11937 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 16141 event pairs, 93 based on Foata normal form. 105/2039 useless extension candidates. Maximal degree in co-relation 7258. Up to 290 conditions per place. [2022-09-20 22:20:42,114 INFO L137 encePairwiseOnDemand]: 172/183 looper letters, 98 selfloop transitions, 52 changer transitions 44/326 dead transitions. [2022-09-20 22:20:42,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 326 transitions, 3227 flow [2022-09-20 22:20:42,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-20 22:20:42,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-09-20 22:20:42,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2048 transitions. [2022-09-20 22:20:42,117 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7993754879000781 [2022-09-20 22:20:42,117 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2048 transitions. [2022-09-20 22:20:42,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2048 transitions. [2022-09-20 22:20:42,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:42,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2048 transitions. [2022-09-20 22:20:42,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 146.28571428571428) internal successors, (2048), 14 states have internal predecessors, (2048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:42,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 183.0) internal successors, (2745), 15 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:42,121 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 183.0) internal successors, (2745), 15 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:42,121 INFO L175 Difference]: Start difference. First operand has 277 places, 252 transitions, 2068 flow. Second operand 14 states and 2048 transitions. [2022-09-20 22:20:42,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 326 transitions, 3227 flow [2022-09-20 22:20:42,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 326 transitions, 3165 flow, removed 22 selfloop flow, removed 4 redundant places. [2022-09-20 22:20:42,153 INFO L231 Difference]: Finished difference. Result has 291 places, 251 transitions, 2203 flow [2022-09-20 22:20:42,154 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1981, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2203, PETRI_PLACES=291, PETRI_TRANSITIONS=251} [2022-09-20 22:20:42,154 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 131 predicate places. [2022-09-20 22:20:42,154 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 251 transitions, 2203 flow [2022-09-20 22:20:42,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:42,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:42,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:42,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-09-20 22:20:42,155 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:42,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:42,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1928907313, now seen corresponding path program 1 times [2022-09-20 22:20:42,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:42,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308517008] [2022-09-20 22:20:42,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:42,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:42,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:42,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308517008] [2022-09-20 22:20:42,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308517008] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:42,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:42,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:20:42,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095294898] [2022-09-20 22:20:42,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:42,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:20:42,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:42,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:20:42,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:20:42,206 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-09-20 22:20:42,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 251 transitions, 2203 flow. Second operand has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:42,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:42,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-09-20 22:20:42,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:42,541 INFO L130 PetriNetUnfolder]: 453/1872 cut-off events. [2022-09-20 22:20:42,541 INFO L131 PetriNetUnfolder]: For 12018/12205 co-relation queries the response was YES. [2022-09-20 22:20:42,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6848 conditions, 1872 events. 453/1872 cut-off events. For 12018/12205 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 14309 event pairs, 85 based on Foata normal form. 111/1885 useless extension candidates. Maximal degree in co-relation 6786. Up to 284 conditions per place. [2022-09-20 22:20:42,563 INFO L137 encePairwiseOnDemand]: 173/183 looper letters, 90 selfloop transitions, 39 changer transitions 46/298 dead transitions. [2022-09-20 22:20:42,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 298 transitions, 2960 flow [2022-09-20 22:20:42,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 22:20:42,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 22:20:42,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1604 transitions. [2022-09-20 22:20:42,565 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7968206656731247 [2022-09-20 22:20:42,565 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1604 transitions. [2022-09-20 22:20:42,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1604 transitions. [2022-09-20 22:20:42,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:42,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1604 transitions. [2022-09-20 22:20:42,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 145.8181818181818) internal successors, (1604), 11 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:42,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:42,568 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:42,568 INFO L175 Difference]: Start difference. First operand has 291 places, 251 transitions, 2203 flow. Second operand 11 states and 1604 transitions. [2022-09-20 22:20:42,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 298 transitions, 2960 flow [2022-09-20 22:20:42,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 298 transitions, 2823 flow, removed 16 selfloop flow, removed 14 redundant places. [2022-09-20 22:20:42,603 INFO L231 Difference]: Finished difference. Result has 289 places, 225 transitions, 1782 flow [2022-09-20 22:20:42,603 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2075, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1782, PETRI_PLACES=289, PETRI_TRANSITIONS=225} [2022-09-20 22:20:42,603 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 129 predicate places. [2022-09-20 22:20:42,604 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 225 transitions, 1782 flow [2022-09-20 22:20:42,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:42,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:42,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:42,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-09-20 22:20:42,604 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:42,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:42,604 INFO L85 PathProgramCache]: Analyzing trace with hash 723996397, now seen corresponding path program 2 times [2022-09-20 22:20:42,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:42,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461823501] [2022-09-20 22:20:42,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:42,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:42,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:42,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:42,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461823501] [2022-09-20 22:20:42,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461823501] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:42,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:42,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:20:42,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092234634] [2022-09-20 22:20:42,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:42,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:20:42,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:42,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:20:42,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:20:42,661 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-09-20 22:20:42,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 225 transitions, 1782 flow. Second operand has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:42,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:42,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-09-20 22:20:42,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:42,942 INFO L130 PetriNetUnfolder]: 312/1424 cut-off events. [2022-09-20 22:20:42,942 INFO L131 PetriNetUnfolder]: For 7969/8099 co-relation queries the response was YES. [2022-09-20 22:20:42,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4966 conditions, 1424 events. 312/1424 cut-off events. For 7969/8099 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 9873 event pairs, 61 based on Foata normal form. 105/1442 useless extension candidates. Maximal degree in co-relation 4908. Up to 160 conditions per place. [2022-09-20 22:20:42,958 INFO L137 encePairwiseOnDemand]: 171/183 looper letters, 91 selfloop transitions, 43 changer transitions 31/282 dead transitions. [2022-09-20 22:20:42,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 282 transitions, 2723 flow [2022-09-20 22:20:42,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 22:20:42,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 22:20:42,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1612 transitions. [2022-09-20 22:20:42,960 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8007948335817189 [2022-09-20 22:20:42,960 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1612 transitions. [2022-09-20 22:20:42,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1612 transitions. [2022-09-20 22:20:42,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:42,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1612 transitions. [2022-09-20 22:20:42,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 146.54545454545453) internal successors, (1612), 11 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:42,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:42,963 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:42,963 INFO L175 Difference]: Start difference. First operand has 289 places, 225 transitions, 1782 flow. Second operand 11 states and 1612 transitions. [2022-09-20 22:20:42,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 282 transitions, 2723 flow [2022-09-20 22:20:42,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 282 transitions, 2367 flow, removed 22 selfloop flow, removed 27 redundant places. [2022-09-20 22:20:42,985 INFO L231 Difference]: Finished difference. Result has 276 places, 224 transitions, 1705 flow [2022-09-20 22:20:42,985 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1511, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1705, PETRI_PLACES=276, PETRI_TRANSITIONS=224} [2022-09-20 22:20:42,986 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 116 predicate places. [2022-09-20 22:20:42,986 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 224 transitions, 1705 flow [2022-09-20 22:20:42,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:42,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:42,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:42,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-09-20 22:20:42,986 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:42,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:42,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2089381894, now seen corresponding path program 1 times [2022-09-20 22:20:42,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:42,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012943991] [2022-09-20 22:20:42,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:42,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:43,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:43,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:43,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012943991] [2022-09-20 22:20:43,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012943991] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:43,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:43,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:20:43,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744084708] [2022-09-20 22:20:43,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:43,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:20:43,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:43,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:20:43,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:20:43,046 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-09-20 22:20:43,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 224 transitions, 1705 flow. Second operand has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:43,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:43,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-09-20 22:20:43,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:43,264 INFO L130 PetriNetUnfolder]: 243/1127 cut-off events. [2022-09-20 22:20:43,264 INFO L131 PetriNetUnfolder]: For 5568/5696 co-relation queries the response was YES. [2022-09-20 22:20:43,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3709 conditions, 1127 events. 243/1127 cut-off events. For 5568/5696 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 7139 event pairs, 52 based on Foata normal form. 96/1134 useless extension candidates. Maximal degree in co-relation 3654. Up to 142 conditions per place. [2022-09-20 22:20:43,274 INFO L137 encePairwiseOnDemand]: 173/183 looper letters, 47 selfloop transitions, 19 changer transitions 77/249 dead transitions. [2022-09-20 22:20:43,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 249 transitions, 2222 flow [2022-09-20 22:20:43,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 22:20:43,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 22:20:43,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1445 transitions. [2022-09-20 22:20:43,276 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7896174863387978 [2022-09-20 22:20:43,276 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1445 transitions. [2022-09-20 22:20:43,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1445 transitions. [2022-09-20 22:20:43,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:43,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1445 transitions. [2022-09-20 22:20:43,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 144.5) internal successors, (1445), 10 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:43,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:43,279 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:43,279 INFO L175 Difference]: Start difference. First operand has 276 places, 224 transitions, 1705 flow. Second operand 10 states and 1445 transitions. [2022-09-20 22:20:43,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 249 transitions, 2222 flow [2022-09-20 22:20:43,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 249 transitions, 2110 flow, removed 18 selfloop flow, removed 9 redundant places. [2022-09-20 22:20:43,297 INFO L231 Difference]: Finished difference. Result has 273 places, 163 transitions, 945 flow [2022-09-20 22:20:43,297 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1596, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=945, PETRI_PLACES=273, PETRI_TRANSITIONS=163} [2022-09-20 22:20:43,298 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 113 predicate places. [2022-09-20 22:20:43,298 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 163 transitions, 945 flow [2022-09-20 22:20:43,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:43,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:43,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:43,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-09-20 22:20:43,299 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:43,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:43,299 INFO L85 PathProgramCache]: Analyzing trace with hash -453330491, now seen corresponding path program 1 times [2022-09-20 22:20:43,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:43,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97518587] [2022-09-20 22:20:43,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:43,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:43,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:43,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:43,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97518587] [2022-09-20 22:20:43,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97518587] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:43,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:43,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:20:43,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044287908] [2022-09-20 22:20:43,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:43,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:20:43,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:43,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:20:43,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:20:43,362 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-09-20 22:20:43,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 163 transitions, 945 flow. Second operand has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:43,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:43,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-09-20 22:20:43,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:43,522 INFO L130 PetriNetUnfolder]: 171/760 cut-off events. [2022-09-20 22:20:43,523 INFO L131 PetriNetUnfolder]: For 3226/3261 co-relation queries the response was YES. [2022-09-20 22:20:43,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2459 conditions, 760 events. 171/760 cut-off events. For 3226/3261 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4086 event pairs, 49 based on Foata normal form. 27/728 useless extension candidates. Maximal degree in co-relation 2408. Up to 84 conditions per place. [2022-09-20 22:20:43,529 INFO L137 encePairwiseOnDemand]: 172/183 looper letters, 52 selfloop transitions, 29 changer transitions 17/204 dead transitions. [2022-09-20 22:20:43,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 204 transitions, 1531 flow [2022-09-20 22:20:43,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-20 22:20:43,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-09-20 22:20:43,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1729 transitions. [2022-09-20 22:20:43,532 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7873406193078324 [2022-09-20 22:20:43,532 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1729 transitions. [2022-09-20 22:20:43,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1729 transitions. [2022-09-20 22:20:43,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:43,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1729 transitions. [2022-09-20 22:20:43,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 144.08333333333334) internal successors, (1729), 12 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:43,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:43,536 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:43,536 INFO L175 Difference]: Start difference. First operand has 273 places, 163 transitions, 945 flow. Second operand 12 states and 1729 transitions. [2022-09-20 22:20:43,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 204 transitions, 1531 flow [2022-09-20 22:20:43,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 204 transitions, 1171 flow, removed 18 selfloop flow, removed 54 redundant places. [2022-09-20 22:20:43,545 INFO L231 Difference]: Finished difference. Result has 212 places, 171 transitions, 861 flow [2022-09-20 22:20:43,545 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=861, PETRI_PLACES=212, PETRI_TRANSITIONS=171} [2022-09-20 22:20:43,545 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 52 predicate places. [2022-09-20 22:20:43,545 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 171 transitions, 861 flow [2022-09-20 22:20:43,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:43,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:43,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:43,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-09-20 22:20:43,546 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:43,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:43,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1883485997, now seen corresponding path program 3 times [2022-09-20 22:20:43,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:43,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970786065] [2022-09-20 22:20:43,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:43,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:43,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:43,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:43,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970786065] [2022-09-20 22:20:43,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970786065] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:43,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:43,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-09-20 22:20:43,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731401209] [2022-09-20 22:20:43,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:43,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-20 22:20:43,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:43,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-20 22:20:43,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-20 22:20:43,577 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2022-09-20 22:20:43,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 171 transitions, 861 flow. Second operand has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:43,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:43,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2022-09-20 22:20:43,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:43,675 INFO L130 PetriNetUnfolder]: 144/749 cut-off events. [2022-09-20 22:20:43,675 INFO L131 PetriNetUnfolder]: For 2494/2535 co-relation queries the response was YES. [2022-09-20 22:20:43,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2078 conditions, 749 events. 144/749 cut-off events. For 2494/2535 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4085 event pairs, 50 based on Foata normal form. 25/717 useless extension candidates. Maximal degree in co-relation 2042. Up to 106 conditions per place. [2022-09-20 22:20:43,680 INFO L137 encePairwiseOnDemand]: 180/183 looper letters, 50 selfloop transitions, 10 changer transitions 2/186 dead transitions. [2022-09-20 22:20:43,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 186 transitions, 1111 flow [2022-09-20 22:20:43,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-20 22:20:43,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-09-20 22:20:43,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 638 transitions. [2022-09-20 22:20:43,681 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8715846994535519 [2022-09-20 22:20:43,681 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 638 transitions. [2022-09-20 22:20:43,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 638 transitions. [2022-09-20 22:20:43,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:43,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 638 transitions. [2022-09-20 22:20:43,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.5) internal successors, (638), 4 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:43,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:43,682 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:43,683 INFO L175 Difference]: Start difference. First operand has 212 places, 171 transitions, 861 flow. Second operand 4 states and 638 transitions. [2022-09-20 22:20:43,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 186 transitions, 1111 flow [2022-09-20 22:20:43,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 186 transitions, 1015 flow, removed 18 selfloop flow, removed 9 redundant places. [2022-09-20 22:20:43,689 INFO L231 Difference]: Finished difference. Result has 208 places, 172 transitions, 828 flow [2022-09-20 22:20:43,690 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=828, PETRI_PLACES=208, PETRI_TRANSITIONS=172} [2022-09-20 22:20:43,690 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 48 predicate places. [2022-09-20 22:20:43,690 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 172 transitions, 828 flow [2022-09-20 22:20:43,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:43,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:43,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:43,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-09-20 22:20:43,690 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:43,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:43,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1751583873, now seen corresponding path program 2 times [2022-09-20 22:20:43,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:43,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432211230] [2022-09-20 22:20:43,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:43,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:43,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:43,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:43,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432211230] [2022-09-20 22:20:43,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432211230] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:43,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:43,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:20:43,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521705444] [2022-09-20 22:20:43,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:43,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:20:43,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:43,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:20:43,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:20:43,747 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-09-20 22:20:43,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 172 transitions, 828 flow. Second operand has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:43,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:43,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-09-20 22:20:43,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:43,920 INFO L130 PetriNetUnfolder]: 171/813 cut-off events. [2022-09-20 22:20:43,920 INFO L131 PetriNetUnfolder]: For 2928/3030 co-relation queries the response was YES. [2022-09-20 22:20:43,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2295 conditions, 813 events. 171/813 cut-off events. For 2928/3030 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4577 event pairs, 47 based on Foata normal form. 77/832 useless extension candidates. Maximal degree in co-relation 2258. Up to 86 conditions per place. [2022-09-20 22:20:43,926 INFO L137 encePairwiseOnDemand]: 172/183 looper letters, 47 selfloop transitions, 29 changer transitions 27/209 dead transitions. [2022-09-20 22:20:43,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 209 transitions, 1353 flow [2022-09-20 22:20:43,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 22:20:43,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 22:20:43,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1866 transitions. [2022-09-20 22:20:43,927 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7843631778058008 [2022-09-20 22:20:43,927 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1866 transitions. [2022-09-20 22:20:43,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1866 transitions. [2022-09-20 22:20:43,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:43,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1866 transitions. [2022-09-20 22:20:43,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 143.53846153846155) internal successors, (1866), 13 states have internal predecessors, (1866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:43,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 183.0) internal successors, (2562), 14 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:43,931 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 183.0) internal successors, (2562), 14 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:43,931 INFO L175 Difference]: Start difference. First operand has 208 places, 172 transitions, 828 flow. Second operand 13 states and 1866 transitions. [2022-09-20 22:20:43,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 209 transitions, 1353 flow [2022-09-20 22:20:43,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 209 transitions, 1295 flow, removed 20 selfloop flow, removed 4 redundant places. [2022-09-20 22:20:43,938 INFO L231 Difference]: Finished difference. Result has 220 places, 170 transitions, 906 flow [2022-09-20 22:20:43,938 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=906, PETRI_PLACES=220, PETRI_TRANSITIONS=170} [2022-09-20 22:20:43,939 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 60 predicate places. [2022-09-20 22:20:43,939 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 170 transitions, 906 flow [2022-09-20 22:20:43,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:43,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:20:43,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:43,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-09-20 22:20:43,939 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:20:43,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:20:43,940 INFO L85 PathProgramCache]: Analyzing trace with hash -762194587, now seen corresponding path program 1 times [2022-09-20 22:20:43,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:20:43,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510972354] [2022-09-20 22:20:43,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:20:43,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:20:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:20:43,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:20:43,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:20:43,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510972354] [2022-09-20 22:20:43,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510972354] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:20:43,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:20:43,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:20:43,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642731893] [2022-09-20 22:20:43,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:20:43,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:20:43,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:20:43,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:20:43,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:20:43,995 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-09-20 22:20:43,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 170 transitions, 906 flow. Second operand has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:43,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:20:43,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-09-20 22:20:43,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:20:44,111 INFO L130 PetriNetUnfolder]: 110/563 cut-off events. [2022-09-20 22:20:44,111 INFO L131 PetriNetUnfolder]: For 2230/2331 co-relation queries the response was YES. [2022-09-20 22:20:44,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1609 conditions, 563 events. 110/563 cut-off events. For 2230/2331 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2543 event pairs, 26 based on Foata normal form. 76/586 useless extension candidates. Maximal degree in co-relation 1570. Up to 84 conditions per place. [2022-09-20 22:20:44,114 INFO L137 encePairwiseOnDemand]: 173/183 looper letters, 0 selfloop transitions, 0 changer transitions 185/185 dead transitions. [2022-09-20 22:20:44,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 185 transitions, 1189 flow [2022-09-20 22:20:44,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 22:20:44,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 22:20:44,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1286 transitions. [2022-09-20 22:20:44,116 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7808136004857317 [2022-09-20 22:20:44,116 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1286 transitions. [2022-09-20 22:20:44,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1286 transitions. [2022-09-20 22:20:44,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:20:44,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1286 transitions. [2022-09-20 22:20:44,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 142.88888888888889) internal successors, (1286), 9 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:44,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:44,118 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:44,119 INFO L175 Difference]: Start difference. First operand has 220 places, 170 transitions, 906 flow. Second operand 9 states and 1286 transitions. [2022-09-20 22:20:44,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 185 transitions, 1189 flow [2022-09-20 22:20:44,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 185 transitions, 1075 flow, removed 15 selfloop flow, removed 16 redundant places. [2022-09-20 22:20:44,124 INFO L231 Difference]: Finished difference. Result has 209 places, 0 transitions, 0 flow [2022-09-20 22:20:44,124 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=209, PETRI_TRANSITIONS=0} [2022-09-20 22:20:44,125 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 49 predicate places. [2022-09-20 22:20:44,125 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 0 transitions, 0 flow [2022-09-20 22:20:44,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 22:20:44,127 INFO L805 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-09-20 22:20:44,128 INFO L805 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-09-20 22:20:44,128 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-09-20 22:20:44,128 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-09-20 22:20:44,133 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-09-20 22:20:44,133 INFO L805 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-09-20 22:20:44,133 INFO L805 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-09-20 22:20:44,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-09-20 22:20:44,134 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:20:44,137 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-20 22:20:44,137 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-20 22:20:44,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 10:20:44 BasicIcfg [2022-09-20 22:20:44,140 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-20 22:20:44,141 INFO L158 Benchmark]: Toolchain (without parser) took 19330.16ms. Allocated memory was 190.8MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 136.4MB in the beginning and 605.9MB in the end (delta: -469.5MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-09-20 22:20:44,141 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 190.8MB. Free memory is still 153.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-20 22:20:44,141 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.57ms. Allocated memory is still 190.8MB. Free memory was 136.1MB in the beginning and 153.3MB in the end (delta: -17.3MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. [2022-09-20 22:20:44,141 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.95ms. Allocated memory is still 190.8MB. Free memory was 153.3MB in the beginning and 150.5MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-20 22:20:44,141 INFO L158 Benchmark]: Boogie Preprocessor took 36.11ms. Allocated memory is still 190.8MB. Free memory was 150.5MB in the beginning and 148.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 22:20:44,141 INFO L158 Benchmark]: RCFGBuilder took 609.02ms. Allocated memory is still 190.8MB. Free memory was 148.4MB in the beginning and 114.5MB in the end (delta: 33.9MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-09-20 22:20:44,141 INFO L158 Benchmark]: TraceAbstraction took 18192.30ms. Allocated memory was 190.8MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 114.2MB in the beginning and 605.9MB in the end (delta: -491.7MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-09-20 22:20:44,142 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 190.8MB. Free memory is still 153.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 425.57ms. Allocated memory is still 190.8MB. Free memory was 136.1MB in the beginning and 153.3MB in the end (delta: -17.3MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.95ms. Allocated memory is still 190.8MB. Free memory was 153.3MB in the beginning and 150.5MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.11ms. Allocated memory is still 190.8MB. Free memory was 150.5MB in the beginning and 148.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 609.02ms. Allocated memory is still 190.8MB. Free memory was 148.4MB in the beginning and 114.5MB in the end (delta: 33.9MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 18192.30ms. Allocated memory was 190.8MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 114.2MB in the beginning and 605.9MB in the end (delta: -491.7MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 712]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 719]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 269 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.0s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 15.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1939 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1939 mSDsluCounter, 1224 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2308 mSDsCounter, 477 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6254 IncrementalHoareTripleChecker+Invalid, 6731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 477 mSolverCounterUnsat, 408 mSDtfsCounter, 6254 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2288occurred in iteration=15, InterpolantAutomatonStates: 264, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2373 NumberOfCodeBlocks, 2373 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2345 ConstructedInterpolants, 0 QuantifiedInterpolants, 11524 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-09-20 22:20:44,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...