./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-atomic/qrcu-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-atomic/qrcu-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3655f01df3eccc3acdb69c97e41dec3a3ff24ca3333b88921cb12b5b6c342936 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 14:58:18,900 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 14:58:18,902 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 14:58:18,956 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 14:58:18,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 14:58:18,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 14:58:18,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 14:58:18,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 14:58:18,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 14:58:18,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 14:58:18,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 14:58:18,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 14:58:18,963 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 14:58:18,964 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 14:58:18,965 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 14:58:18,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 14:58:18,966 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 14:58:18,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 14:58:18,968 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 14:58:18,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 14:58:18,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 14:58:18,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 14:58:18,971 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 14:58:18,972 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 14:58:18,974 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 14:58:18,974 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 14:58:18,974 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 14:58:18,975 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 14:58:18,975 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 14:58:18,976 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 14:58:18,976 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 14:58:18,977 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 14:58:18,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 14:58:18,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 14:58:18,978 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 14:58:18,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 14:58:18,979 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 14:58:18,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 14:58:18,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 14:58:18,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 14:58:18,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 14:58:18,982 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 14:58:18,998 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 14:58:18,998 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 14:58:18,999 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 14:58:18,999 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 14:58:19,000 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 14:58:19,000 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 14:58:19,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 14:58:19,001 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 14:58:19,001 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 14:58:19,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 14:58:19,002 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 14:58:19,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 14:58:19,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 14:58:19,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 14:58:19,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 14:58:19,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 14:58:19,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 14:58:19,003 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 14:58:19,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 14:58:19,003 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 14:58:19,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 14:58:19,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 14:58:19,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 14:58:19,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 14:58:19,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 14:58:19,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 14:58:19,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 14:58:19,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 14:58:19,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 14:58:19,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 14:58:19,006 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 14:58:19,006 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 14:58:19,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 14:58:19,006 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 14:58:19,006 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3655f01df3eccc3acdb69c97e41dec3a3ff24ca3333b88921cb12b5b6c342936 [2021-12-21 14:58:19,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 14:58:19,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 14:58:19,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 14:58:19,190 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 14:58:19,191 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 14:58:19,191 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/qrcu-1.i [2021-12-21 14:58:19,236 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/488603bc5/d1a7ed91873f4a8fa832ff47ec8dd05b/FLAG7b84818b1 [2021-12-21 14:58:19,651 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 14:58:19,651 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/qrcu-1.i [2021-12-21 14:58:19,659 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/488603bc5/d1a7ed91873f4a8fa832ff47ec8dd05b/FLAG7b84818b1 [2021-12-21 14:58:19,675 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/488603bc5/d1a7ed91873f4a8fa832ff47ec8dd05b [2021-12-21 14:58:19,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 14:58:19,680 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 14:58:19,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 14:58:19,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 14:58:19,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 14:58:19,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:58:19" (1/1) ... [2021-12-21 14:58:19,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ac75db4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:58:19, skipping insertion in model container [2021-12-21 14:58:19,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:58:19" (1/1) ... [2021-12-21 14:58:19,691 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 14:58:19,725 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 14:58:19,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/qrcu-1.i[30694,30707] [2021-12-21 14:58:19,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/qrcu-1.i[30916,30929] [2021-12-21 14:58:19,967 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 14:58:19,976 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 14:58:20,009 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/qrcu-1.i[30694,30707] [2021-12-21 14:58:20,010 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/qrcu-1.i[30916,30929] [2021-12-21 14:58:20,016 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 14:58:20,044 INFO L208 MainTranslator]: Completed translation [2021-12-21 14:58:20,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:58:20 WrapperNode [2021-12-21 14:58:20,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 14:58:20,045 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 14:58:20,046 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 14:58:20,046 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 14:58:20,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:58:20" (1/1) ... [2021-12-21 14:58:20,073 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:58:20" (1/1) ... [2021-12-21 14:58:20,104 INFO L137 Inliner]: procedures = 177, calls = 54, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 270 [2021-12-21 14:58:20,105 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 14:58:20,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 14:58:20,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 14:58:20,106 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 14:58:20,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:58:20" (1/1) ... [2021-12-21 14:58:20,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:58:20" (1/1) ... [2021-12-21 14:58:20,123 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:58:20" (1/1) ... [2021-12-21 14:58:20,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:58:20" (1/1) ... [2021-12-21 14:58:20,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:58:20" (1/1) ... [2021-12-21 14:58:20,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:58:20" (1/1) ... [2021-12-21 14:58:20,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:58:20" (1/1) ... [2021-12-21 14:58:20,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 14:58:20,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 14:58:20,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 14:58:20,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 14:58:20,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:58:20" (1/1) ... [2021-12-21 14:58:20,163 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 14:58:20,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 14:58:20,182 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) [2021-12-21 14:58:20,184 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 [2021-12-21 14:58:20,216 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader1 [2021-12-21 14:58:20,217 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader1 [2021-12-21 14:58:20,217 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader2 [2021-12-21 14:58:20,218 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader2 [2021-12-21 14:58:20,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 14:58:20,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 14:58:20,218 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_updater [2021-12-21 14:58:20,218 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_updater [2021-12-21 14:58:20,219 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-12-21 14:58:20,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 14:58:20,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 14:58:20,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 14:58:20,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 14:58:20,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 14:58:20,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 14:58:20,220 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-21 14:58:20,312 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 14:58:20,313 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 14:58:20,568 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 14:58:20,662 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 14:58:20,663 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-21 14:58:20,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:58:20 BoogieIcfgContainer [2021-12-21 14:58:20,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 14:58:20,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 14:58:20,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 14:58:20,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 14:58:20,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:58:19" (1/3) ... [2021-12-21 14:58:20,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a43010b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:58:20, skipping insertion in model container [2021-12-21 14:58:20,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:58:20" (2/3) ... [2021-12-21 14:58:20,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a43010b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:58:20, skipping insertion in model container [2021-12-21 14:58:20,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:58:20" (3/3) ... [2021-12-21 14:58:20,670 INFO L111 eAbstractionObserver]: Analyzing ICFG qrcu-1.i [2021-12-21 14:58:20,673 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-21 14:58:20,673 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 14:58:20,673 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-21 14:58:20,673 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-21 14:58:20,730 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,730 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,730 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,731 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,731 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,731 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,731 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,731 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,731 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,731 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,732 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,732 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,732 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,732 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,733 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,733 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,733 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,733 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,733 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,734 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,734 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,734 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,734 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,734 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,735 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,735 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,735 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,735 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,735 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,735 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,736 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,736 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,736 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,736 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,736 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,736 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,736 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,737 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,737 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,737 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,737 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,737 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,737 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,738 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,738 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,738 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,738 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,738 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,738 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,739 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,739 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,739 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,739 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,739 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,739 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,740 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,740 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,740 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,740 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,740 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,740 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,740 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,740 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,741 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,741 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,741 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,741 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,741 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,741 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,741 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,742 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,742 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,742 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,742 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,742 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,743 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,743 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,743 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,743 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,743 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,744 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,744 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,744 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,744 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,744 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,745 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,745 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,745 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,745 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,745 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,746 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,746 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,746 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,746 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,746 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,746 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,747 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,747 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,747 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,747 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,747 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,747 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,748 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,748 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,748 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,748 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,748 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,748 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,748 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,748 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,749 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,749 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,749 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,749 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,749 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,749 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,750 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,750 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,750 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,750 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,750 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,751 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,751 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,751 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,751 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,751 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,751 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,751 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,752 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,752 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,752 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,752 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,752 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,752 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,753 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,753 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,753 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,753 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,753 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,753 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,754 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,754 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,754 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,754 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,755 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,755 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,755 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,755 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,755 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,755 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,755 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,756 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,756 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,756 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,756 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,756 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,757 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,757 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,757 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,757 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,757 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,757 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,757 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,758 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,758 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,758 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,758 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,758 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,758 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,758 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,758 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,759 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,759 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,759 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,759 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,759 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,759 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,759 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,775 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,775 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,775 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,776 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,776 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,776 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,776 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,777 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,777 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,777 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,777 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,777 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,777 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,778 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,778 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,778 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,778 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,778 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,778 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,778 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,779 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,779 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,779 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,779 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,779 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,779 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,780 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,780 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,780 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,781 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,781 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,781 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,781 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,781 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,782 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,782 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,782 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,782 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,782 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,782 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,782 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,782 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,782 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,783 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,783 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,783 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,783 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,783 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,783 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,783 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,783 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,783 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,783 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,783 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,783 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,783 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,784 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,784 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,784 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,784 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,784 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,784 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,785 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,785 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,785 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,785 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,785 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,785 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,786 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,786 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,786 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,786 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,786 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,786 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,786 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,786 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,787 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,787 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,787 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,787 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,787 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,787 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,787 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,788 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,788 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,788 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,788 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,788 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,788 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,789 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,789 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,789 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,789 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,789 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,789 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,789 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,790 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,790 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,790 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,790 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,790 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,790 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,791 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,791 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,791 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,791 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,791 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,791 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,791 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,792 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,792 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,792 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,792 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,792 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,792 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,792 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,793 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,793 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,793 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,793 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,793 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,793 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,794 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,794 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,794 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,794 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,794 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,794 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,795 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,795 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,795 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,795 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,798 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,798 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,798 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,798 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,798 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,798 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,798 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,799 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,799 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,799 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,800 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,800 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,800 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,800 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,800 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,801 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,801 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,815 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,815 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,816 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,816 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,816 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,816 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,816 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,817 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,817 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,817 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,817 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,818 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,818 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,818 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,818 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,818 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,819 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,819 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,819 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,819 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,819 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,820 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,820 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,820 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,820 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,823 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,823 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,823 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,824 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,824 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,824 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,824 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,824 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,824 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,825 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,825 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,825 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,825 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,825 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,826 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,826 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,826 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,826 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,826 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,826 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,827 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,827 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,827 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,827 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,827 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,827 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,828 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,828 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,828 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,828 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,828 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,828 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,829 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,829 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,829 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,830 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,830 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,830 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,830 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,830 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,830 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,830 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,831 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,831 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,831 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,831 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,831 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,831 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,832 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,832 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,832 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,832 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,832 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,833 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,833 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,833 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,834 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,834 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,834 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,834 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,834 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,834 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,835 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,835 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,835 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,835 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,835 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,836 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,836 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,836 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,836 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,836 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,836 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:58:20,839 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-12-21 14:58:20,887 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 14:58:20,896 INFO L339 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=true, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 14:58:20,896 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-12-21 14:58:20,908 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 175 places, 183 transitions, 390 flow [2021-12-21 14:58:20,989 INFO L129 PetriNetUnfolder]: 18/180 cut-off events. [2021-12-21 14:58:20,989 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-21 14:58:20,994 INFO L84 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 360 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. [2021-12-21 14:58:20,994 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 183 transitions, 390 flow [2021-12-21 14:58:21,002 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 168 transitions, 351 flow [2021-12-21 14:58:21,050 INFO L129 PetriNetUnfolder]: 9/124 cut-off events. [2021-12-21 14:58:21,051 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-12-21 14:58:21,051 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:21,052 INFO L254 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] [2021-12-21 14:58:21,052 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:21,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:21,057 INFO L85 PathProgramCache]: Analyzing trace with hash -707274187, now seen corresponding path program 1 times [2021-12-21 14:58:21,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:21,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127114968] [2021-12-21 14:58:21,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:21,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:21,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:21,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:21,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127114968] [2021-12-21 14:58:21,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127114968] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:21,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:21,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 14:58:21,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114090376] [2021-12-21 14:58:21,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:21,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 14:58:21,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:21,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 14:58:21,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 14:58:21,360 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 183 [2021-12-21 14:58:21,364 INFO L92 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) [2021-12-21 14:58:21,364 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:21,364 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 183 [2021-12-21 14:58:21,365 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:21,649 INFO L129 PetriNetUnfolder]: 629/1791 cut-off events. [2021-12-21 14:58:21,650 INFO L130 PetriNetUnfolder]: For 265/265 co-relation queries the response was YES. [2021-12-21 14:58:21,657 INFO L84 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 12222 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. [2021-12-21 14:58:21,666 INFO L132 encePairwiseOnDemand]: 174/183 looper letters, 40 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2021-12-21 14:58:21,666 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 175 transitions, 455 flow [2021-12-21 14:58:21,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 14:58:21,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-21 14:58:21,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2021-12-21 14:58:21,680 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8998178506375227 [2021-12-21 14:58:21,681 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2021-12-21 14:58:21,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2021-12-21 14:58:21,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:21,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2021-12-21 14:58:21,688 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) [2021-12-21 14:58:21,694 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) [2021-12-21 14:58:21,694 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) [2021-12-21 14:58:21,695 INFO L186 Difference]: Start difference. First operand has 160 places, 168 transitions, 351 flow. Second operand 3 states and 494 transitions. [2021-12-21 14:58:21,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 175 transitions, 455 flow [2021-12-21 14:58:21,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 175 transitions, 442 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-12-21 14:58:21,703 INFO L242 Difference]: Finished difference. Result has 159 places, 163 transitions, 344 flow [2021-12-21 14:58:21,705 INFO L317 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} [2021-12-21 14:58:21,707 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, -1 predicate places. [2021-12-21 14:58:21,707 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 163 transitions, 344 flow [2021-12-21 14:58:21,708 INFO L471 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) [2021-12-21 14:58:21,708 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:21,708 INFO L254 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] [2021-12-21 14:58:21,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 14:58:21,708 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:21,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:21,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1151136919, now seen corresponding path program 1 times [2021-12-21 14:58:21,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:21,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153565416] [2021-12-21 14:58:21,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:21,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:21,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:21,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:21,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153565416] [2021-12-21 14:58:21,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153565416] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:21,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:21,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 14:58:21,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496142480] [2021-12-21 14:58:21,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:21,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 14:58:21,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:21,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 14:58:21,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 14:58:21,824 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 183 [2021-12-21 14:58:21,824 INFO L92 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) [2021-12-21 14:58:21,824 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:21,825 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 183 [2021-12-21 14:58:21,825 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:21,973 INFO L129 PetriNetUnfolder]: 402/1255 cut-off events. [2021-12-21 14:58:21,973 INFO L130 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2021-12-21 14:58:21,977 INFO L84 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 7965 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. [2021-12-21 14:58:21,981 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 26 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2021-12-21 14:58:21,981 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 172 transitions, 421 flow [2021-12-21 14:58:21,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 14:58:21,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-21 14:58:21,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2021-12-21 14:58:21,982 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9107468123861566 [2021-12-21 14:58:21,983 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2021-12-21 14:58:21,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2021-12-21 14:58:21,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:21,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2021-12-21 14:58:21,984 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) [2021-12-21 14:58:21,985 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) [2021-12-21 14:58:21,986 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) [2021-12-21 14:58:21,986 INFO L186 Difference]: Start difference. First operand has 159 places, 163 transitions, 344 flow. Second operand 3 states and 500 transitions. [2021-12-21 14:58:21,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 172 transitions, 421 flow [2021-12-21 14:58:21,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 172 transitions, 419 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-21 14:58:21,989 INFO L242 Difference]: Finished difference. Result has 161 places, 163 transitions, 350 flow [2021-12-21 14:58:21,989 INFO L317 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} [2021-12-21 14:58:21,990 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 1 predicate places. [2021-12-21 14:58:21,990 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 163 transitions, 350 flow [2021-12-21 14:58:21,990 INFO L471 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) [2021-12-21 14:58:21,990 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:21,990 INFO L254 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] [2021-12-21 14:58:21,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 14:58:21,991 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:21,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:21,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1794772677, now seen corresponding path program 1 times [2021-12-21 14:58:21,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:21,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158335620] [2021-12-21 14:58:21,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:21,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:22,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:22,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:22,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158335620] [2021-12-21 14:58:22,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158335620] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:22,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:22,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 14:58:22,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57033016] [2021-12-21 14:58:22,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:22,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 14:58:22,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:22,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 14:58:22,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 14:58:22,044 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 183 [2021-12-21 14:58:22,045 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 163 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:22,045 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:22,045 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 183 [2021-12-21 14:58:22,045 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:22,181 INFO L129 PetriNetUnfolder]: 399/1248 cut-off events. [2021-12-21 14:58:22,181 INFO L130 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2021-12-21 14:58:22,185 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1914 conditions, 1248 events. 399/1248 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 8024 event pairs, 94 based on Foata normal form. 0/1109 useless extension candidates. Maximal degree in co-relation 1324. Up to 363 conditions per place. [2021-12-21 14:58:22,189 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 26 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2021-12-21 14:58:22,189 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 172 transitions, 429 flow [2021-12-21 14:58:22,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 14:58:22,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-21 14:58:22,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2021-12-21 14:58:22,191 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9107468123861566 [2021-12-21 14:58:22,191 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2021-12-21 14:58:22,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2021-12-21 14:58:22,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:22,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2021-12-21 14:58:22,192 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) [2021-12-21 14:58:22,193 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) [2021-12-21 14:58:22,194 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) [2021-12-21 14:58:22,194 INFO L186 Difference]: Start difference. First operand has 161 places, 163 transitions, 350 flow. Second operand 3 states and 500 transitions. [2021-12-21 14:58:22,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 172 transitions, 429 flow [2021-12-21 14:58:22,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 172 transitions, 425 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-21 14:58:22,197 INFO L242 Difference]: Finished difference. Result has 162 places, 163 transitions, 354 flow [2021-12-21 14:58:22,197 INFO L317 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=162, PETRI_TRANSITIONS=163} [2021-12-21 14:58:22,198 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 2 predicate places. [2021-12-21 14:58:22,198 INFO L470 AbstractCegarLoop]: Abstraction has has 162 places, 163 transitions, 354 flow [2021-12-21 14:58:22,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:22,198 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:22,198 INFO L254 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] [2021-12-21 14:58:22,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 14:58:22,199 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:22,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:22,199 INFO L85 PathProgramCache]: Analyzing trace with hash -671928539, now seen corresponding path program 1 times [2021-12-21 14:58:22,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:22,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824195369] [2021-12-21 14:58:22,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:22,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:22,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:22,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:22,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824195369] [2021-12-21 14:58:22,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824195369] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:22,281 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:22,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 14:58:22,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432977056] [2021-12-21 14:58:22,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:22,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 14:58:22,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:22,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 14:58:22,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-21 14:58:22,283 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183 [2021-12-21 14:58:22,284 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 163 transitions, 354 flow. Second operand has 6 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:22,284 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:22,284 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183 [2021-12-21 14:58:22,284 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:22,621 INFO L129 PetriNetUnfolder]: 779/1959 cut-off events. [2021-12-21 14:58:22,621 INFO L130 PetriNetUnfolder]: For 181/181 co-relation queries the response was YES. [2021-12-21 14:58:22,626 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3387 conditions, 1959 events. 779/1959 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 13669 event pairs, 110 based on Foata normal form. 96/1979 useless extension candidates. Maximal degree in co-relation 3231. Up to 959 conditions per place. [2021-12-21 14:58:22,633 INFO L132 encePairwiseOnDemand]: 165/183 looper letters, 93 selfloop transitions, 31 changer transitions 0/243 dead transitions. [2021-12-21 14:58:22,633 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 243 transitions, 798 flow [2021-12-21 14:58:22,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 14:58:22,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-21 14:58:22,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1198 transitions. [2021-12-21 14:58:22,636 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8183060109289617 [2021-12-21 14:58:22,636 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1198 transitions. [2021-12-21 14:58:22,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1198 transitions. [2021-12-21 14:58:22,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:22,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1198 transitions. [2021-12-21 14:58:22,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 149.75) internal successors, (1198), 8 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:22,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 183.0) internal successors, (1647), 9 states have internal predecessors, (1647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:22,641 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 183.0) internal successors, (1647), 9 states have internal predecessors, (1647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:22,641 INFO L186 Difference]: Start difference. First operand has 162 places, 163 transitions, 354 flow. Second operand 8 states and 1198 transitions. [2021-12-21 14:58:22,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 243 transitions, 798 flow [2021-12-21 14:58:22,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 243 transitions, 794 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-21 14:58:22,645 INFO L242 Difference]: Finished difference. Result has 173 places, 196 transitions, 597 flow [2021-12-21 14:58:22,645 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=597, PETRI_PLACES=173, PETRI_TRANSITIONS=196} [2021-12-21 14:58:22,646 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 13 predicate places. [2021-12-21 14:58:22,646 INFO L470 AbstractCegarLoop]: Abstraction has has 173 places, 196 transitions, 597 flow [2021-12-21 14:58:22,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:22,647 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:22,647 INFO L254 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] [2021-12-21 14:58:22,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 14:58:22,647 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:22,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:22,648 INFO L85 PathProgramCache]: Analyzing trace with hash 911682777, now seen corresponding path program 2 times [2021-12-21 14:58:22,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:22,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316371433] [2021-12-21 14:58:22,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:22,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:22,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:22,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:22,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316371433] [2021-12-21 14:58:22,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316371433] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:22,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:22,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 14:58:22,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637375246] [2021-12-21 14:58:22,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:22,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 14:58:22,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:22,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 14:58:22,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-21 14:58:22,772 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 183 [2021-12-21 14:58:22,773 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 196 transitions, 597 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) [2021-12-21 14:58:22,773 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:22,773 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 183 [2021-12-21 14:58:22,773 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:23,424 INFO L382 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][231], [91#L777true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 52#L744-3true, qrcu_updaterThread1of1ForFork0InUse, Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 119#L738true, Black: 196#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 225#(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: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 101#L786-4true, 194#true, Black: 178#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), Black: 186#(= ~readerprogress1~0 0)]) [2021-12-21 14:58:23,425 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is not cut-off event [2021-12-21 14:58:23,425 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-12-21 14:58:23,425 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2021-12-21 14:58:23,425 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2021-12-21 14:58:23,505 INFO L382 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][231], [91#L777true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 52#L744-3true, qrcu_updaterThread1of1ForFork0InUse, Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 225#(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: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 101#L786-4true, 194#true, Black: 178#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 22#L739true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-21 14:58:23,505 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is not cut-off event [2021-12-21 14:58:23,505 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is not cut-off event [2021-12-21 14:58:23,505 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is not cut-off event [2021-12-21 14:58:23,505 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2021-12-21 14:58:23,551 INFO L382 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][231], [84#L787-1true, 91#L777true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 52#L744-3true, qrcu_updaterThread1of1ForFork0InUse, Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 119#L738true, Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= (+ (- 1) ~ctr1~0) 0), 225#(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: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, Black: 178#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), Black: 186#(= ~readerprogress1~0 0)]) [2021-12-21 14:58:23,551 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is not cut-off event [2021-12-21 14:58:23,551 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-12-21 14:58:23,552 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2021-12-21 14:58:23,552 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is not cut-off event [2021-12-21 14:58:23,573 INFO L382 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][231], [84#L787-1true, 91#L777true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 52#L744-3true, qrcu_updaterThread1of1ForFork0InUse, Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 225#(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: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, Black: 178#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 22#L739true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-21 14:58:23,573 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is not cut-off event [2021-12-21 14:58:23,573 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is not cut-off event [2021-12-21 14:58:23,573 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2021-12-21 14:58:23,573 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is not cut-off event [2021-12-21 14:58:23,714 INFO L129 PetriNetUnfolder]: 3694/7612 cut-off events. [2021-12-21 14:58:23,714 INFO L130 PetriNetUnfolder]: For 8648/8824 co-relation queries the response was YES. [2021-12-21 14:58:23,741 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18280 conditions, 7612 events. 3694/7612 cut-off events. For 8648/8824 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 65563 event pairs, 637 based on Foata normal form. 88/7277 useless extension candidates. Maximal degree in co-relation 14398. Up to 2217 conditions per place. [2021-12-21 14:58:23,777 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 172 selfloop transitions, 17 changer transitions 2/319 dead transitions. [2021-12-21 14:58:23,778 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 319 transitions, 1521 flow [2021-12-21 14:58:23,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 14:58:23,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-21 14:58:23,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1381 transitions. [2021-12-21 14:58:23,781 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7546448087431694 [2021-12-21 14:58:23,781 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1381 transitions. [2021-12-21 14:58:23,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1381 transitions. [2021-12-21 14:58:23,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:23,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1381 transitions. [2021-12-21 14:58:23,784 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) [2021-12-21 14:58:23,787 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) [2021-12-21 14:58:23,787 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) [2021-12-21 14:58:23,787 INFO L186 Difference]: Start difference. First operand has 173 places, 196 transitions, 597 flow. Second operand 10 states and 1381 transitions. [2021-12-21 14:58:23,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 319 transitions, 1521 flow [2021-12-21 14:58:23,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 319 transitions, 1521 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-21 14:58:23,809 INFO L242 Difference]: Finished difference. Result has 187 places, 211 transitions, 700 flow [2021-12-21 14:58:23,809 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=700, PETRI_PLACES=187, PETRI_TRANSITIONS=211} [2021-12-21 14:58:23,810 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 27 predicate places. [2021-12-21 14:58:23,810 INFO L470 AbstractCegarLoop]: Abstraction has has 187 places, 211 transitions, 700 flow [2021-12-21 14:58:23,810 INFO L471 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) [2021-12-21 14:58:23,811 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:23,811 INFO L254 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] [2021-12-21 14:58:23,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 14:58:23,811 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:23,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:23,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1278935995, now seen corresponding path program 1 times [2021-12-21 14:58:23,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:23,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810753923] [2021-12-21 14:58:23,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:23,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:23,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:23,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:23,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810753923] [2021-12-21 14:58:23,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810753923] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:23,953 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:23,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 14:58:23,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911643256] [2021-12-21 14:58:23,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:23,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 14:58:23,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:23,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 14:58:23,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-21 14:58:23,955 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183 [2021-12-21 14:58:23,956 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 211 transitions, 700 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) [2021-12-21 14:58:23,956 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:23,956 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183 [2021-12-21 14:58:23,956 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:24,458 INFO L129 PetriNetUnfolder]: 1355/3313 cut-off events. [2021-12-21 14:58:24,458 INFO L130 PetriNetUnfolder]: For 4044/4077 co-relation queries the response was YES. [2021-12-21 14:58:24,469 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8355 conditions, 3313 events. 1355/3313 cut-off events. For 4044/4077 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 26918 event pairs, 106 based on Foata normal form. 59/3253 useless extension candidates. Maximal degree in co-relation 8150. Up to 1085 conditions per place. [2021-12-21 14:58:24,480 INFO L132 encePairwiseOnDemand]: 162/183 looper letters, 118 selfloop transitions, 37 changer transitions 0/288 dead transitions. [2021-12-21 14:58:24,481 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 288 transitions, 1330 flow [2021-12-21 14:58:24,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 14:58:24,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-21 14:58:24,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1469 transitions. [2021-12-21 14:58:24,483 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8027322404371585 [2021-12-21 14:58:24,483 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1469 transitions. [2021-12-21 14:58:24,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1469 transitions. [2021-12-21 14:58:24,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:24,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1469 transitions. [2021-12-21 14:58:24,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 146.9) internal successors, (1469), 10 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:24,488 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) [2021-12-21 14:58:24,489 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) [2021-12-21 14:58:24,489 INFO L186 Difference]: Start difference. First operand has 187 places, 211 transitions, 700 flow. Second operand 10 states and 1469 transitions. [2021-12-21 14:58:24,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 288 transitions, 1330 flow [2021-12-21 14:58:24,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 288 transitions, 1330 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-21 14:58:24,499 INFO L242 Difference]: Finished difference. Result has 201 places, 227 transitions, 939 flow [2021-12-21 14:58:24,500 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=939, PETRI_PLACES=201, PETRI_TRANSITIONS=227} [2021-12-21 14:58:24,500 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 41 predicate places. [2021-12-21 14:58:24,500 INFO L470 AbstractCegarLoop]: Abstraction has has 201 places, 227 transitions, 939 flow [2021-12-21 14:58:24,501 INFO L471 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) [2021-12-21 14:58:24,501 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:24,501 INFO L254 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] [2021-12-21 14:58:24,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-21 14:58:24,501 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:24,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:24,502 INFO L85 PathProgramCache]: Analyzing trace with hash -943571459, now seen corresponding path program 1 times [2021-12-21 14:58:24,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:24,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359659779] [2021-12-21 14:58:24,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:24,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:24,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:24,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:24,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359659779] [2021-12-21 14:58:24,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359659779] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:24,532 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:24,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 14:58:24,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532810267] [2021-12-21 14:58:24,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:24,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 14:58:24,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:24,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 14:58:24,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 14:58:24,534 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 183 [2021-12-21 14:58:24,534 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 227 transitions, 939 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) [2021-12-21 14:58:24,535 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:24,535 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 183 [2021-12-21 14:58:24,535 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:24,817 INFO L129 PetriNetUnfolder]: 952/2875 cut-off events. [2021-12-21 14:58:24,817 INFO L130 PetriNetUnfolder]: For 4069/4222 co-relation queries the response was YES. [2021-12-21 14:58:24,829 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7170 conditions, 2875 events. 952/2875 cut-off events. For 4069/4222 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 24345 event pairs, 179 based on Foata normal form. 76/2744 useless extension candidates. Maximal degree in co-relation 6752. Up to 801 conditions per place. [2021-12-21 14:58:24,838 INFO L132 encePairwiseOnDemand]: 181/183 looper letters, 70 selfloop transitions, 1 changer transitions 0/247 dead transitions. [2021-12-21 14:58:24,839 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 247 transitions, 1198 flow [2021-12-21 14:58:24,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 14:58:24,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-21 14:58:24,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2021-12-21 14:58:24,840 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9107468123861566 [2021-12-21 14:58:24,840 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2021-12-21 14:58:24,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2021-12-21 14:58:24,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:24,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2021-12-21 14:58:24,842 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) [2021-12-21 14:58:24,842 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) [2021-12-21 14:58:24,843 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) [2021-12-21 14:58:24,843 INFO L186 Difference]: Start difference. First operand has 201 places, 227 transitions, 939 flow. Second operand 3 states and 500 transitions. [2021-12-21 14:58:24,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 247 transitions, 1198 flow [2021-12-21 14:58:24,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 247 transitions, 1175 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-21 14:58:24,852 INFO L242 Difference]: Finished difference. Result has 200 places, 227 transitions, 923 flow [2021-12-21 14:58:24,852 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=923, PETRI_PLACES=200, PETRI_TRANSITIONS=227} [2021-12-21 14:58:24,852 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 40 predicate places. [2021-12-21 14:58:24,852 INFO L470 AbstractCegarLoop]: Abstraction has has 200 places, 227 transitions, 923 flow [2021-12-21 14:58:24,853 INFO L471 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) [2021-12-21 14:58:24,853 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:24,853 INFO L254 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] [2021-12-21 14:58:24,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-21 14:58:24,853 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:24,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:24,854 INFO L85 PathProgramCache]: Analyzing trace with hash 569723890, now seen corresponding path program 1 times [2021-12-21 14:58:24,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:24,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654376953] [2021-12-21 14:58:24,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:24,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:24,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:24,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:24,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654376953] [2021-12-21 14:58:24,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654376953] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:24,898 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:24,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 14:58:24,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627887084] [2021-12-21 14:58:24,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:24,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 14:58:24,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:24,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 14:58:24,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 14:58:24,900 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-21 14:58:24,900 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 227 transitions, 923 flow. Second operand has 5 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:24,900 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:24,900 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-21 14:58:24,901 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:25,496 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|} OutVars{qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][229], [Black: 191#(= ~readerprogress2~0 0), 111#L739-3true, 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 166#L771-3true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 101#L786-4true, 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(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: 221#(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: 213#(= ~readerprogress1~0 0), Black: 219#(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|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-12-21 14:58:25,496 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-12-21 14:58:25,496 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-12-21 14:58:25,496 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-12-21 14:58:25,496 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-12-21 14:58:25,497 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([851] L772-1-->L772-2: Formula: (= (+ |v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3| 1) v_~ctr1~0_20) InVars {qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} OutVars{~ctr1~0=v_~ctr1~0_20, qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} AuxVars[] AssignedVars[~ctr1~0][231], [Black: 191#(= ~readerprogress2~0 0), 111#L739-3true, 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 51#L772-2true, Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 101#L786-4true, 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(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: 221#(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: 213#(= ~readerprogress1~0 0), Black: 219#(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|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-12-21 14:58:25,497 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-12-21 14:58:25,497 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-12-21 14:58:25,497 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-12-21 14:58:25,497 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-12-21 14:58:25,631 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|} OutVars{qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][229], [111#L739-3true, Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 84#L787-1true, 166#L771-3true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(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: 221#(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: 213#(= ~readerprogress1~0 0), Black: 219#(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|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-12-21 14:58:25,631 INFO L384 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2021-12-21 14:58:25,631 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-21 14:58:25,631 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-21 14:58:25,631 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-21 14:58:25,632 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|} OutVars{qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][229], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 166#L771-3true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 257#(= ~readerprogress1~0 2), 120#L788-1true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(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: 221#(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: 213#(= ~readerprogress1~0 0), Black: 219#(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|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-12-21 14:58:25,632 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-12-21 14:58:25,632 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-21 14:58:25,632 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-21 14:58:25,632 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-21 14:58:25,632 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|} OutVars{qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][229], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 166#L771-3true, 109#L787-2true, 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(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: 221#(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: 213#(= ~readerprogress1~0 0), Black: 219#(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|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-12-21 14:58:25,632 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-12-21 14:58:25,632 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-21 14:58:25,632 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-21 14:58:25,633 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-21 14:58:25,633 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([851] L772-1-->L772-2: Formula: (= (+ |v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3| 1) v_~ctr1~0_20) InVars {qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} OutVars{~ctr1~0=v_~ctr1~0_20, qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} AuxVars[] AssignedVars[~ctr1~0][231], [111#L739-3true, Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 84#L787-1true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 51#L772-2true, Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(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: 221#(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: 213#(= ~readerprogress1~0 0), Black: 219#(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|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-12-21 14:58:25,633 INFO L384 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2021-12-21 14:58:25,633 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-21 14:58:25,633 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-21 14:58:25,633 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-12-21 14:58:25,634 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([851] L772-1-->L772-2: Formula: (= (+ |v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3| 1) v_~ctr1~0_20) InVars {qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} OutVars{~ctr1~0=v_~ctr1~0_20, qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} AuxVars[] AssignedVars[~ctr1~0][231], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 51#L772-2true, Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 257#(= ~readerprogress1~0 2), 120#L788-1true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(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: 221#(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: 213#(= ~readerprogress1~0 0), Black: 219#(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|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-12-21 14:58:25,634 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-12-21 14:58:25,634 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-21 14:58:25,634 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-21 14:58:25,634 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-21 14:58:25,634 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([851] L772-1-->L772-2: Formula: (= (+ |v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3| 1) v_~ctr1~0_20) InVars {qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} OutVars{~ctr1~0=v_~ctr1~0_20, qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} AuxVars[] AssignedVars[~ctr1~0][231], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 109#L787-2true, 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 51#L772-2true, Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(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: 221#(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: 213#(= ~readerprogress1~0 0), Black: 219#(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|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-12-21 14:58:25,634 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-12-21 14:58:25,634 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-21 14:58:25,635 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-21 14:58:25,635 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-21 14:58:25,714 INFO L382 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][236], [Black: 191#(= ~readerprogress2~0 0), Black: 257#(= ~readerprogress1~0 2), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 91#L777true, 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 101#L786-4true, 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 68#L725-3true, 223#(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) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 29#L757true, Black: 221#(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: 213#(= ~readerprogress1~0 0), Black: 219#(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|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, 255#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-12-21 14:58:25,715 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2021-12-21 14:58:25,715 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-21 14:58:25,715 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-21 14:58:25,715 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2021-12-21 14:58:25,753 INFO L382 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][294], [Black: 191#(= ~readerprogress2~0 0), Black: 257#(= ~readerprogress1~0 2), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 91#L777true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 119#L738true, Black: 196#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 225#(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: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 101#L786-4true, 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), 29#L757true, Black: 221#(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: 213#(= ~readerprogress1~0 0), Black: 219#(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|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, 255#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-12-21 14:58:25,754 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2021-12-21 14:58:25,754 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-21 14:58:25,754 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-21 14:58:25,754 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-21 14:58:25,754 INFO L382 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][236], [Black: 191#(= ~readerprogress2~0 0), Black: 257#(= ~readerprogress1~0 2), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 91#L777true, 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 101#L786-4true, 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 68#L725-3true, 223#(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) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), 59#L758true, Black: 225#(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: 221#(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: 213#(= ~readerprogress1~0 0), Black: 219#(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|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, 255#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-12-21 14:58:25,755 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2021-12-21 14:58:25,755 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-21 14:58:25,755 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-21 14:58:25,755 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-21 14:58:25,796 INFO L382 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][294], [Black: 191#(= ~readerprogress2~0 0), Black: 257#(= ~readerprogress1~0 2), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 91#L777true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 119#L738true, Black: 196#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 225#(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: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 101#L786-4true, 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), 59#L758true, Black: 221#(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: 213#(= ~readerprogress1~0 0), Black: 219#(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|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, 255#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-12-21 14:58:25,797 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-12-21 14:58:25,797 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-12-21 14:58:25,797 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-21 14:58:25,797 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-21 14:58:25,839 INFO L382 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][236], [Black: 191#(= ~readerprogress2~0 0), Black: 257#(= ~readerprogress1~0 2), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 84#L787-1true, 91#L777true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 68#L725-3true, 223#(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) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), 29#L757true, Black: 225#(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: 221#(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: 213#(= ~readerprogress1~0 0), Black: 219#(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|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, 255#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-12-21 14:58:25,840 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2021-12-21 14:58:25,840 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2021-12-21 14:58:25,840 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-21 14:58:25,840 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2021-12-21 14:58:25,886 INFO L382 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][294], [Black: 191#(= ~readerprogress2~0 0), Black: 257#(= ~readerprogress1~0 2), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 91#L777true, 84#L787-1true, 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 119#L738true, Black: 196#(= (+ (- 1) ~ctr1~0) 0), 225#(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: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), 29#L757true, Black: 221#(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: 213#(= ~readerprogress1~0 0), Black: 219#(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|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, 255#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-12-21 14:58:25,886 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-12-21 14:58:25,886 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-21 14:58:25,886 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-21 14:58:25,886 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-12-21 14:58:25,887 INFO L382 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][236], [Black: 191#(= ~readerprogress2~0 0), Black: 257#(= ~readerprogress1~0 2), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 84#L787-1true, 91#L777true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 68#L725-3true, 223#(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) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), 59#L758true, Black: 225#(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: 221#(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: 213#(= ~readerprogress1~0 0), Black: 219#(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|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, 255#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-12-21 14:58:25,887 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-12-21 14:58:25,887 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-12-21 14:58:25,887 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-21 14:58:25,887 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-21 14:58:25,934 INFO L382 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][294], [Black: 191#(= ~readerprogress2~0 0), Black: 257#(= ~readerprogress1~0 2), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 91#L777true, 84#L787-1true, 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 119#L738true, Black: 196#(= (+ (- 1) ~ctr1~0) 0), 225#(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: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 59#L758true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 221#(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: 213#(= ~readerprogress1~0 0), Black: 219#(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|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, 255#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-12-21 14:58:25,934 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2021-12-21 14:58:25,934 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2021-12-21 14:58:25,934 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-21 14:58:25,935 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-12-21 14:58:26,285 INFO L129 PetriNetUnfolder]: 5267/11896 cut-off events. [2021-12-21 14:58:26,285 INFO L130 PetriNetUnfolder]: For 14159/14513 co-relation queries the response was YES. [2021-12-21 14:58:26,358 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29605 conditions, 11896 events. 5267/11896 cut-off events. For 14159/14513 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 115189 event pairs, 662 based on Foata normal form. 173/11271 useless extension candidates. Maximal degree in co-relation 28072. Up to 2324 conditions per place. [2021-12-21 14:58:26,400 INFO L132 encePairwiseOnDemand]: 176/183 looper letters, 159 selfloop transitions, 12 changer transitions 6/336 dead transitions. [2021-12-21 14:58:26,400 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 336 transitions, 1840 flow [2021-12-21 14:58:26,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 14:58:26,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-21 14:58:26,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1069 transitions. [2021-12-21 14:58:26,402 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.834504293520687 [2021-12-21 14:58:26,403 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1069 transitions. [2021-12-21 14:58:26,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1069 transitions. [2021-12-21 14:58:26,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:26,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1069 transitions. [2021-12-21 14:58:26,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 152.71428571428572) internal successors, (1069), 7 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:26,407 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) [2021-12-21 14:58:26,407 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) [2021-12-21 14:58:26,407 INFO L186 Difference]: Start difference. First operand has 200 places, 227 transitions, 923 flow. Second operand 7 states and 1069 transitions. [2021-12-21 14:58:26,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 336 transitions, 1840 flow [2021-12-21 14:58:26,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 336 transitions, 1839 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-21 14:58:26,455 INFO L242 Difference]: Finished difference. Result has 207 places, 237 transitions, 994 flow [2021-12-21 14:58:26,456 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=994, PETRI_PLACES=207, PETRI_TRANSITIONS=237} [2021-12-21 14:58:26,456 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 47 predicate places. [2021-12-21 14:58:26,456 INFO L470 AbstractCegarLoop]: Abstraction has has 207 places, 237 transitions, 994 flow [2021-12-21 14:58:26,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:26,457 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:26,457 INFO L254 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] [2021-12-21 14:58:26,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 14:58:26,457 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:26,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:26,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1129125278, now seen corresponding path program 1 times [2021-12-21 14:58:26,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:26,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080833460] [2021-12-21 14:58:26,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:26,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:26,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:26,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080833460] [2021-12-21 14:58:26,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080833460] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:26,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:26,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 14:58:26,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56530831] [2021-12-21 14:58:26,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:26,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 14:58:26,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:26,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 14:58:26,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 14:58:26,491 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 183 [2021-12-21 14:58:26,492 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 237 transitions, 994 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) [2021-12-21 14:58:26,492 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:26,492 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 183 [2021-12-21 14:58:26,492 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:26,790 INFO L382 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][217], [Black: 191#(= ~readerprogress2~0 0), Black: 257#(= ~readerprogress1~0 2), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= (+ (- 1) ~ctr1~0) 0), Black: 262#(= ~readerprogress2~0 0), Black: 270#(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: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 101#L786-4true, 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 128#L777-3true, 68#L725-3true, 223#(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) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), 59#L758true, Black: 225#(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: 221#(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: 213#(= ~readerprogress1~0 0), Black: 219#(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|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-12-21 14:58:26,790 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-12-21 14:58:26,790 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-12-21 14:58:26,790 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-21 14:58:26,790 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-21 14:58:26,830 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|} OutVars{qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][212], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 166#L771-3true, 109#L787-2true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= (+ (- 1) ~ctr1~0) 0), 211#true, Black: 262#(= ~readerprogress2~0 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 270#(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: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(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: 221#(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: 213#(= ~readerprogress1~0 0), Black: 219#(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|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-12-21 14:58:26,830 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2021-12-21 14:58:26,830 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-21 14:58:26,830 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-21 14:58:26,830 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-21 14:58:26,830 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([851] L772-1-->L772-2: Formula: (= (+ |v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3| 1) v_~ctr1~0_20) InVars {qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} OutVars{~ctr1~0=v_~ctr1~0_20, qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} AuxVars[] AssignedVars[~ctr1~0][213], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 109#L787-2true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= (+ (- 1) ~ctr1~0) 0), 211#true, Black: 262#(= ~readerprogress2~0 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 51#L772-2true, Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(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: 221#(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: 213#(= ~readerprogress1~0 0), Black: 219#(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|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-12-21 14:58:26,830 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2021-12-21 14:58:26,831 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-21 14:58:26,831 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-21 14:58:26,831 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-21 14:58:26,885 INFO L129 PetriNetUnfolder]: 1519/4732 cut-off events. [2021-12-21 14:58:26,885 INFO L130 PetriNetUnfolder]: For 5293/5550 co-relation queries the response was YES. [2021-12-21 14:58:26,906 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11194 conditions, 4732 events. 1519/4732 cut-off events. For 5293/5550 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 45269 event pairs, 202 based on Foata normal form. 107/4467 useless extension candidates. Maximal degree in co-relation 10451. Up to 1145 conditions per place. [2021-12-21 14:58:26,917 INFO L132 encePairwiseOnDemand]: 181/183 looper letters, 70 selfloop transitions, 1 changer transitions 0/258 dead transitions. [2021-12-21 14:58:26,918 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 258 transitions, 1265 flow [2021-12-21 14:58:26,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 14:58:26,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-21 14:58:26,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2021-12-21 14:58:26,919 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9107468123861566 [2021-12-21 14:58:26,919 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2021-12-21 14:58:26,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2021-12-21 14:58:26,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:26,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2021-12-21 14:58:26,920 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) [2021-12-21 14:58:26,921 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) [2021-12-21 14:58:26,921 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) [2021-12-21 14:58:26,921 INFO L186 Difference]: Start difference. First operand has 207 places, 237 transitions, 994 flow. Second operand 3 states and 500 transitions. [2021-12-21 14:58:26,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 258 transitions, 1265 flow [2021-12-21 14:58:26,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 258 transitions, 1265 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-21 14:58:26,934 INFO L242 Difference]: Finished difference. Result has 210 places, 237 transitions, 999 flow [2021-12-21 14:58:26,935 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=994, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=999, PETRI_PLACES=210, PETRI_TRANSITIONS=237} [2021-12-21 14:58:26,935 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 50 predicate places. [2021-12-21 14:58:26,935 INFO L470 AbstractCegarLoop]: Abstraction has has 210 places, 237 transitions, 999 flow [2021-12-21 14:58:26,935 INFO L471 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) [2021-12-21 14:58:26,936 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:26,936 INFO L254 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] [2021-12-21 14:58:26,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-21 14:58:26,936 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:26,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:26,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1045246048, now seen corresponding path program 1 times [2021-12-21 14:58:26,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:26,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880948004] [2021-12-21 14:58:26,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:26,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:26,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:26,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:26,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880948004] [2021-12-21 14:58:26,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880948004] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:26,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:26,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 14:58:26,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932017566] [2021-12-21 14:58:26,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:26,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 14:58:26,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:26,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 14:58:26,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 14:58:26,961 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183 [2021-12-21 14:58:26,961 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 237 transitions, 999 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) [2021-12-21 14:58:26,961 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:26,962 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183 [2021-12-21 14:58:26,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:27,690 INFO L129 PetriNetUnfolder]: 2551/7930 cut-off events. [2021-12-21 14:58:27,691 INFO L130 PetriNetUnfolder]: For 8245/8454 co-relation queries the response was YES. [2021-12-21 14:58:27,719 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17394 conditions, 7930 events. 2551/7930 cut-off events. For 8245/8454 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 80999 event pairs, 606 based on Foata normal form. 35/7288 useless extension candidates. Maximal degree in co-relation 17006. Up to 2534 conditions per place. [2021-12-21 14:58:27,728 INFO L132 encePairwiseOnDemand]: 181/183 looper letters, 59 selfloop transitions, 1 changer transitions 44/256 dead transitions. [2021-12-21 14:58:27,729 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 256 transitions, 1245 flow [2021-12-21 14:58:27,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 14:58:27,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-21 14:58:27,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2021-12-21 14:58:27,730 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8998178506375227 [2021-12-21 14:58:27,730 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2021-12-21 14:58:27,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2021-12-21 14:58:27,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:27,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2021-12-21 14:58:27,731 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) [2021-12-21 14:58:27,732 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) [2021-12-21 14:58:27,732 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) [2021-12-21 14:58:27,732 INFO L186 Difference]: Start difference. First operand has 210 places, 237 transitions, 999 flow. Second operand 3 states and 494 transitions. [2021-12-21 14:58:27,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 256 transitions, 1245 flow [2021-12-21 14:58:27,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 256 transitions, 1244 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-21 14:58:27,751 INFO L242 Difference]: Finished difference. Result has 212 places, 198 transitions, 759 flow [2021-12-21 14:58:27,752 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=998, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=759, PETRI_PLACES=212, PETRI_TRANSITIONS=198} [2021-12-21 14:58:27,752 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 52 predicate places. [2021-12-21 14:58:27,752 INFO L470 AbstractCegarLoop]: Abstraction has has 212 places, 198 transitions, 759 flow [2021-12-21 14:58:27,753 INFO L471 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) [2021-12-21 14:58:27,753 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:27,753 INFO L254 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] [2021-12-21 14:58:27,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-21 14:58:27,753 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:27,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:27,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1806226238, now seen corresponding path program 1 times [2021-12-21 14:58:27,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:27,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142988661] [2021-12-21 14:58:27,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:27,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:27,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:27,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:27,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142988661] [2021-12-21 14:58:27,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142988661] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:27,789 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:27,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 14:58:27,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669424792] [2021-12-21 14:58:27,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:27,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 14:58:27,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:27,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 14:58:27,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 14:58:27,791 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 183 [2021-12-21 14:58:27,791 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 198 transitions, 759 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) [2021-12-21 14:58:27,791 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:27,792 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 183 [2021-12-21 14:58:27,792 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:28,158 INFO L129 PetriNetUnfolder]: 1154/3641 cut-off events. [2021-12-21 14:58:28,159 INFO L130 PetriNetUnfolder]: For 3559/3615 co-relation queries the response was YES. [2021-12-21 14:58:28,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8488 conditions, 3641 events. 1154/3641 cut-off events. For 3559/3615 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 34008 event pairs, 284 based on Foata normal form. 16/3470 useless extension candidates. Maximal degree in co-relation 8219. Up to 1180 conditions per place. [2021-12-21 14:58:28,181 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 70 selfloop transitions, 31 changer transitions 11/256 dead transitions. [2021-12-21 14:58:28,182 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 256 transitions, 1276 flow [2021-12-21 14:58:28,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 14:58:28,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-21 14:58:28,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1124 transitions. [2021-12-21 14:58:28,184 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.87743950039032 [2021-12-21 14:58:28,184 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1124 transitions. [2021-12-21 14:58:28,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1124 transitions. [2021-12-21 14:58:28,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:28,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1124 transitions. [2021-12-21 14:58:28,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 160.57142857142858) internal successors, (1124), 7 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:28,188 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) [2021-12-21 14:58:28,188 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) [2021-12-21 14:58:28,188 INFO L186 Difference]: Start difference. First operand has 212 places, 198 transitions, 759 flow. Second operand 7 states and 1124 transitions. [2021-12-21 14:58:28,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 256 transitions, 1276 flow [2021-12-21 14:58:28,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 256 transitions, 1226 flow, removed 19 selfloop flow, removed 6 redundant places. [2021-12-21 14:58:28,201 INFO L242 Difference]: Finished difference. Result has 203 places, 213 transitions, 944 flow [2021-12-21 14:58:28,201 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=944, PETRI_PLACES=203, PETRI_TRANSITIONS=213} [2021-12-21 14:58:28,201 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 43 predicate places. [2021-12-21 14:58:28,202 INFO L470 AbstractCegarLoop]: Abstraction has has 203 places, 213 transitions, 944 flow [2021-12-21 14:58:28,202 INFO L471 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) [2021-12-21 14:58:28,202 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:28,202 INFO L254 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] [2021-12-21 14:58:28,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-21 14:58:28,202 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:28,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:28,203 INFO L85 PathProgramCache]: Analyzing trace with hash -260037506, now seen corresponding path program 1 times [2021-12-21 14:58:28,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:28,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740082015] [2021-12-21 14:58:28,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:28,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:28,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:28,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740082015] [2021-12-21 14:58:28,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740082015] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:28,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:28,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 14:58:28,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587466781] [2021-12-21 14:58:28,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:28,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 14:58:28,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:28,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 14:58:28,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 14:58:28,232 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183 [2021-12-21 14:58:28,232 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 213 transitions, 944 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) [2021-12-21 14:58:28,232 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:28,232 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183 [2021-12-21 14:58:28,232 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:28,435 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([842] L771-->L771-1: Formula: (<= v_~idx~0_5 0) InVars {~idx~0=v_~idx~0_5} OutVars{~idx~0=v_~idx~0_5} AuxVars[] AssignedVars[][145], [111#L739-3true, 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 79#L771-1true, 276#(= ~readerprogress2~0 2), 300#(= ~idx~0 0), 284#true, Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 262#(= ~readerprogress2~0 0), 260#true, Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 101#L786-4true, 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 257#(= ~readerprogress1~0 2), Black: 281#(= (+ (- 1) ~idx~0) 0), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 288#(<= 1 ~ctr2~0), Black: 225#(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: 286#(= ~ctr2~0 0), Black: 213#(= ~readerprogress1~0 0), Black: 219#(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: 287#(= |qrcu_updaterThread1of1ForFork0_#t~post16#1| 0), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-12-21 14:58:28,435 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-12-21 14:58:28,435 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-12-21 14:58:28,435 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-21 14:58:28,435 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-21 14:58:28,470 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([842] L771-->L771-1: Formula: (<= v_~idx~0_5 0) InVars {~idx~0=v_~idx~0_5} OutVars{~idx~0=v_~idx~0_5} AuxVars[] AssignedVars[][145], [240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 79#L771-1true, 276#(= ~readerprogress2~0 2), 300#(= ~idx~0 0), 109#L787-2true, 284#true, Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 262#(= ~readerprogress2~0 0), 260#true, Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 257#(= ~readerprogress1~0 2), Black: 281#(= (+ (- 1) ~idx~0) 0), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 288#(<= 1 ~ctr2~0), Black: 225#(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: 286#(= ~ctr2~0 0), Black: 213#(= ~readerprogress1~0 0), Black: 219#(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: 287#(= |qrcu_updaterThread1of1ForFork0_#t~post16#1| 0), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-12-21 14:58:28,470 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2021-12-21 14:58:28,470 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-21 14:58:28,470 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-21 14:58:28,470 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-21 14:58:28,496 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([842] L771-->L771-1: Formula: (<= v_~idx~0_5 0) InVars {~idx~0=v_~idx~0_5} OutVars{~idx~0=v_~idx~0_5} AuxVars[] AssignedVars[][145], [240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 79#L771-1true, 276#(= ~readerprogress2~0 2), 300#(= ~idx~0 0), 284#true, 87#L788-2true, Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 262#(= ~readerprogress2~0 0), 260#true, Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 257#(= ~readerprogress1~0 2), Black: 281#(= (+ (- 1) ~idx~0) 0), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 288#(<= 1 ~ctr2~0), Black: 225#(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: 286#(= ~ctr2~0 0), Black: 213#(= ~readerprogress1~0 0), Black: 219#(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: 287#(= |qrcu_updaterThread1of1ForFork0_#t~post16#1| 0), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-12-21 14:58:28,497 INFO L384 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event [2021-12-21 14:58:28,497 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-21 14:58:28,497 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-21 14:58:28,497 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-12-21 14:58:28,510 INFO L129 PetriNetUnfolder]: 764/2775 cut-off events. [2021-12-21 14:58:28,510 INFO L130 PetriNetUnfolder]: For 4708/4776 co-relation queries the response was YES. [2021-12-21 14:58:28,525 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6783 conditions, 2775 events. 764/2775 cut-off events. For 4708/4776 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 23900 event pairs, 187 based on Foata normal form. 12/2643 useless extension candidates. Maximal degree in co-relation 6509. Up to 717 conditions per place. [2021-12-21 14:58:28,530 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 56 selfloop transitions, 2 changer transitions 5/209 dead transitions. [2021-12-21 14:58:28,530 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 209 transitions, 1066 flow [2021-12-21 14:58:28,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 14:58:28,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-21 14:58:28,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2021-12-21 14:58:28,532 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2021-12-21 14:58:28,532 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 488 transitions. [2021-12-21 14:58:28,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 488 transitions. [2021-12-21 14:58:28,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:28,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 488 transitions. [2021-12-21 14:58:28,533 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) [2021-12-21 14:58:28,534 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) [2021-12-21 14:58:28,534 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) [2021-12-21 14:58:28,534 INFO L186 Difference]: Start difference. First operand has 203 places, 213 transitions, 944 flow. Second operand 3 states and 488 transitions. [2021-12-21 14:58:28,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 209 transitions, 1066 flow [2021-12-21 14:58:28,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 209 transitions, 1049 flow, removed 8 selfloop flow, removed 2 redundant places. [2021-12-21 14:58:28,546 INFO L242 Difference]: Finished difference. Result has 194 places, 189 transitions, 790 flow [2021-12-21 14:58:28,546 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=194, PETRI_TRANSITIONS=189} [2021-12-21 14:58:28,547 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 34 predicate places. [2021-12-21 14:58:28,547 INFO L470 AbstractCegarLoop]: Abstraction has has 194 places, 189 transitions, 790 flow [2021-12-21 14:58:28,547 INFO L471 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) [2021-12-21 14:58:28,547 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:28,547 INFO L254 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] [2021-12-21 14:58:28,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-21 14:58:28,547 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:28,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:28,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1048963744, now seen corresponding path program 1 times [2021-12-21 14:58:28,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:28,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955069102] [2021-12-21 14:58:28,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:28,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:28,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:28,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955069102] [2021-12-21 14:58:28,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955069102] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:28,650 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:28,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 14:58:28,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635143809] [2021-12-21 14:58:28,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:28,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 14:58:28,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:28,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 14:58:28,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-21 14:58:28,652 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-21 14:58:28,653 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 189 transitions, 790 flow. Second operand has 10 states, 10 states have (on average 125.1) internal successors, (1251), 10 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:28,654 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:28,654 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-21 14:58:28,654 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:29,246 INFO L129 PetriNetUnfolder]: 1679/4124 cut-off events. [2021-12-21 14:58:29,247 INFO L130 PetriNetUnfolder]: For 7838/7917 co-relation queries the response was YES. [2021-12-21 14:58:29,262 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12232 conditions, 4124 events. 1679/4124 cut-off events. For 7838/7917 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 34079 event pairs, 371 based on Foata normal form. 60/4073 useless extension candidates. Maximal degree in co-relation 11970. Up to 1724 conditions per place. [2021-12-21 14:58:29,271 INFO L132 encePairwiseOnDemand]: 167/183 looper letters, 131 selfloop transitions, 46 changer transitions 9/296 dead transitions. [2021-12-21 14:58:29,271 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 296 transitions, 1840 flow [2021-12-21 14:58:29,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 14:58:29,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-21 14:58:29,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1493 transitions. [2021-12-21 14:58:29,274 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.741679085941381 [2021-12-21 14:58:29,274 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1493 transitions. [2021-12-21 14:58:29,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1493 transitions. [2021-12-21 14:58:29,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:29,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1493 transitions. [2021-12-21 14:58:29,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 135.72727272727272) internal successors, (1493), 11 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:29,280 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) [2021-12-21 14:58:29,280 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) [2021-12-21 14:58:29,280 INFO L186 Difference]: Start difference. First operand has 194 places, 189 transitions, 790 flow. Second operand 11 states and 1493 transitions. [2021-12-21 14:58:29,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 296 transitions, 1840 flow [2021-12-21 14:58:29,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 296 transitions, 1836 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-21 14:58:29,295 INFO L242 Difference]: Finished difference. Result has 206 places, 215 transitions, 1223 flow [2021-12-21 14:58:29,295 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1223, PETRI_PLACES=206, PETRI_TRANSITIONS=215} [2021-12-21 14:58:29,296 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 46 predicate places. [2021-12-21 14:58:29,296 INFO L470 AbstractCegarLoop]: Abstraction has has 206 places, 215 transitions, 1223 flow [2021-12-21 14:58:29,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 125.1) internal successors, (1251), 10 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:29,296 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:29,296 INFO L254 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] [2021-12-21 14:58:29,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-21 14:58:29,297 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:29,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:29,297 INFO L85 PathProgramCache]: Analyzing trace with hash 134346234, now seen corresponding path program 2 times [2021-12-21 14:58:29,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:29,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010115442] [2021-12-21 14:58:29,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:29,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:29,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:29,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:29,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010115442] [2021-12-21 14:58:29,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010115442] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:29,404 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:29,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 14:58:29,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761957356] [2021-12-21 14:58:29,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:29,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 14:58:29,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:29,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 14:58:29,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-21 14:58:29,406 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-21 14:58:29,407 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 215 transitions, 1223 flow. Second operand has 10 states, 10 states have (on average 125.1) internal successors, (1251), 10 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:29,407 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:29,407 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-21 14:58:29,407 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:30,067 INFO L129 PetriNetUnfolder]: 1737/4339 cut-off events. [2021-12-21 14:58:30,067 INFO L130 PetriNetUnfolder]: For 11901/11980 co-relation queries the response was YES. [2021-12-21 14:58:30,089 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14116 conditions, 4339 events. 1737/4339 cut-off events. For 11901/11980 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 36723 event pairs, 434 based on Foata normal form. 65/4265 useless extension candidates. Maximal degree in co-relation 13838. Up to 1676 conditions per place. [2021-12-21 14:58:30,097 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 130 selfloop transitions, 65 changer transitions 32/337 dead transitions. [2021-12-21 14:58:30,097 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 337 transitions, 2586 flow [2021-12-21 14:58:30,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 14:58:30,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-21 14:58:30,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1753 transitions. [2021-12-21 14:58:30,100 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7368642286675073 [2021-12-21 14:58:30,100 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1753 transitions. [2021-12-21 14:58:30,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1753 transitions. [2021-12-21 14:58:30,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:30,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1753 transitions. [2021-12-21 14:58:30,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 134.84615384615384) internal successors, (1753), 13 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:30,106 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) [2021-12-21 14:58:30,107 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) [2021-12-21 14:58:30,107 INFO L186 Difference]: Start difference. First operand has 206 places, 215 transitions, 1223 flow. Second operand 13 states and 1753 transitions. [2021-12-21 14:58:30,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 337 transitions, 2586 flow [2021-12-21 14:58:30,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 337 transitions, 2523 flow, removed 6 selfloop flow, removed 5 redundant places. [2021-12-21 14:58:30,131 INFO L242 Difference]: Finished difference. Result has 218 places, 231 transitions, 1591 flow [2021-12-21 14:58:30,131 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1591, PETRI_PLACES=218, PETRI_TRANSITIONS=231} [2021-12-21 14:58:30,132 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 58 predicate places. [2021-12-21 14:58:30,132 INFO L470 AbstractCegarLoop]: Abstraction has has 218 places, 231 transitions, 1591 flow [2021-12-21 14:58:30,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 125.1) internal successors, (1251), 10 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:30,132 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:30,132 INFO L254 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] [2021-12-21 14:58:30,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-21 14:58:30,133 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:30,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:30,133 INFO L85 PathProgramCache]: Analyzing trace with hash 591801310, now seen corresponding path program 1 times [2021-12-21 14:58:30,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:30,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646357797] [2021-12-21 14:58:30,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:30,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:30,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:30,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:30,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646357797] [2021-12-21 14:58:30,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646357797] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:30,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:30,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 14:58:30,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41580308] [2021-12-21 14:58:30,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:30,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 14:58:30,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:30,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 14:58:30,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-12-21 14:58:30,255 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-21 14:58:30,257 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 231 transitions, 1591 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) [2021-12-21 14:58:30,257 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:30,257 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-21 14:58:30,257 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:30,940 INFO L129 PetriNetUnfolder]: 1521/3941 cut-off events. [2021-12-21 14:58:30,940 INFO L130 PetriNetUnfolder]: For 15091/15212 co-relation queries the response was YES. [2021-12-21 14:58:30,960 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13400 conditions, 3941 events. 1521/3941 cut-off events. For 15091/15212 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 33535 event pairs, 442 based on Foata normal form. 91/3892 useless extension candidates. Maximal degree in co-relation 13133. Up to 1627 conditions per place. [2021-12-21 14:58:30,968 INFO L132 encePairwiseOnDemand]: 169/183 looper letters, 137 selfloop transitions, 59 changer transitions 7/313 dead transitions. [2021-12-21 14:58:30,968 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 313 transitions, 2486 flow [2021-12-21 14:58:30,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-21 14:58:30,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-21 14:58:30,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1861 transitions. [2021-12-21 14:58:30,972 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7263856362217018 [2021-12-21 14:58:30,972 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1861 transitions. [2021-12-21 14:58:30,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1861 transitions. [2021-12-21 14:58:30,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:30,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1861 transitions. [2021-12-21 14:58:30,976 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) [2021-12-21 14:58:30,978 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) [2021-12-21 14:58:30,978 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) [2021-12-21 14:58:30,979 INFO L186 Difference]: Start difference. First operand has 218 places, 231 transitions, 1591 flow. Second operand 14 states and 1861 transitions. [2021-12-21 14:58:30,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 313 transitions, 2486 flow [2021-12-21 14:58:31,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 313 transitions, 2420 flow, removed 16 selfloop flow, removed 4 redundant places. [2021-12-21 14:58:31,008 INFO L242 Difference]: Finished difference. Result has 229 places, 240 transitions, 1739 flow [2021-12-21 14:58:31,009 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1739, PETRI_PLACES=229, PETRI_TRANSITIONS=240} [2021-12-21 14:58:31,009 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 69 predicate places. [2021-12-21 14:58:31,009 INFO L470 AbstractCegarLoop]: Abstraction has has 229 places, 240 transitions, 1739 flow [2021-12-21 14:58:31,010 INFO L471 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) [2021-12-21 14:58:31,010 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:31,010 INFO L254 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] [2021-12-21 14:58:31,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-21 14:58:31,010 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:31,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:31,011 INFO L85 PathProgramCache]: Analyzing trace with hash 560799056, now seen corresponding path program 3 times [2021-12-21 14:58:31,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:31,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136250976] [2021-12-21 14:58:31,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:31,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:31,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:31,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136250976] [2021-12-21 14:58:31,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136250976] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:31,125 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:31,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 14:58:31,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115268028] [2021-12-21 14:58:31,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:31,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 14:58:31,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:31,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 14:58:31,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-21 14:58:31,128 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-21 14:58:31,129 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 240 transitions, 1739 flow. Second operand has 10 states, 10 states have (on average 125.1) internal successors, (1251), 10 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:31,129 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:31,129 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-21 14:58:31,129 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:31,900 INFO L129 PetriNetUnfolder]: 1454/3824 cut-off events. [2021-12-21 14:58:31,901 INFO L130 PetriNetUnfolder]: For 15705/15853 co-relation queries the response was YES. [2021-12-21 14:58:31,925 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12945 conditions, 3824 events. 1454/3824 cut-off events. For 15705/15853 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 32457 event pairs, 413 based on Foata normal form. 127/3821 useless extension candidates. Maximal degree in co-relation 12675. Up to 1302 conditions per place. [2021-12-21 14:58:31,933 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 153 selfloop transitions, 64 changer transitions 16/343 dead transitions. [2021-12-21 14:58:31,933 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 343 transitions, 2872 flow [2021-12-21 14:58:31,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 14:58:31,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-21 14:58:31,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1633 transitions. [2021-12-21 14:58:31,938 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7436247723132969 [2021-12-21 14:58:31,938 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1633 transitions. [2021-12-21 14:58:31,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1633 transitions. [2021-12-21 14:58:31,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:31,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1633 transitions. [2021-12-21 14:58:31,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 136.08333333333334) internal successors, (1633), 12 states have internal predecessors, (1633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:31,943 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) [2021-12-21 14:58:31,944 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) [2021-12-21 14:58:31,944 INFO L186 Difference]: Start difference. First operand has 229 places, 240 transitions, 1739 flow. Second operand 12 states and 1633 transitions. [2021-12-21 14:58:31,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 343 transitions, 2872 flow [2021-12-21 14:58:31,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 343 transitions, 2817 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-12-21 14:58:31,989 INFO L242 Difference]: Finished difference. Result has 239 places, 248 transitions, 1982 flow [2021-12-21 14:58:31,989 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1685, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1982, PETRI_PLACES=239, PETRI_TRANSITIONS=248} [2021-12-21 14:58:31,990 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 79 predicate places. [2021-12-21 14:58:31,990 INFO L470 AbstractCegarLoop]: Abstraction has has 239 places, 248 transitions, 1982 flow [2021-12-21 14:58:31,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 125.1) internal successors, (1251), 10 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:31,990 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:31,990 INFO L254 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] [2021-12-21 14:58:31,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-21 14:58:31,990 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:31,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:31,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2015600652, now seen corresponding path program 2 times [2021-12-21 14:58:31,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:31,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777083086] [2021-12-21 14:58:31,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:31,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:32,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:32,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:32,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777083086] [2021-12-21 14:58:32,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777083086] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:32,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:32,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 14:58:32,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835474548] [2021-12-21 14:58:32,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:32,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 14:58:32,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:32,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 14:58:32,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-21 14:58:32,125 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-21 14:58:32,126 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 248 transitions, 1982 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) [2021-12-21 14:58:32,126 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:32,126 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-21 14:58:32,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:32,934 INFO L129 PetriNetUnfolder]: 1421/3787 cut-off events. [2021-12-21 14:58:32,934 INFO L130 PetriNetUnfolder]: For 19784/19940 co-relation queries the response was YES. [2021-12-21 14:58:32,955 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13382 conditions, 3787 events. 1421/3787 cut-off events. For 19784/19940 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 32310 event pairs, 277 based on Foata normal form. 128/3789 useless extension candidates. Maximal degree in co-relation 13106. Up to 796 conditions per place. [2021-12-21 14:58:32,962 INFO L132 encePairwiseOnDemand]: 162/183 looper letters, 153 selfloop transitions, 66 changer transitions 32/361 dead transitions. [2021-12-21 14:58:32,962 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 361 transitions, 3245 flow [2021-12-21 14:58:32,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-21 14:58:32,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-21 14:58:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2144 transitions. [2021-12-21 14:58:32,964 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.73224043715847 [2021-12-21 14:58:32,965 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2144 transitions. [2021-12-21 14:58:32,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2144 transitions. [2021-12-21 14:58:32,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:32,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2144 transitions. [2021-12-21 14:58:32,968 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) [2021-12-21 14:58:32,970 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) [2021-12-21 14:58:32,971 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) [2021-12-21 14:58:32,971 INFO L186 Difference]: Start difference. First operand has 239 places, 248 transitions, 1982 flow. Second operand 16 states and 2144 transitions. [2021-12-21 14:58:32,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 361 transitions, 3245 flow [2021-12-21 14:58:33,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 361 transitions, 3152 flow, removed 28 selfloop flow, removed 5 redundant places. [2021-12-21 14:58:33,020 INFO L242 Difference]: Finished difference. Result has 254 places, 251 transitions, 2127 flow [2021-12-21 14:58:33,021 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1908, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2127, PETRI_PLACES=254, PETRI_TRANSITIONS=251} [2021-12-21 14:58:33,021 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 94 predicate places. [2021-12-21 14:58:33,021 INFO L470 AbstractCegarLoop]: Abstraction has has 254 places, 251 transitions, 2127 flow [2021-12-21 14:58:33,022 INFO L471 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) [2021-12-21 14:58:33,022 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:33,022 INFO L254 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] [2021-12-21 14:58:33,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-21 14:58:33,022 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:33,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:33,022 INFO L85 PathProgramCache]: Analyzing trace with hash 915709298, now seen corresponding path program 3 times [2021-12-21 14:58:33,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:33,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717615383] [2021-12-21 14:58:33,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:33,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:33,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:33,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717615383] [2021-12-21 14:58:33,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717615383] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:33,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:33,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 14:58:33,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586289843] [2021-12-21 14:58:33,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:33,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 14:58:33,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:33,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 14:58:33,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-21 14:58:33,131 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-21 14:58:33,132 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 251 transitions, 2127 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) [2021-12-21 14:58:33,132 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:33,132 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-21 14:58:33,132 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:33,868 INFO L129 PetriNetUnfolder]: 1367/3639 cut-off events. [2021-12-21 14:58:33,869 INFO L130 PetriNetUnfolder]: For 21962/22081 co-relation queries the response was YES. [2021-12-21 14:58:33,883 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13105 conditions, 3639 events. 1367/3639 cut-off events. For 21962/22081 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 30863 event pairs, 415 based on Foata normal form. 99/3610 useless extension candidates. Maximal degree in co-relation 12824. Up to 1352 conditions per place. [2021-12-21 14:58:33,888 INFO L132 encePairwiseOnDemand]: 169/183 looper letters, 134 selfloop transitions, 72 changer transitions 8/324 dead transitions. [2021-12-21 14:58:33,888 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 324 transitions, 2985 flow [2021-12-21 14:58:33,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 14:58:33,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-21 14:58:33,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1981 transitions. [2021-12-21 14:58:33,891 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7216757741347906 [2021-12-21 14:58:33,891 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1981 transitions. [2021-12-21 14:58:33,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1981 transitions. [2021-12-21 14:58:33,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:33,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1981 transitions. [2021-12-21 14:58:33,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 132.06666666666666) internal successors, (1981), 15 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:33,896 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) [2021-12-21 14:58:33,897 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) [2021-12-21 14:58:33,897 INFO L186 Difference]: Start difference. First operand has 254 places, 251 transitions, 2127 flow. Second operand 15 states and 1981 transitions. [2021-12-21 14:58:33,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 324 transitions, 2985 flow [2021-12-21 14:58:33,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 324 transitions, 2904 flow, removed 13 selfloop flow, removed 7 redundant places. [2021-12-21 14:58:33,947 INFO L242 Difference]: Finished difference. Result has 264 places, 255 transitions, 2265 flow [2021-12-21 14:58:33,948 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2021, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2265, PETRI_PLACES=264, PETRI_TRANSITIONS=255} [2021-12-21 14:58:33,948 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 104 predicate places. [2021-12-21 14:58:33,948 INFO L470 AbstractCegarLoop]: Abstraction has has 264 places, 255 transitions, 2265 flow [2021-12-21 14:58:33,949 INFO L471 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) [2021-12-21 14:58:33,949 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:33,949 INFO L254 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] [2021-12-21 14:58:33,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-21 14:58:33,949 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:33,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:33,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1065945954, now seen corresponding path program 1 times [2021-12-21 14:58:33,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:33,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117988110] [2021-12-21 14:58:33,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:33,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:34,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:34,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:34,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117988110] [2021-12-21 14:58:34,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117988110] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:34,051 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:34,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 14:58:34,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427654177] [2021-12-21 14:58:34,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:34,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 14:58:34,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:34,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 14:58:34,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-21 14:58:34,054 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-21 14:58:34,055 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 255 transitions, 2265 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) [2021-12-21 14:58:34,055 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:34,055 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-21 14:58:34,055 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:34,688 INFO L129 PetriNetUnfolder]: 1335/3657 cut-off events. [2021-12-21 14:58:34,688 INFO L130 PetriNetUnfolder]: For 24193/24362 co-relation queries the response was YES. [2021-12-21 14:58:34,710 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13271 conditions, 3657 events. 1335/3657 cut-off events. For 24193/24362 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 30942 event pairs, 147 based on Foata normal form. 161/3693 useless extension candidates. Maximal degree in co-relation 12993. Up to 901 conditions per place. [2021-12-21 14:58:34,716 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 173 selfloop transitions, 62 changer transitions 27/372 dead transitions. [2021-12-21 14:58:34,717 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 372 transitions, 3690 flow [2021-12-21 14:58:34,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 14:58:34,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-21 14:58:34,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1639 transitions. [2021-12-21 14:58:34,726 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7463570127504554 [2021-12-21 14:58:34,726 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1639 transitions. [2021-12-21 14:58:34,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1639 transitions. [2021-12-21 14:58:34,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:34,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1639 transitions. [2021-12-21 14:58:34,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 136.58333333333334) internal successors, (1639), 12 states have internal predecessors, (1639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:34,739 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) [2021-12-21 14:58:34,740 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) [2021-12-21 14:58:34,755 INFO L186 Difference]: Start difference. First operand has 264 places, 255 transitions, 2265 flow. Second operand 12 states and 1639 transitions. [2021-12-21 14:58:34,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 372 transitions, 3690 flow [2021-12-21 14:58:34,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 372 transitions, 3518 flow, removed 44 selfloop flow, removed 8 redundant places. [2021-12-21 14:58:34,834 INFO L242 Difference]: Finished difference. Result has 272 places, 272 transitions, 2567 flow [2021-12-21 14:58:34,834 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2151, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2567, PETRI_PLACES=272, PETRI_TRANSITIONS=272} [2021-12-21 14:58:34,835 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 112 predicate places. [2021-12-21 14:58:34,835 INFO L470 AbstractCegarLoop]: Abstraction has has 272 places, 272 transitions, 2567 flow [2021-12-21 14:58:34,835 INFO L471 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) [2021-12-21 14:58:34,835 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:34,835 INFO L254 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] [2021-12-21 14:58:34,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-21 14:58:34,836 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:34,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:34,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1880396016, now seen corresponding path program 1 times [2021-12-21 14:58:34,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:34,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193337433] [2021-12-21 14:58:34,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:34,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:34,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:34,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:34,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193337433] [2021-12-21 14:58:34,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193337433] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:34,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:34,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 14:58:34,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570338989] [2021-12-21 14:58:34,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:34,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 14:58:34,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:34,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 14:58:34,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-21 14:58:34,933 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-21 14:58:34,934 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 272 transitions, 2567 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) [2021-12-21 14:58:34,934 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:34,934 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-21 14:58:34,934 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:35,657 INFO L129 PetriNetUnfolder]: 1175/3584 cut-off events. [2021-12-21 14:58:35,657 INFO L130 PetriNetUnfolder]: For 25466/25646 co-relation queries the response was YES. [2021-12-21 14:58:35,683 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13182 conditions, 3584 events. 1175/3584 cut-off events. For 25466/25646 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 31337 event pairs, 148 based on Foata normal form. 159/3624 useless extension candidates. Maximal degree in co-relation 12890. Up to 468 conditions per place. [2021-12-21 14:58:35,690 INFO L132 encePairwiseOnDemand]: 162/183 looper letters, 160 selfloop transitions, 73 changer transitions 37/380 dead transitions. [2021-12-21 14:58:35,691 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 380 transitions, 3849 flow [2021-12-21 14:58:35,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-21 14:58:35,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-21 14:58:35,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2146 transitions. [2021-12-21 14:58:35,693 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7329234972677595 [2021-12-21 14:58:35,693 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2146 transitions. [2021-12-21 14:58:35,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2146 transitions. [2021-12-21 14:58:35,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:35,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2146 transitions. [2021-12-21 14:58:35,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 134.125) internal successors, (2146), 16 states have internal predecessors, (2146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:35,698 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) [2021-12-21 14:58:35,699 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) [2021-12-21 14:58:35,699 INFO L186 Difference]: Start difference. First operand has 272 places, 272 transitions, 2567 flow. Second operand 16 states and 2146 transitions. [2021-12-21 14:58:35,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 380 transitions, 3849 flow [2021-12-21 14:58:35,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 380 transitions, 3781 flow, removed 20 selfloop flow, removed 2 redundant places. [2021-12-21 14:58:35,763 INFO L242 Difference]: Finished difference. Result has 290 places, 274 transitions, 2732 flow [2021-12-21 14:58:35,763 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2510, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2732, PETRI_PLACES=290, PETRI_TRANSITIONS=274} [2021-12-21 14:58:35,765 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 130 predicate places. [2021-12-21 14:58:35,765 INFO L470 AbstractCegarLoop]: Abstraction has has 290 places, 274 transitions, 2732 flow [2021-12-21 14:58:35,765 INFO L471 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) [2021-12-21 14:58:35,765 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:35,765 INFO L254 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] [2021-12-21 14:58:35,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-21 14:58:35,766 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:35,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:35,766 INFO L85 PathProgramCache]: Analyzing trace with hash -938654044, now seen corresponding path program 2 times [2021-12-21 14:58:35,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:35,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851971096] [2021-12-21 14:58:35,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:35,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:35,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:35,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:35,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851971096] [2021-12-21 14:58:35,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851971096] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:35,873 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:35,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 14:58:35,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950346895] [2021-12-21 14:58:35,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:35,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 14:58:35,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:35,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 14:58:35,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-21 14:58:35,875 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-21 14:58:35,876 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 274 transitions, 2732 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) [2021-12-21 14:58:35,876 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:35,876 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-21 14:58:35,876 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:36,513 INFO L129 PetriNetUnfolder]: 1100/3316 cut-off events. [2021-12-21 14:58:36,513 INFO L130 PetriNetUnfolder]: For 28950/29064 co-relation queries the response was YES. [2021-12-21 14:58:36,536 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12799 conditions, 3316 events. 1100/3316 cut-off events. For 28950/29064 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 28323 event pairs, 251 based on Foata normal form. 101/3287 useless extension candidates. Maximal degree in co-relation 12501. Up to 963 conditions per place. [2021-12-21 14:58:36,544 INFO L132 encePairwiseOnDemand]: 167/183 looper letters, 155 selfloop transitions, 71 changer transitions 17/353 dead transitions. [2021-12-21 14:58:36,544 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 353 transitions, 3795 flow [2021-12-21 14:58:36,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 14:58:36,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-21 14:58:36,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1618 transitions. [2021-12-21 14:58:36,546 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7367941712204007 [2021-12-21 14:58:36,546 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1618 transitions. [2021-12-21 14:58:36,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1618 transitions. [2021-12-21 14:58:36,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:36,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1618 transitions. [2021-12-21 14:58:36,548 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) [2021-12-21 14:58:36,550 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) [2021-12-21 14:58:36,550 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) [2021-12-21 14:58:36,551 INFO L186 Difference]: Start difference. First operand has 290 places, 274 transitions, 2732 flow. Second operand 12 states and 1618 transitions. [2021-12-21 14:58:36,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 353 transitions, 3795 flow [2021-12-21 14:58:36,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 353 transitions, 3652 flow, removed 8 selfloop flow, removed 9 redundant places. [2021-12-21 14:58:36,626 INFO L242 Difference]: Finished difference. Result has 294 places, 276 transitions, 2859 flow [2021-12-21 14:58:36,626 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2611, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2859, PETRI_PLACES=294, PETRI_TRANSITIONS=276} [2021-12-21 14:58:36,627 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 134 predicate places. [2021-12-21 14:58:36,627 INFO L470 AbstractCegarLoop]: Abstraction has has 294 places, 276 transitions, 2859 flow [2021-12-21 14:58:36,628 INFO L471 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) [2021-12-21 14:58:36,628 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:36,628 INFO L254 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] [2021-12-21 14:58:36,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-21 14:58:36,628 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:36,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:36,629 INFO L85 PathProgramCache]: Analyzing trace with hash -140786344, now seen corresponding path program 2 times [2021-12-21 14:58:36,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:36,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71442317] [2021-12-21 14:58:36,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:36,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:36,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:36,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:36,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71442317] [2021-12-21 14:58:36,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71442317] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:36,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:36,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 14:58:36,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698975579] [2021-12-21 14:58:36,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:36,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 14:58:36,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:36,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 14:58:36,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-21 14:58:36,742 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-21 14:58:36,742 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 276 transitions, 2859 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) [2021-12-21 14:58:36,742 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:36,742 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-21 14:58:36,743 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:37,485 INFO L129 PetriNetUnfolder]: 935/2980 cut-off events. [2021-12-21 14:58:37,486 INFO L130 PetriNetUnfolder]: For 28607/28717 co-relation queries the response was YES. [2021-12-21 14:58:37,508 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11662 conditions, 2980 events. 935/2980 cut-off events. For 28607/28717 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 25146 event pairs, 202 based on Foata normal form. 92/2953 useless extension candidates. Maximal degree in co-relation 11415. Up to 789 conditions per place. [2021-12-21 14:58:37,515 INFO L132 encePairwiseOnDemand]: 169/183 looper letters, 144 selfloop transitions, 74 changer transitions 21/344 dead transitions. [2021-12-21 14:58:37,515 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 344 transitions, 3743 flow [2021-12-21 14:58:37,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 14:58:37,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-21 14:58:37,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1982 transitions. [2021-12-21 14:58:37,517 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.722040072859745 [2021-12-21 14:58:37,517 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1982 transitions. [2021-12-21 14:58:37,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1982 transitions. [2021-12-21 14:58:37,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:37,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1982 transitions. [2021-12-21 14:58:37,540 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) [2021-12-21 14:58:37,542 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) [2021-12-21 14:58:37,543 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) [2021-12-21 14:58:37,543 INFO L186 Difference]: Start difference. First operand has 294 places, 276 transitions, 2859 flow. Second operand 15 states and 1982 transitions. [2021-12-21 14:58:37,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 344 transitions, 3743 flow [2021-12-21 14:58:37,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 344 transitions, 3691 flow, removed 1 selfloop flow, removed 6 redundant places. [2021-12-21 14:58:37,618 INFO L242 Difference]: Finished difference. Result has 301 places, 262 transitions, 2828 flow [2021-12-21 14:58:37,618 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2775, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2828, PETRI_PLACES=301, PETRI_TRANSITIONS=262} [2021-12-21 14:58:37,619 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 141 predicate places. [2021-12-21 14:58:37,619 INFO L470 AbstractCegarLoop]: Abstraction has has 301 places, 262 transitions, 2828 flow [2021-12-21 14:58:37,619 INFO L471 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) [2021-12-21 14:58:37,619 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:37,619 INFO L254 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] [2021-12-21 14:58:37,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-21 14:58:37,619 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:37,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:37,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1398292697, now seen corresponding path program 1 times [2021-12-21 14:58:37,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:37,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488889481] [2021-12-21 14:58:37,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:37,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:37,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:37,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488889481] [2021-12-21 14:58:37,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488889481] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:37,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:37,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 14:58:37,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124189350] [2021-12-21 14:58:37,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:37,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 14:58:37,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:37,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 14:58:37,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-21 14:58:37,684 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-21 14:58:37,685 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 262 transitions, 2828 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) [2021-12-21 14:58:37,685 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:37,685 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-21 14:58:37,685 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:38,041 INFO L129 PetriNetUnfolder]: 563/2124 cut-off events. [2021-12-21 14:58:38,042 INFO L130 PetriNetUnfolder]: For 19610/19643 co-relation queries the response was YES. [2021-12-21 14:58:38,056 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7976 conditions, 2124 events. 563/2124 cut-off events. For 19610/19643 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 16633 event pairs, 108 based on Foata normal form. 15/2056 useless extension candidates. Maximal degree in co-relation 7769. Up to 278 conditions per place. [2021-12-21 14:58:38,061 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 108 selfloop transitions, 37 changer transitions 51/331 dead transitions. [2021-12-21 14:58:38,061 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 331 transitions, 3728 flow [2021-12-21 14:58:38,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 14:58:38,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-21 14:58:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1625 transitions. [2021-12-21 14:58:38,063 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8072528564331843 [2021-12-21 14:58:38,063 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1625 transitions. [2021-12-21 14:58:38,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1625 transitions. [2021-12-21 14:58:38,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:38,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1625 transitions. [2021-12-21 14:58:38,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 147.72727272727272) internal successors, (1625), 11 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:38,067 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) [2021-12-21 14:58:38,067 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) [2021-12-21 14:58:38,067 INFO L186 Difference]: Start difference. First operand has 301 places, 262 transitions, 2828 flow. Second operand 11 states and 1625 transitions. [2021-12-21 14:58:38,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 331 transitions, 3728 flow [2021-12-21 14:58:38,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 331 transitions, 3390 flow, removed 30 selfloop flow, removed 22 redundant places. [2021-12-21 14:58:38,106 INFO L242 Difference]: Finished difference. Result has 287 places, 238 transitions, 2234 flow [2021-12-21 14:58:38,106 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2546, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2234, PETRI_PLACES=287, PETRI_TRANSITIONS=238} [2021-12-21 14:58:38,106 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 127 predicate places. [2021-12-21 14:58:38,107 INFO L470 AbstractCegarLoop]: Abstraction has has 287 places, 238 transitions, 2234 flow [2021-12-21 14:58:38,107 INFO L471 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) [2021-12-21 14:58:38,107 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:38,107 INFO L254 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] [2021-12-21 14:58:38,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-21 14:58:38,107 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:38,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:38,108 INFO L85 PathProgramCache]: Analyzing trace with hash 306531641, now seen corresponding path program 2 times [2021-12-21 14:58:38,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:38,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909188395] [2021-12-21 14:58:38,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:38,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:38,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:38,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:38,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909188395] [2021-12-21 14:58:38,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909188395] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:38,188 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:38,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 14:58:38,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364117529] [2021-12-21 14:58:38,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:38,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 14:58:38,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:38,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 14:58:38,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-21 14:58:38,189 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-21 14:58:38,190 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 238 transitions, 2234 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) [2021-12-21 14:58:38,190 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:38,190 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-21 14:58:38,190 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:38,533 INFO L129 PetriNetUnfolder]: 521/1844 cut-off events. [2021-12-21 14:58:38,534 INFO L130 PetriNetUnfolder]: For 13583/13642 co-relation queries the response was YES. [2021-12-21 14:58:38,545 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6703 conditions, 1844 events. 521/1844 cut-off events. For 13583/13642 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 13699 event pairs, 91 based on Foata normal form. 35/1791 useless extension candidates. Maximal degree in co-relation 6572. Up to 289 conditions per place. [2021-12-21 14:58:38,549 INFO L132 encePairwiseOnDemand]: 171/183 looper letters, 110 selfloop transitions, 45 changer transitions 23/313 dead transitions. [2021-12-21 14:58:38,550 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 313 transitions, 3233 flow [2021-12-21 14:58:38,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 14:58:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-21 14:58:38,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1767 transitions. [2021-12-21 14:58:38,551 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8046448087431693 [2021-12-21 14:58:38,552 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1767 transitions. [2021-12-21 14:58:38,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1767 transitions. [2021-12-21 14:58:38,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:38,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1767 transitions. [2021-12-21 14:58:38,554 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) [2021-12-21 14:58:38,555 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) [2021-12-21 14:58:38,555 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) [2021-12-21 14:58:38,556 INFO L186 Difference]: Start difference. First operand has 287 places, 238 transitions, 2234 flow. Second operand 12 states and 1767 transitions. [2021-12-21 14:58:38,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 313 transitions, 3233 flow [2021-12-21 14:58:38,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 313 transitions, 2869 flow, removed 37 selfloop flow, removed 29 redundant places. [2021-12-21 14:58:38,583 INFO L242 Difference]: Finished difference. Result has 275 places, 250 transitions, 2216 flow [2021-12-21 14:58:38,584 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1975, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2216, PETRI_PLACES=275, PETRI_TRANSITIONS=250} [2021-12-21 14:58:38,584 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 115 predicate places. [2021-12-21 14:58:38,585 INFO L470 AbstractCegarLoop]: Abstraction has has 275 places, 250 transitions, 2216 flow [2021-12-21 14:58:38,585 INFO L471 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) [2021-12-21 14:58:38,585 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:38,585 INFO L254 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] [2021-12-21 14:58:38,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-21 14:58:38,585 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:38,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:38,586 INFO L85 PathProgramCache]: Analyzing trace with hash -750576933, now seen corresponding path program 3 times [2021-12-21 14:58:38,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:38,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760571403] [2021-12-21 14:58:38,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:38,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:38,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:38,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:38,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760571403] [2021-12-21 14:58:38,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760571403] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:38,654 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:38,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 14:58:38,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217277413] [2021-12-21 14:58:38,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:38,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 14:58:38,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:38,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 14:58:38,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-21 14:58:38,656 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-21 14:58:38,656 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 250 transitions, 2216 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) [2021-12-21 14:58:38,656 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:38,657 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-21 14:58:38,657 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:38,985 INFO L129 PetriNetUnfolder]: 538/1992 cut-off events. [2021-12-21 14:58:38,986 INFO L130 PetriNetUnfolder]: For 12090/12168 co-relation queries the response was YES. [2021-12-21 14:58:38,997 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6872 conditions, 1992 events. 538/1992 cut-off events. For 12090/12168 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 15353 event pairs, 107 based on Foata normal form. 41/1926 useless extension candidates. Maximal degree in co-relation 6420. Up to 279 conditions per place. [2021-12-21 14:58:39,002 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 105 selfloop transitions, 52 changer transitions 37/329 dead transitions. [2021-12-21 14:58:39,002 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 329 transitions, 3234 flow [2021-12-21 14:58:39,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 14:58:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-21 14:58:39,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1769 transitions. [2021-12-21 14:58:39,004 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8055555555555556 [2021-12-21 14:58:39,004 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1769 transitions. [2021-12-21 14:58:39,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1769 transitions. [2021-12-21 14:58:39,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:39,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1769 transitions. [2021-12-21 14:58:39,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 147.41666666666666) internal successors, (1769), 12 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:39,007 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) [2021-12-21 14:58:39,008 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) [2021-12-21 14:58:39,008 INFO L186 Difference]: Start difference. First operand has 275 places, 250 transitions, 2216 flow. Second operand 12 states and 1769 transitions. [2021-12-21 14:58:39,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 329 transitions, 3234 flow [2021-12-21 14:58:39,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 329 transitions, 3163 flow, removed 20 selfloop flow, removed 3 redundant places. [2021-12-21 14:58:39,034 INFO L242 Difference]: Finished difference. Result has 288 places, 256 transitions, 2375 flow [2021-12-21 14:58:39,034 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2159, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2375, PETRI_PLACES=288, PETRI_TRANSITIONS=256} [2021-12-21 14:58:39,035 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 128 predicate places. [2021-12-21 14:58:39,035 INFO L470 AbstractCegarLoop]: Abstraction has has 288 places, 256 transitions, 2375 flow [2021-12-21 14:58:39,035 INFO L471 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) [2021-12-21 14:58:39,035 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:39,035 INFO L254 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] [2021-12-21 14:58:39,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-21 14:58:39,035 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:39,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:39,036 INFO L85 PathProgramCache]: Analyzing trace with hash 81452005, now seen corresponding path program 4 times [2021-12-21 14:58:39,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:39,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004662932] [2021-12-21 14:58:39,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:39,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:39,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:39,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:39,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004662932] [2021-12-21 14:58:39,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004662932] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:39,064 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:39,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 14:58:39,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858626319] [2021-12-21 14:58:39,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:39,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 14:58:39,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:39,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 14:58:39,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 14:58:39,066 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2021-12-21 14:58:39,066 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 256 transitions, 2375 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) [2021-12-21 14:58:39,066 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:39,066 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2021-12-21 14:58:39,066 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:39,307 INFO L129 PetriNetUnfolder]: 432/1923 cut-off events. [2021-12-21 14:58:39,307 INFO L130 PetriNetUnfolder]: For 13543/13630 co-relation queries the response was YES. [2021-12-21 14:58:39,319 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6568 conditions, 1923 events. 432/1923 cut-off events. For 13543/13630 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 15085 event pairs, 109 based on Foata normal form. 46/1841 useless extension candidates. Maximal degree in co-relation 6400. Up to 343 conditions per place. [2021-12-21 14:58:39,323 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 91 selfloop transitions, 10 changer transitions 8/278 dead transitions. [2021-12-21 14:58:39,323 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 278 transitions, 2786 flow [2021-12-21 14:58:39,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 14:58:39,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-21 14:58:39,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 643 transitions. [2021-12-21 14:58:39,325 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8784153005464481 [2021-12-21 14:58:39,325 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 643 transitions. [2021-12-21 14:58:39,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 643 transitions. [2021-12-21 14:58:39,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:39,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 643 transitions. [2021-12-21 14:58:39,326 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) [2021-12-21 14:58:39,326 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) [2021-12-21 14:58:39,326 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) [2021-12-21 14:58:39,327 INFO L186 Difference]: Start difference. First operand has 288 places, 256 transitions, 2375 flow. Second operand 4 states and 643 transitions. [2021-12-21 14:58:39,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 278 transitions, 2786 flow [2021-12-21 14:58:39,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 278 transitions, 2656 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-12-21 14:58:39,355 INFO L242 Difference]: Finished difference. Result has 285 places, 255 transitions, 2285 flow [2021-12-21 14:58:39,355 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2255, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2285, PETRI_PLACES=285, PETRI_TRANSITIONS=255} [2021-12-21 14:58:39,356 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 125 predicate places. [2021-12-21 14:58:39,356 INFO L470 AbstractCegarLoop]: Abstraction has has 285 places, 255 transitions, 2285 flow [2021-12-21 14:58:39,356 INFO L471 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) [2021-12-21 14:58:39,356 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:39,356 INFO L254 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] [2021-12-21 14:58:39,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-21 14:58:39,357 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:39,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:39,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1448459419, now seen corresponding path program 5 times [2021-12-21 14:58:39,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:39,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286024625] [2021-12-21 14:58:39,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:39,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:39,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:39,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286024625] [2021-12-21 14:58:39,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286024625] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:39,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:39,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 14:58:39,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42869164] [2021-12-21 14:58:39,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:39,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 14:58:39,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:39,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 14:58:39,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-21 14:58:39,424 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-21 14:58:39,425 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 255 transitions, 2285 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) [2021-12-21 14:58:39,425 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:39,425 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-21 14:58:39,425 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:39,873 INFO L129 PetriNetUnfolder]: 493/1999 cut-off events. [2021-12-21 14:58:39,874 INFO L130 PetriNetUnfolder]: For 13779/13945 co-relation queries the response was YES. [2021-12-21 14:58:39,884 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7021 conditions, 1999 events. 493/1999 cut-off events. For 13779/13945 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 15703 event pairs, 112 based on Foata normal form. 98/1979 useless extension candidates. Maximal degree in co-relation 6870. Up to 259 conditions per place. [2021-12-21 14:58:39,890 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 100 selfloop transitions, 52 changer transitions 43/330 dead transitions. [2021-12-21 14:58:39,890 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 330 transitions, 3374 flow [2021-12-21 14:58:39,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-21 14:58:39,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-21 14:58:39,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2047 transitions. [2021-12-21 14:58:39,893 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7989851678376269 [2021-12-21 14:58:39,893 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2047 transitions. [2021-12-21 14:58:39,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2047 transitions. [2021-12-21 14:58:39,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:39,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2047 transitions. [2021-12-21 14:58:39,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 146.21428571428572) internal successors, (2047), 14 states have internal predecessors, (2047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:39,897 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) [2021-12-21 14:58:39,897 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) [2021-12-21 14:58:39,898 INFO L186 Difference]: Start difference. First operand has 285 places, 255 transitions, 2285 flow. Second operand 14 states and 2047 transitions. [2021-12-21 14:58:39,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 330 transitions, 3374 flow [2021-12-21 14:58:39,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 330 transitions, 3318 flow, removed 19 selfloop flow, removed 4 redundant places. [2021-12-21 14:58:39,925 INFO L242 Difference]: Finished difference. Result has 299 places, 255 transitions, 2433 flow [2021-12-21 14:58:39,926 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2205, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2433, PETRI_PLACES=299, PETRI_TRANSITIONS=255} [2021-12-21 14:58:39,927 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 139 predicate places. [2021-12-21 14:58:39,927 INFO L470 AbstractCegarLoop]: Abstraction has has 299 places, 255 transitions, 2433 flow [2021-12-21 14:58:39,927 INFO L471 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) [2021-12-21 14:58:39,927 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:39,928 INFO L254 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] [2021-12-21 14:58:39,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-21 14:58:39,928 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:39,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:39,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1658393395, now seen corresponding path program 1 times [2021-12-21 14:58:39,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:39,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322101494] [2021-12-21 14:58:39,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:39,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:40,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:40,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:40,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322101494] [2021-12-21 14:58:40,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322101494] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:40,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:40,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 14:58:40,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395760935] [2021-12-21 14:58:40,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:40,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 14:58:40,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:40,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 14:58:40,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-21 14:58:40,052 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-21 14:58:40,053 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 255 transitions, 2433 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) [2021-12-21 14:58:40,053 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:40,053 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-21 14:58:40,053 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:40,401 INFO L129 PetriNetUnfolder]: 419/1780 cut-off events. [2021-12-21 14:58:40,401 INFO L130 PetriNetUnfolder]: For 14511/14682 co-relation queries the response was YES. [2021-12-21 14:58:40,414 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6545 conditions, 1780 events. 419/1780 cut-off events. For 14511/14682 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 13507 event pairs, 88 based on Foata normal form. 114/1796 useless extension candidates. Maximal degree in co-relation 6357. Up to 284 conditions per place. [2021-12-21 14:58:40,417 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 92 selfloop transitions, 39 changer transitions 40/297 dead transitions. [2021-12-21 14:58:40,418 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 297 transitions, 3116 flow [2021-12-21 14:58:40,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 14:58:40,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-21 14:58:40,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1599 transitions. [2021-12-21 14:58:40,419 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7943368107302533 [2021-12-21 14:58:40,419 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1599 transitions. [2021-12-21 14:58:40,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1599 transitions. [2021-12-21 14:58:40,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:40,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1599 transitions. [2021-12-21 14:58:40,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 145.36363636363637) internal successors, (1599), 11 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:40,423 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) [2021-12-21 14:58:40,423 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) [2021-12-21 14:58:40,423 INFO L186 Difference]: Start difference. First operand has 299 places, 255 transitions, 2433 flow. Second operand 11 states and 1599 transitions. [2021-12-21 14:58:40,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 297 transitions, 3116 flow [2021-12-21 14:58:40,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 297 transitions, 2994 flow, removed 13 selfloop flow, removed 13 redundant places. [2021-12-21 14:58:40,454 INFO L242 Difference]: Finished difference. Result has 296 places, 229 transitions, 1927 flow [2021-12-21 14:58:40,455 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2320, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1927, PETRI_PLACES=296, PETRI_TRANSITIONS=229} [2021-12-21 14:58:40,455 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 136 predicate places. [2021-12-21 14:58:40,455 INFO L470 AbstractCegarLoop]: Abstraction has has 296 places, 229 transitions, 1927 flow [2021-12-21 14:58:40,456 INFO L471 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) [2021-12-21 14:58:40,456 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:40,456 INFO L254 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] [2021-12-21 14:58:40,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-21 14:58:40,456 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:40,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:40,456 INFO L85 PathProgramCache]: Analyzing trace with hash 802254649, now seen corresponding path program 2 times [2021-12-21 14:58:40,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:40,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806112327] [2021-12-21 14:58:40,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:40,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:40,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:40,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:40,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806112327] [2021-12-21 14:58:40,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806112327] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:40,515 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:40,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 14:58:40,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856824026] [2021-12-21 14:58:40,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:40,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 14:58:40,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:40,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 14:58:40,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-21 14:58:40,517 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-21 14:58:40,517 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 229 transitions, 1927 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) [2021-12-21 14:58:40,517 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:40,518 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-21 14:58:40,518 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:40,778 INFO L129 PetriNetUnfolder]: 289/1340 cut-off events. [2021-12-21 14:58:40,779 INFO L130 PetriNetUnfolder]: For 8268/8400 co-relation queries the response was YES. [2021-12-21 14:58:40,786 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4657 conditions, 1340 events. 289/1340 cut-off events. For 8268/8400 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 9162 event pairs, 48 based on Foata normal form. 113/1371 useless extension candidates. Maximal degree in co-relation 4299. Up to 139 conditions per place. [2021-12-21 14:58:40,789 INFO L132 encePairwiseOnDemand]: 171/183 looper letters, 93 selfloop transitions, 42 changer transitions 30/284 dead transitions. [2021-12-21 14:58:40,789 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 284 transitions, 2786 flow [2021-12-21 14:58:40,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 14:58:40,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-21 14:58:40,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1609 transitions. [2021-12-21 14:58:40,791 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.799304520615996 [2021-12-21 14:58:40,791 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1609 transitions. [2021-12-21 14:58:40,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1609 transitions. [2021-12-21 14:58:40,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:40,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1609 transitions. [2021-12-21 14:58:40,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 146.27272727272728) internal successors, (1609), 11 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:40,795 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) [2021-12-21 14:58:40,795 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) [2021-12-21 14:58:40,795 INFO L186 Difference]: Start difference. First operand has 296 places, 229 transitions, 1927 flow. Second operand 11 states and 1609 transitions. [2021-12-21 14:58:40,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 284 transitions, 2786 flow [2021-12-21 14:58:40,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 284 transitions, 2411 flow, removed 9 selfloop flow, removed 33 redundant places. [2021-12-21 14:58:40,815 INFO L242 Difference]: Finished difference. Result has 275 places, 226 transitions, 1752 flow [2021-12-21 14:58:40,815 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1599, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1752, PETRI_PLACES=275, PETRI_TRANSITIONS=226} [2021-12-21 14:58:40,816 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 115 predicate places. [2021-12-21 14:58:40,816 INFO L470 AbstractCegarLoop]: Abstraction has has 275 places, 226 transitions, 1752 flow [2021-12-21 14:58:40,816 INFO L471 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) [2021-12-21 14:58:40,816 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:40,817 INFO L254 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] [2021-12-21 14:58:40,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-21 14:58:40,817 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:40,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:40,817 INFO L85 PathProgramCache]: Analyzing trace with hash -3585930, now seen corresponding path program 1 times [2021-12-21 14:58:40,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:40,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613159270] [2021-12-21 14:58:40,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:40,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:40,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:40,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:40,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613159270] [2021-12-21 14:58:40,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613159270] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:40,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:40,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 14:58:40,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311557495] [2021-12-21 14:58:40,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:40,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 14:58:40,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:40,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 14:58:40,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-21 14:58:40,876 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-21 14:58:40,877 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 226 transitions, 1752 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) [2021-12-21 14:58:40,877 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:40,877 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-21 14:58:40,877 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:41,076 INFO L129 PetriNetUnfolder]: 227/1069 cut-off events. [2021-12-21 14:58:41,076 INFO L130 PetriNetUnfolder]: For 5100/5217 co-relation queries the response was YES. [2021-12-21 14:58:41,082 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3475 conditions, 1069 events. 227/1069 cut-off events. For 5100/5217 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6666 event pairs, 50 based on Foata normal form. 89/1071 useless extension candidates. Maximal degree in co-relation 3223. Up to 140 conditions per place. [2021-12-21 14:58:41,084 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 46 selfloop transitions, 19 changer transitions 81/252 dead transitions. [2021-12-21 14:58:41,084 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 252 transitions, 2254 flow [2021-12-21 14:58:41,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 14:58:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-21 14:58:41,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1445 transitions. [2021-12-21 14:58:41,086 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7896174863387978 [2021-12-21 14:58:41,086 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1445 transitions. [2021-12-21 14:58:41,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1445 transitions. [2021-12-21 14:58:41,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:41,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1445 transitions. [2021-12-21 14:58:41,088 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) [2021-12-21 14:58:41,089 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) [2021-12-21 14:58:41,089 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) [2021-12-21 14:58:41,089 INFO L186 Difference]: Start difference. First operand has 275 places, 226 transitions, 1752 flow. Second operand 10 states and 1445 transitions. [2021-12-21 14:58:41,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 252 transitions, 2254 flow [2021-12-21 14:58:41,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 252 transitions, 2142 flow, removed 18 selfloop flow, removed 10 redundant places. [2021-12-21 14:58:41,106 INFO L242 Difference]: Finished difference. Result has 271 places, 162 transitions, 937 flow [2021-12-21 14:58:41,106 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1644, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=937, PETRI_PLACES=271, PETRI_TRANSITIONS=162} [2021-12-21 14:58:41,107 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 111 predicate places. [2021-12-21 14:58:41,107 INFO L470 AbstractCegarLoop]: Abstraction has has 271 places, 162 transitions, 937 flow [2021-12-21 14:58:41,107 INFO L471 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) [2021-12-21 14:58:41,107 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:41,107 INFO L254 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] [2021-12-21 14:58:41,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-21 14:58:41,108 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:41,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:41,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1149025959, now seen corresponding path program 3 times [2021-12-21 14:58:41,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:41,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069770689] [2021-12-21 14:58:41,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:41,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:41,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:41,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069770689] [2021-12-21 14:58:41,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069770689] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:41,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:41,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 14:58:41,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340901111] [2021-12-21 14:58:41,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:41,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 14:58:41,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:41,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 14:58:41,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-21 14:58:41,167 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-21 14:58:41,167 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 162 transitions, 937 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) [2021-12-21 14:58:41,167 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:41,167 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-21 14:58:41,167 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:41,322 INFO L129 PetriNetUnfolder]: 154/713 cut-off events. [2021-12-21 14:58:41,322 INFO L130 PetriNetUnfolder]: For 2800/2832 co-relation queries the response was YES. [2021-12-21 14:58:41,326 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2242 conditions, 713 events. 154/713 cut-off events. For 2800/2832 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3752 event pairs, 44 based on Foata normal form. 24/681 useless extension candidates. Maximal degree in co-relation 2198. Up to 84 conditions per place. [2021-12-21 14:58:41,327 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 52 selfloop transitions, 29 changer transitions 14/201 dead transitions. [2021-12-21 14:58:41,327 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 201 transitions, 1471 flow [2021-12-21 14:58:41,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 14:58:41,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-21 14:58:41,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1726 transitions. [2021-12-21 14:58:41,329 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7859744990892532 [2021-12-21 14:58:41,329 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1726 transitions. [2021-12-21 14:58:41,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1726 transitions. [2021-12-21 14:58:41,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:41,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1726 transitions. [2021-12-21 14:58:41,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 143.83333333333334) internal successors, (1726), 12 states have internal predecessors, (1726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:41,333 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) [2021-12-21 14:58:41,333 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) [2021-12-21 14:58:41,333 INFO L186 Difference]: Start difference. First operand has 271 places, 162 transitions, 937 flow. Second operand 12 states and 1726 transitions. [2021-12-21 14:58:41,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 201 transitions, 1471 flow [2021-12-21 14:58:41,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 201 transitions, 1083 flow, removed 18 selfloop flow, removed 58 redundant places. [2021-12-21 14:58:41,341 INFO L242 Difference]: Finished difference. Result has 203 places, 170 transitions, 813 flow [2021-12-21 14:58:41,341 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=813, PETRI_PLACES=203, PETRI_TRANSITIONS=170} [2021-12-21 14:58:41,341 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 43 predicate places. [2021-12-21 14:58:41,341 INFO L470 AbstractCegarLoop]: Abstraction has has 203 places, 170 transitions, 813 flow [2021-12-21 14:58:41,342 INFO L471 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) [2021-12-21 14:58:41,342 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:41,342 INFO L254 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] [2021-12-21 14:58:41,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-21 14:58:41,342 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:41,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:41,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1002327275, now seen corresponding path program 4 times [2021-12-21 14:58:41,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:41,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661243527] [2021-12-21 14:58:41,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:41,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:41,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:41,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:41,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661243527] [2021-12-21 14:58:41,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661243527] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:41,370 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:41,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 14:58:41,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172472902] [2021-12-21 14:58:41,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:41,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 14:58:41,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:41,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 14:58:41,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 14:58:41,372 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2021-12-21 14:58:41,372 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 170 transitions, 813 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) [2021-12-21 14:58:41,372 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:41,372 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2021-12-21 14:58:41,373 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:41,457 INFO L129 PetriNetUnfolder]: 135/728 cut-off events. [2021-12-21 14:58:41,457 INFO L130 PetriNetUnfolder]: For 1957/1995 co-relation queries the response was YES. [2021-12-21 14:58:41,460 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 728 events. 135/728 cut-off events. For 1957/1995 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3881 event pairs, 49 based on Foata normal form. 21/692 useless extension candidates. Maximal degree in co-relation 1852. Up to 100 conditions per place. [2021-12-21 14:58:41,461 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 50 selfloop transitions, 10 changer transitions 0/184 dead transitions. [2021-12-21 14:58:41,461 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 184 transitions, 1036 flow [2021-12-21 14:58:41,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 14:58:41,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-21 14:58:41,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 636 transitions. [2021-12-21 14:58:41,462 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8688524590163934 [2021-12-21 14:58:41,463 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 636 transitions. [2021-12-21 14:58:41,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 636 transitions. [2021-12-21 14:58:41,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:41,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 636 transitions. [2021-12-21 14:58:41,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:41,464 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) [2021-12-21 14:58:41,464 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) [2021-12-21 14:58:41,464 INFO L186 Difference]: Start difference. First operand has 203 places, 170 transitions, 813 flow. Second operand 4 states and 636 transitions. [2021-12-21 14:58:41,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 184 transitions, 1036 flow [2021-12-21 14:58:41,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 184 transitions, 952 flow, removed 12 selfloop flow, removed 9 redundant places. [2021-12-21 14:58:41,470 INFO L242 Difference]: Finished difference. Result has 199 places, 171 transitions, 786 flow [2021-12-21 14:58:41,471 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=786, PETRI_PLACES=199, PETRI_TRANSITIONS=171} [2021-12-21 14:58:41,471 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 39 predicate places. [2021-12-21 14:58:41,471 INFO L470 AbstractCegarLoop]: Abstraction has has 199 places, 171 transitions, 786 flow [2021-12-21 14:58:41,471 INFO L471 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) [2021-12-21 14:58:41,471 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:41,472 INFO L254 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] [2021-12-21 14:58:41,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-21 14:58:41,472 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:41,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:41,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1988601391, now seen corresponding path program 5 times [2021-12-21 14:58:41,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:41,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8331243] [2021-12-21 14:58:41,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:41,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:41,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:41,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:41,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8331243] [2021-12-21 14:58:41,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8331243] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:41,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:41,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 14:58:41,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039262300] [2021-12-21 14:58:41,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:41,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 14:58:41,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:41,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 14:58:41,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-21 14:58:41,561 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-21 14:58:41,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 171 transitions, 786 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) [2021-12-21 14:58:41,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:41,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-21 14:58:41,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:41,718 INFO L129 PetriNetUnfolder]: 161/785 cut-off events. [2021-12-21 14:58:41,719 INFO L130 PetriNetUnfolder]: For 2459/2559 co-relation queries the response was YES. [2021-12-21 14:58:41,722 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2102 conditions, 785 events. 161/785 cut-off events. For 2459/2559 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4375 event pairs, 47 based on Foata normal form. 72/798 useless extension candidates. Maximal degree in co-relation 2072. Up to 84 conditions per place. [2021-12-21 14:58:41,723 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 46 selfloop transitions, 29 changer transitions 25/206 dead transitions. [2021-12-21 14:58:41,723 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 206 transitions, 1269 flow [2021-12-21 14:58:41,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 14:58:41,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-21 14:58:41,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1863 transitions. [2021-12-21 14:58:41,725 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7831021437578815 [2021-12-21 14:58:41,725 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1863 transitions. [2021-12-21 14:58:41,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1863 transitions. [2021-12-21 14:58:41,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:41,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1863 transitions. [2021-12-21 14:58:41,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 143.30769230769232) internal successors, (1863), 13 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:41,728 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) [2021-12-21 14:58:41,729 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) [2021-12-21 14:58:41,729 INFO L186 Difference]: Start difference. First operand has 199 places, 171 transitions, 786 flow. Second operand 13 states and 1863 transitions. [2021-12-21 14:58:41,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 206 transitions, 1269 flow [2021-12-21 14:58:41,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 206 transitions, 1224 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-12-21 14:58:41,735 INFO L242 Difference]: Finished difference. Result has 210 places, 169 transitions, 853 flow [2021-12-21 14:58:41,735 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=853, PETRI_PLACES=210, PETRI_TRANSITIONS=169} [2021-12-21 14:58:41,736 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 50 predicate places. [2021-12-21 14:58:41,736 INFO L470 AbstractCegarLoop]: Abstraction has has 210 places, 169 transitions, 853 flow [2021-12-21 14:58:41,736 INFO L471 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) [2021-12-21 14:58:41,736 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:41,736 INFO L254 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] [2021-12-21 14:58:41,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-21 14:58:41,737 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 14:58:41,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:41,737 INFO L85 PathProgramCache]: Analyzing trace with hash 655643165, now seen corresponding path program 1 times [2021-12-21 14:58:41,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:41,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785120761] [2021-12-21 14:58:41,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:41,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:41,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:41,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:41,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785120761] [2021-12-21 14:58:41,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785120761] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:58:41,794 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:58:41,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 14:58:41,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453283807] [2021-12-21 14:58:41,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:58:41,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 14:58:41,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:41,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 14:58:41,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-21 14:58:41,796 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-21 14:58:41,796 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 169 transitions, 853 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) [2021-12-21 14:58:41,796 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:41,797 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-21 14:58:41,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:41,889 INFO L129 PetriNetUnfolder]: 107/544 cut-off events. [2021-12-21 14:58:41,889 INFO L130 PetriNetUnfolder]: For 1992/2087 co-relation queries the response was YES. [2021-12-21 14:58:41,891 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1496 conditions, 544 events. 107/544 cut-off events. For 1992/2087 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2328 event pairs, 22 based on Foata normal form. 72/564 useless extension candidates. Maximal degree in co-relation 1465. Up to 79 conditions per place. [2021-12-21 14:58:41,892 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 0 selfloop transitions, 0 changer transitions 183/183 dead transitions. [2021-12-21 14:58:41,892 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 183 transitions, 1120 flow [2021-12-21 14:58:41,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 14:58:41,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-21 14:58:41,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1284 transitions. [2021-12-21 14:58:41,893 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7795992714025501 [2021-12-21 14:58:41,893 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1284 transitions. [2021-12-21 14:58:41,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1284 transitions. [2021-12-21 14:58:41,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:41,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1284 transitions. [2021-12-21 14:58:41,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 142.66666666666666) internal successors, (1284), 9 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:41,896 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) [2021-12-21 14:58:41,896 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) [2021-12-21 14:58:41,896 INFO L186 Difference]: Start difference. First operand has 210 places, 169 transitions, 853 flow. Second operand 9 states and 1284 transitions. [2021-12-21 14:58:41,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 183 transitions, 1120 flow [2021-12-21 14:58:41,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 183 transitions, 1039 flow, removed 10 selfloop flow, removed 12 redundant places. [2021-12-21 14:58:41,901 INFO L242 Difference]: Finished difference. Result has 202 places, 0 transitions, 0 flow [2021-12-21 14:58:41,901 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=202, PETRI_TRANSITIONS=0} [2021-12-21 14:58:41,901 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 42 predicate places. [2021-12-21 14:58:41,902 INFO L470 AbstractCegarLoop]: Abstraction has has 202 places, 0 transitions, 0 flow [2021-12-21 14:58:41,902 INFO L471 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) [2021-12-21 14:58:41,904 INFO L764 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-12-21 14:58:41,904 INFO L764 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-12-21 14:58:41,904 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-12-21 14:58:41,904 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-12-21 14:58:41,904 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2021-12-21 14:58:41,904 INFO L764 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2021-12-21 14:58:41,905 INFO L764 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-12-21 14:58:41,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-21 14:58:41,907 INFO L732 BasicCegarLoop]: Path program histogram: [5, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 14:58:41,910 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-21 14:58:41,910 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 14:58:41,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:58:41 BasicIcfg [2021-12-21 14:58:41,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 14:58:41,912 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 14:58:41,912 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 14:58:41,913 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 14:58:41,913 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:58:20" (3/4) ... [2021-12-21 14:58:41,914 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-21 14:58:41,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure qrcu_reader1 [2021-12-21 14:58:41,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure qrcu_reader2 [2021-12-21 14:58:41,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure qrcu_updater [2021-12-21 14:58:41,920 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2021-12-21 14:58:41,920 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-12-21 14:58:41,920 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-21 14:58:41,920 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-21 14:58:41,945 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 14:58:41,945 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 14:58:41,946 INFO L158 Benchmark]: Toolchain (without parser) took 22265.48ms. Allocated memory was 86.0MB in the beginning and 1.9GB in the end (delta: 1.9GB). Free memory was 53.7MB in the beginning and 959.9MB in the end (delta: -906.2MB). Peak memory consumption was 949.5MB. Max. memory is 16.1GB. [2021-12-21 14:58:41,946 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 86.0MB. Free memory was 43.0MB in the beginning and 43.0MB in the end (delta: 40.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 14:58:41,946 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.58ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 53.5MB in the beginning and 71.0MB in the end (delta: -17.6MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2021-12-21 14:58:41,947 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.37ms. Allocated memory is still 104.9MB. Free memory was 71.0MB in the beginning and 68.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 14:58:41,947 INFO L158 Benchmark]: Boogie Preprocessor took 46.92ms. Allocated memory is still 104.9MB. Free memory was 68.6MB in the beginning and 66.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 14:58:41,947 INFO L158 Benchmark]: RCFGBuilder took 511.81ms. Allocated memory is still 104.9MB. Free memory was 66.5MB in the beginning and 32.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2021-12-21 14:58:41,947 INFO L158 Benchmark]: TraceAbstraction took 21246.45ms. Allocated memory was 104.9MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 32.4MB in the beginning and 962.0MB in the end (delta: -929.7MB). Peak memory consumption was 905.9MB. Max. memory is 16.1GB. [2021-12-21 14:58:41,947 INFO L158 Benchmark]: Witness Printer took 33.11ms. Allocated memory is still 1.9GB. Free memory was 962.0MB in the beginning and 959.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 14:58:41,948 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.16ms. Allocated memory is still 86.0MB. Free memory was 43.0MB in the beginning and 43.0MB in the end (delta: 40.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.58ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 53.5MB in the beginning and 71.0MB in the end (delta: -17.6MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.37ms. Allocated memory is still 104.9MB. Free memory was 71.0MB in the beginning and 68.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.92ms. Allocated memory is still 104.9MB. Free memory was 68.6MB in the beginning and 66.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 511.81ms. Allocated memory is still 104.9MB. Free memory was 66.5MB in the beginning and 32.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 21246.45ms. Allocated memory was 104.9MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 32.4MB in the beginning and 962.0MB in the end (delta: -929.7MB). Peak memory consumption was 905.9MB. Max. memory is 16.1GB. * Witness Printer took 33.11ms. Allocated memory is still 1.9GB. Free memory was 962.0MB in the beginning and 959.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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: 21.0s, OverallIterations: 34, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2581 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2581 mSDsluCounter, 1621 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2938 mSDsCounter, 604 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8155 IncrementalHoareTripleChecker+Invalid, 8759 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 604 mSolverCounterUnsat, 538 mSDtfsCounter, 8155 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 407 GetRequests, 73 SyntacticMatches, 6 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2859occurred in iteration=21, InterpolantAutomatonStates: 322, 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, 2.1s InterpolantComputationTime, 2861 NumberOfCodeBlocks, 2861 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2827 ConstructedInterpolants, 0 QuantifiedInterpolants, 15121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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! [2021-12-21 14:58:41,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE